Combination of parse-conc-rest-comp-when-tree-match-induction-step-1 and parse-conc-rest-comp-when-tree-match-induction-step-2.
Theorem:
(defthm parse-conc-rest-comp-when-tree-match-induction-step-1+2 (implies (and (not (mv-nth 0 (parse-1*cwsp input))) (pred-repetition (mv-nth 2 (parse-1*cwsp input)))) (pred-conc-rest-comp input)))