(cst-uppercase-letter-conc-rep abnf::cst) → abnf::csts
Function:
(defun cst-uppercase-letter-conc-rep (abnf::cst) (declare (xargs :guard (abnf::treep abnf::cst))) (declare (xargs :guard (cst-matchp abnf::cst "uppercase-letter"))) (let ((__function__ 'cst-uppercase-letter-conc-rep)) (declare (ignorable __function__)) (abnf::tree-list-fix (nth 0 (cst-uppercase-letter-conc abnf::cst)))))
Theorem:
(defthm tree-listp-of-cst-uppercase-letter-conc-rep (b* ((abnf::csts (cst-uppercase-letter-conc-rep abnf::cst))) (abnf::tree-listp abnf::csts)) :rule-classes :rewrite)
Theorem:
(defthm cst-uppercase-letter-conc-rep-match (implies (cst-matchp abnf::cst "uppercase-letter") (b* ((abnf::csts (cst-uppercase-letter-conc-rep abnf::cst))) (cst-list-rep-matchp abnf::csts "%x41-5A"))) :rule-classes :rewrite)
Theorem:
(defthm cst-uppercase-letter-conc-rep-of-tree-fix-cst (equal (cst-uppercase-letter-conc-rep (abnf::tree-fix abnf::cst)) (cst-uppercase-letter-conc-rep abnf::cst)))
Theorem:
(defthm cst-uppercase-letter-conc-rep-tree-equiv-congruence-on-cst (implies (abnf::tree-equiv abnf::cst cst-equiv) (equal (cst-uppercase-letter-conc-rep abnf::cst) (cst-uppercase-letter-conc-rep cst-equiv))) :rule-classes :congruence)