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