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