Tree matching theorem for parse-*bit.
Theorem:
(defthm tree-list-match-of-parse-*bit (b* (((mv & trees &) (parse-*bit input))) (and (implies (equal repetition (*_ *bit*)) (tree-list-match-repetition-p trees repetition *grammar*)) (implies (equal element (element-rulename *bit*)) (tree-list-match-element-p trees element *grammar*)))))