(pdf-cst-dict-entry-conc1 cst) → cstss
Function:
(defun pdf-cst-dict-entry-conc1 (cst) (declare (xargs :guard (treep cst))) (declare (xargs :guard (and (pdf-cst-matchp cst "dict-entry") (equal (pdf-cst-dict-entry-conc? cst) 1)))) (let ((__function__ 'pdf-cst-dict-entry-conc1)) (declare (ignorable __function__)) (tree-nonleaf->branches cst)))
Theorem:
(defthm tree-list-listp-of-pdf-cst-dict-entry-conc1 (b* ((cstss (pdf-cst-dict-entry-conc1 cst))) (tree-list-listp cstss)) :rule-classes :rewrite)
Theorem:
(defthm pdf-cst-dict-entry-conc1-match (implies (and (pdf-cst-matchp cst "dict-entry") (equal (pdf-cst-dict-entry-conc? cst) 1)) (b* ((cstss (pdf-cst-dict-entry-conc1 cst))) (pdf-cst-list-list-conc-matchp cstss "type-entry"))) :rule-classes :rewrite)
Theorem:
(defthm pdf-cst-dict-entry-conc1-of-tree-fix-cst (equal (pdf-cst-dict-entry-conc1 (tree-fix cst)) (pdf-cst-dict-entry-conc1 cst)))
Theorem:
(defthm pdf-cst-dict-entry-conc1-tree-equiv-congruence-on-cst (implies (tree-equiv cst cst-equiv) (equal (pdf-cst-dict-entry-conc1 cst) (pdf-cst-dict-entry-conc1 cst-equiv))) :rule-classes :congruence)