Input decomposition theorem for parse-*bit.
Theorem: input-decomposition-of-parse-*bit
(defthm input-decomposition-of-parse-*bit (b* (((mv & trees rest-input) (parse-*bit input))) (equal (append (tree-list->string trees) rest-input) (nat-list-fix input))))