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