Tree matching theorem for parse-exact.
Theorem:
(defthm tree-match-of-parse-exact (b* (((mv error? tree? &) (parse-exact nat input))) (implies (and (not error?) (element-case element :num-val) (num-val-case (element-num-val->get element) :direct) (equal (num-val-direct->get (element-num-val->get element)) (list nat))) (tree-match-element-p tree? element *grammar*))))