Abstract an
(abs-input-expression tree) → inexpr
Function:
(defun abs-input-expression (tree) (declare (xargs :guard (abnf::treep tree))) (let ((__function__ 'abs-input-expression)) (declare (ignorable __function__)) (b* (((okf tree) (abnf::check-tree-nonleaf-1-1 tree "input-expression")) ((okf expr) (abs-expression tree))) (input-expression expr))))
Theorem:
(defthm input-expression-resultp-of-abs-input-expression (b* ((inexpr (abs-input-expression tree))) (input-expression-resultp inexpr)) :rule-classes :rewrite)
Theorem:
(defthm abs-input-expression-of-tree-fix-tree (equal (abs-input-expression (abnf::tree-fix tree)) (abs-input-expression tree)))
Theorem:
(defthm abs-input-expression-tree-equiv-congruence-on-tree (implies (abnf::tree-equiv tree tree-equiv) (equal (abs-input-expression tree) (abs-input-expression tree-equiv))) :rule-classes :congruence)