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