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