proposition: Lemma rpo_6_1 : forall ta1 tb1 n1 n2 tc1 tc2, rpo tc1 (Term ord_psi (ta1:: tb1 ::nil)) -> (n1 < n2)%nat -> rpo (Term ord_cons ((Term ord_psi (ta1:: tb1 ::nil)):: (nat_2_term n1) ::tc1::nil)) (Term ord_cons ((Term ord_psi (ta1:: tb1 ::nil)):: (nat_2_term n2) ::tc2::nil)).
proof: Proof. intros. apply Top_eq_lex. simpl;auto with T2. right. left. apply nat_2_term_mono;auto with T2. auto with T2. inversion_clear 1; try subst s'. eapply Subterm. 2:eleft. left;auto with T2. destruct H2 as [<-|[<-|[]]]. apply nat_lt_cons. eapply rpo_trans. eexact H. eapply Subterm. 2:eleft. 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