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