Input decomposition theorem for parse-alpha.
Theorem:
(defthm input-decomposition-of-parse-alpha (b* (((mv error? tree? rest-input) (parse-alpha input))) (implies (not error?) (equal (append (tree->string tree?) rest-input) (nat-list-fix input)))))