(cst-function-input-conc abnf::cst) → abnf::cstss
Function:
(defun cst-function-input-conc (abnf::cst) (declare (xargs :guard (abnf::treep abnf::cst))) (declare (xargs :guard (cst-matchp abnf::cst "function-input"))) (let ((__function__ 'cst-function-input-conc)) (declare (ignorable __function__)) (abnf::tree-nonleaf->branches abnf::cst)))
Theorem:
(defthm tree-list-listp-of-cst-function-input-conc (b* ((abnf::cstss (cst-function-input-conc abnf::cst))) (abnf::tree-list-listp abnf::cstss)) :rule-classes :rewrite)
Theorem:
(defthm cst-function-input-conc-match (implies (cst-matchp abnf::cst "function-input") (b* ((abnf::cstss (cst-function-input-conc abnf::cst))) (cst-list-list-conc-matchp abnf::cstss "[ %s\"public\" / %s\"private\" / %s\"constant\" ] identifier \":\" type"))) :rule-classes :rewrite)
Theorem:
(defthm cst-function-input-conc-of-tree-fix-cst (equal (cst-function-input-conc (abnf::tree-fix abnf::cst)) (cst-function-input-conc abnf::cst)))
Theorem:
(defthm cst-function-input-conc-tree-equiv-congruence-on-cst (implies (abnf::tree-equiv abnf::cst cst-equiv) (equal (cst-function-input-conc abnf::cst) (cst-function-input-conc cst-equiv))) :rule-classes :congruence)