(cst-statement-conc2-rep-elem abnf::cst) → abnf::cst1
Function:
(defun cst-statement-conc2-rep-elem (abnf::cst) (declare (xargs :guard (abnf::treep abnf::cst))) (declare (xargs :guard (and (cst-matchp abnf::cst "statement") (equal (cst-statement-conc? abnf::cst) 2)))) (let ((__function__ 'cst-statement-conc2-rep-elem)) (declare (ignorable __function__)) (abnf::tree-fix (nth 0 (cst-statement-conc2-rep abnf::cst)))))
Theorem:
(defthm treep-of-cst-statement-conc2-rep-elem (b* ((abnf::cst1 (cst-statement-conc2-rep-elem abnf::cst))) (abnf::treep abnf::cst1)) :rule-classes :rewrite)
Theorem:
(defthm cst-statement-conc2-rep-elem-match (implies (and (cst-matchp abnf::cst "statement") (equal (cst-statement-conc? abnf::cst) 2)) (b* ((abnf::cst1 (cst-statement-conc2-rep-elem abnf::cst))) (cst-matchp abnf::cst1 "return-statement"))) :rule-classes :rewrite)
Theorem:
(defthm cst-statement-conc2-rep-elem-of-tree-fix-cst (equal (cst-statement-conc2-rep-elem (abnf::tree-fix abnf::cst)) (cst-statement-conc2-rep-elem abnf::cst)))
Theorem:
(defthm cst-statement-conc2-rep-elem-tree-equiv-congruence-on-cst (implies (abnf::tree-equiv abnf::cst cst-equiv) (equal (cst-statement-conc2-rep-elem abnf::cst) (cst-statement-conc2-rep-elem cst-equiv))) :rule-classes :congruence)