First induction step of the completeness lemma for parse-concatenation.
Theorem: parse-concatenation-when-tree-match-induction-step-1
(defthm parse-concatenation-when-tree-match-induction-step-1 (implies (and (mv-nth 0 (parse-repetition input)) (pred-repetition input)) (pred-concatenation input)))