Second induction step of the completeness lemma for parse-alt-rest-comp.
Theorem:
(defthm parse-alt-rest-comp-when-tree-match-induction-step-2 (implies (and (not (mv-nth 0 (parse-ichar #\/ (mv-nth 2 (parse-*cwsp input))))) (not (mv-nth 0 (parse-concatenation (mv-nth 2 (parse-*cwsp (mv-nth 2 (parse-ichar #\/ (mv-nth 2 (parse-*cwsp input))))))))) (pred-concatenation (mv-nth 2 (parse-*cwsp (mv-nth 2 (parse-ichar #\/ (mv-nth 2 (parse-*cwsp input)))))))) (pred-alt-rest-comp input)))