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