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