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