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