Function:
(defun uri-cst-matchp$ (tree elem) (declare (xargs :guard (and (treep tree) (elementp elem)))) (let ((__function__ 'uri-cst-matchp$)) (declare (ignorable __function__)) (and (tree-terminatedp tree) (tree-match-element-p tree elem *all-uri-grammar-rules*))))
Theorem:
(defthm booleanp-of-uri-cst-matchp$ (b* ((yes/no (uri-cst-matchp$ tree elem))) (booleanp yes/no)) :rule-classes :rewrite)
Theorem:
(defthm uri-cst-matchp$-of-tree-fix-tree (equal (uri-cst-matchp$ (tree-fix tree) elem) (uri-cst-matchp$ tree elem)))
Theorem:
(defthm uri-cst-matchp$-tree-equiv-congruence-on-tree (implies (tree-equiv tree tree-equiv) (equal (uri-cst-matchp$ tree elem) (uri-cst-matchp$ tree-equiv elem))) :rule-classes :congruence)
Theorem:
(defthm uri-cst-matchp$-of-element-fix-elem (equal (uri-cst-matchp$ tree (element-fix elem)) (uri-cst-matchp$ tree elem)))
Theorem:
(defthm uri-cst-matchp$-element-equiv-congruence-on-elem (implies (element-equiv elem elem-equiv) (equal (uri-cst-matchp$ tree elem) (uri-cst-matchp$ tree elem-equiv))) :rule-classes :congruence)