proposition: Lemma rpo_5_3 : forall ta1 ta2 tb1 n1 tc1, 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_psi (ta2:: (Term ord_psi (ta1:: tb1 ::nil)) ::nil)).
proof: Proof. intros. apply Top_gt. simpl;auto with T2. inversion_clear 1; try subst s'. apply rpo_5_2;auto with T2. destruct H1 as [<-|[<-|[]]]. apply nat_lt_psi. apply rpo_trans with (Term ord_psi (ta1 :: tb1 :: nil)). auto with T2. apply rpo_5_2;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