Completeness theorem for parse-in-range.
Theorem:
(defthm parse-in-range-when-tree-match (implies (and (tree-match-element-p tree element *grammar*) (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)) (equal (parse-in-range min max (append (tree->string tree) rest-input)) (mv nil (tree-fix tree) (nat-list-fix rest-input)))))