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