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