(uri-cst-list-list-conc-matchp$ treess conc) → yes/no
Function:
(defun uri-cst-list-list-conc-matchp$ (treess conc) (declare (xargs :guard (and (tree-list-listp treess) (concatenationp conc)))) (let ((__function__ 'uri-cst-list-list-conc-matchp$)) (declare (ignorable __function__)) (and (tree-list-list-terminatedp treess) (tree-list-list-match-concatenation-p treess conc *all-uri-grammar-rules*))))
Theorem:
(defthm booleanp-of-uri-cst-list-list-conc-matchp$ (b* ((yes/no (uri-cst-list-list-conc-matchp$ treess conc))) (booleanp yes/no)) :rule-classes :rewrite)
Theorem:
(defthm uri-cst-list-list-conc-matchp$-of-tree-list-list-fix-treess (equal (uri-cst-list-list-conc-matchp$ (tree-list-list-fix treess) conc) (uri-cst-list-list-conc-matchp$ treess conc)))
Theorem:
(defthm uri-cst-list-list-conc-matchp$-tree-list-list-equiv-congruence-on-treess (implies (tree-list-list-equiv treess treess-equiv) (equal (uri-cst-list-list-conc-matchp$ treess conc) (uri-cst-list-list-conc-matchp$ treess-equiv conc))) :rule-classes :congruence)
Theorem:
(defthm uri-cst-list-list-conc-matchp$-of-concatenation-fix-conc (equal (uri-cst-list-list-conc-matchp$ treess (concatenation-fix conc)) (uri-cst-list-list-conc-matchp$ treess conc)))
Theorem:
(defthm uri-cst-list-list-conc-matchp$-concatenation-equiv-congruence-on-conc (implies (concatenation-equiv conc conc-equiv) (equal (uri-cst-list-list-conc-matchp$ treess conc) (uri-cst-list-list-conc-matchp$ treess conc-equiv))) :rule-classes :congruence)