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