Function:
(defun pdf-cst-dict-entry-conc3-rep-elem (cst) (declare (xargs :guard (treep cst))) (declare (xargs :guard (and (pdf-cst-matchp cst "dict-entry") (equal (pdf-cst-dict-entry-conc? cst) 3)))) (let ((__function__ 'pdf-cst-dict-entry-conc3-rep-elem)) (declare (ignorable __function__)) (tree-fix (nth 0 (pdf-cst-dict-entry-conc3-rep cst)))))
Theorem:
(defthm treep-of-pdf-cst-dict-entry-conc3-rep-elem (b* ((cst1 (pdf-cst-dict-entry-conc3-rep-elem cst))) (treep cst1)) :rule-classes :rewrite)
Theorem:
(defthm pdf-cst-dict-entry-conc3-rep-elem-match (implies (and (pdf-cst-matchp cst "dict-entry") (equal (pdf-cst-dict-entry-conc? cst) 3)) (b* ((cst1 (pdf-cst-dict-entry-conc3-rep-elem cst))) (pdf-cst-matchp cst1 "reference-array-entry"))) :rule-classes :rewrite)
Theorem:
(defthm pdf-cst-dict-entry-conc3-rep-elem-of-tree-fix-cst (equal (pdf-cst-dict-entry-conc3-rep-elem (tree-fix cst)) (pdf-cst-dict-entry-conc3-rep-elem cst)))
Theorem:
(defthm pdf-cst-dict-entry-conc3-rep-elem-tree-equiv-congruence-on-cst (implies (tree-equiv cst cst-equiv) (equal (pdf-cst-dict-entry-conc3-rep-elem cst) (pdf-cst-dict-entry-conc3-rep-elem cst-equiv))) :rule-classes :congruence)