Tree matching theorem for parse-prose-val.
Theorem:
(defthm tree-match-of-parse-prose-val (b* (((mv error? tree? &) (parse-prose-val input))) (implies (and (not error?) (equal element (element-rulename *prose-val*))) (tree-match-element-p tree? element *grammar*))))