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