proposition: Lemma rpo_4_1 : forall ta1 ta2 tb1 tb2 n1 n2 tc1 tc2, rpo (Term ord_psi (ta1:: tb1 ::nil)) tb2 -> rpo tc1 (Term ord_psi (ta1:: tb1 ::nil)) -> rpo (Term ord_cons ((Term ord_psi (ta1:: tb1 ::nil)):: (nat_2_term n1) ::tc1::nil)) (Term ord_cons ((Term ord_psi (ta2:: tb2 ::nil)):: (nat_2_term n2) ::tc2::nil)).
proof: Proof. intros. apply rpo_trans with (Term ord_psi (ta2 :: tb2 :: nil)). apply rpo_4_3;auto with T2. eapply Subterm. eleft. reflexivity. left;auto with T2. Qed.
imports: EPSILON0 Arith List Omega Compare_dec Relations Wellfounded Max Tools More_nat AccP not_decreasing EPSILON0 More_nat Gamma0_prelude Gamma0_length term rpo