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