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