Second induction step of the completeness lemma for parse-conc-rest.
Theorem:
(defthm parse-conc-rest-when-tree-list-match-induction-step-2 (implies (and (not (mv-nth 0 (parse-conc-rest-comp input))) (< (len (mv-nth 2 (parse-conc-rest-comp input))) (len input)) (pred-conc-rest-comp input) (pred-conc-rest (mv-nth 2 (parse-conc-rest-comp input)))) (pred-conc-rest input)))