(smtp-cst-wsp-conc2 cst) → cstss
Function:
(defun smtp-cst-wsp-conc2 (cst) (declare (xargs :guard (treep cst))) (declare (xargs :guard (and (smtp-cst-matchp cst "wsp") (equal (smtp-cst-wsp-conc? cst) 2)))) (let ((__function__ 'smtp-cst-wsp-conc2)) (declare (ignorable __function__)) (tree-nonleaf->branches cst)))
Theorem:
(defthm tree-list-listp-of-smtp-cst-wsp-conc2 (b* ((cstss (smtp-cst-wsp-conc2 cst))) (tree-list-listp cstss)) :rule-classes :rewrite)
Theorem:
(defthm smtp-cst-wsp-conc2-match (implies (and (smtp-cst-matchp cst "wsp") (equal (smtp-cst-wsp-conc? cst) 2)) (b* ((cstss (smtp-cst-wsp-conc2 cst))) (smtp-cst-list-list-conc-matchp cstss "htab"))) :rule-classes :rewrite)
Theorem:
(defthm smtp-cst-wsp-conc2-of-tree-fix-cst (equal (smtp-cst-wsp-conc2 (tree-fix cst)) (smtp-cst-wsp-conc2 cst)))
Theorem:
(defthm smtp-cst-wsp-conc2-tree-equiv-congruence-on-cst (implies (tree-equiv cst cst-equiv) (equal (smtp-cst-wsp-conc2 cst) (smtp-cst-wsp-conc2 cst-equiv))) :rule-classes :congruence)