Abstract a
(abs-comma-identifier tree) → id
Function:
(defun abs-comma-identifier (tree) (declare (xargs :guard (abnf::treep tree))) (let ((__function__ 'abs-comma-identifier)) (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-identifier tree))))
Theorem:
(defthm string-resultp-of-abs-comma-identifier (b* ((id (abs-comma-identifier tree))) (string-resultp id)) :rule-classes :rewrite)
Theorem:
(defthm abs-comma-identifier-of-tree-fix-tree (equal (abs-comma-identifier (abnf::tree-fix tree)) (abs-comma-identifier tree)))
Theorem:
(defthm abs-comma-identifier-tree-equiv-congruence-on-tree (implies (abnf::tree-equiv tree tree-equiv) (equal (abs-comma-identifier tree) (abs-comma-identifier tree-equiv))) :rule-classes :congruence)