proposition: Lemma rpo_2_2 : forall ta1 ta2 tb1 tb2 , rpo ta1 ta2 -> rpo tb1 (Term ord_psi (ta2:: tb2::nil)) -> rpo (Term ord_psi (ta1:: tb1 ::nil)) (Term ord_psi (ta2:: tb2 ::nil)).
proof: Proof. intros. apply Top_eq_lex. simpl;auto with T2. left. auto with T2. auto with T2. inversion_clear 1; try subst s'. apply rpo_trans with ta2;auto with T2. eapply Subterm. 2:eleft. left. auto with T2. destruct H2. subst s'. auto with T2. case H1. 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