Abstract a
(abs-comma-constraint tree) → expr
Function:
(defun abs-comma-constraint (tree) (declare (xargs :guard (abnf::treep tree))) (let ((__function__ 'abs-comma-constraint)) (declare (ignorable __function__)) (b* (((okf (abnf::tree-list-tuple2 sub)) (check-tree-nonleaf-2 tree nil)) ((okf tree) (check-tree-list-1 sub.1st)) ((okf &) (check-tree-ichars tree ",")) ((okf tree) (check-tree-list-1 sub.2nd))) (abs-constraint tree))))
Theorem:
(defthm constraint-resultp-of-abs-comma-constraint (b* ((expr (abs-comma-constraint tree))) (constraint-resultp expr)) :rule-classes :rewrite)
Theorem:
(defthm abs-comma-constraint-of-tree-fix-tree (equal (abs-comma-constraint (abnf::tree-fix tree)) (abs-comma-constraint tree)))
Theorem:
(defthm abs-comma-constraint-tree-equiv-congruence-on-tree (implies (abnf::tree-equiv tree tree-equiv) (equal (abs-comma-constraint tree) (abs-comma-constraint tree-equiv))) :rule-classes :congruence)