Function:
(defun pdf-cst-dict-entry-conc? (cst) (declare (xargs :guard (treep cst))) (declare (xargs :guard (pdf-cst-matchp cst "dict-entry"))) (let ((__function__ 'pdf-cst-dict-entry-conc?)) (declare (ignorable __function__)) (cond ((equal (tree-nonleaf->rulename? (nth 0 (nth 0 (tree-nonleaf->branches cst)))) (rulename "type-entry")) 1) ((equal (tree-nonleaf->rulename? (nth 0 (nth 0 (tree-nonleaf->branches cst)))) (rulename "reference-entry")) 2) ((equal (tree-nonleaf->rulename? (nth 0 (nth 0 (tree-nonleaf->branches cst)))) (rulename "reference-array-entry")) 3) ((equal (tree-nonleaf->rulename? (nth 0 (nth 0 (tree-nonleaf->branches cst)))) (rulename "rectangle-entry")) 4) ((equal (tree-nonleaf->rulename? (nth 0 (nth 0 (tree-nonleaf->branches cst)))) (rulename "number-entry")) 5) ((equal (tree-nonleaf->rulename? (nth 0 (nth 0 (tree-nonleaf->branches cst)))) (rulename "name-entry")) 6) ((equal (tree-nonleaf->rulename? (nth 0 (nth 0 (tree-nonleaf->branches cst)))) (rulename "font-entry")) 7) ((equal (tree-nonleaf->rulename? (nth 0 (nth 0 (tree-nonleaf->branches cst)))) (rulename "default-entry")) 8) (t (prog2$ (acl2::impossible) 1)))))
Theorem:
(defthm posp-of-pdf-cst-dict-entry-conc? (b* ((number (pdf-cst-dict-entry-conc? cst))) (posp number)) :rule-classes :rewrite)
Theorem:
(defthm pdf-cst-dict-entry-conc?-possibilities (b* ((number (pdf-cst-dict-entry-conc? cst))) (or (equal number 1) (equal number 2) (equal number 3) (equal number 4) (equal number 5) (equal number 6) (equal number 7) (equal number 8))) :rule-classes ((:forward-chaining :trigger-terms ((pdf-cst-dict-entry-conc? cst)))))
Theorem:
(defthm pdf-cst-dict-entry-conc?-of-tree-fix-cst (equal (pdf-cst-dict-entry-conc? (tree-fix cst)) (pdf-cst-dict-entry-conc? cst)))
Theorem:
(defthm pdf-cst-dict-entry-conc?-tree-equiv-congruence-on-cst (implies (tree-equiv cst cst-equiv) (equal (pdf-cst-dict-entry-conc? cst) (pdf-cst-dict-entry-conc? cst-equiv))) :rule-classes :congruence)
Theorem:
(defthm pdf-cst-dict-entry-conc?-1-iff-match-conc (implies (pdf-cst-matchp cst "dict-entry") (iff (equal (pdf-cst-dict-entry-conc? cst) 1) (pdf-cst-list-list-conc-matchp (tree-nonleaf->branches cst) "type-entry"))))
Theorem:
(defthm pdf-cst-dict-entry-conc?-2-iff-match-conc (implies (pdf-cst-matchp cst "dict-entry") (iff (equal (pdf-cst-dict-entry-conc? cst) 2) (pdf-cst-list-list-conc-matchp (tree-nonleaf->branches cst) "reference-entry"))))
Theorem:
(defthm pdf-cst-dict-entry-conc?-3-iff-match-conc (implies (pdf-cst-matchp cst "dict-entry") (iff (equal (pdf-cst-dict-entry-conc? cst) 3) (pdf-cst-list-list-conc-matchp (tree-nonleaf->branches cst) "reference-array-entry"))))
Theorem:
(defthm pdf-cst-dict-entry-conc?-4-iff-match-conc (implies (pdf-cst-matchp cst "dict-entry") (iff (equal (pdf-cst-dict-entry-conc? cst) 4) (pdf-cst-list-list-conc-matchp (tree-nonleaf->branches cst) "rectangle-entry"))))
Theorem:
(defthm pdf-cst-dict-entry-conc?-5-iff-match-conc (implies (pdf-cst-matchp cst "dict-entry") (iff (equal (pdf-cst-dict-entry-conc? cst) 5) (pdf-cst-list-list-conc-matchp (tree-nonleaf->branches cst) "number-entry"))))
Theorem:
(defthm pdf-cst-dict-entry-conc?-6-iff-match-conc (implies (pdf-cst-matchp cst "dict-entry") (iff (equal (pdf-cst-dict-entry-conc? cst) 6) (pdf-cst-list-list-conc-matchp (tree-nonleaf->branches cst) "name-entry"))))
Theorem:
(defthm pdf-cst-dict-entry-conc?-7-iff-match-conc (implies (pdf-cst-matchp cst "dict-entry") (iff (equal (pdf-cst-dict-entry-conc? cst) 7) (pdf-cst-list-list-conc-matchp (tree-nonleaf->branches cst) "font-entry"))))
Theorem:
(defthm pdf-cst-dict-entry-conc?-8-iff-match-conc (implies (pdf-cst-matchp cst "dict-entry") (iff (equal (pdf-cst-dict-entry-conc? cst) 8) (pdf-cst-list-list-conc-matchp (tree-nonleaf->branches cst) "default-entry"))))