Tree matching theorem for parse-*-rule-/-*cwsp-cnl.
Theorem:
(defthm tree-list-match-of-parse-*-rule-/-*cwsp-cnl (b* (((mv & trees &) (parse-*-rule-/-*cwsp-cnl input))) (and (implies (equal repetition (*_ (!_ (/_ *rule*) (/_ (!_ (/_ (*_ *c-wsp*) *c-nl*)))))) (tree-list-match-repetition-p trees repetition *grammar*)) (implies (equal element (!_ (/_ *rule*) (/_ (!_ (/_ (*_ *c-wsp*) *c-nl*))))) (tree-list-match-element-p trees element *grammar*)))))