proposition: Lemma rpo_7_1 : forall ta1 tb1 n1 tc1 tc2, rpo tc1 (Term ord_psi (ta1:: tb1 ::nil)) -> rpo tc1 tc2 -> 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 n1) ::tc2::nil)).
proof: Proof. intros; apply Top_eq_lex. - simpl;auto with T2. - right. right. left; auto with T2. - inversion_clear 1; try subst s'. + eapply Subterm; [| eleft]. left;auto with T2. + destruct H2 as [<-|[<-|[]]]. * apply nat_lt_cons. * eapply rpo_trans. -- eexact H. -- eapply Subterm; [| eleft]. left;auto with T2. Qed.
imports: Coq(Arith List Lia Compare_dec Relations Wellfounded RelationClasses) hydras(Epsilon0) hydras(More_Arith Restriction) hydras(ON_Generic) hydras(rpo.term rpo.rpo) hydras(T2) hydras(Compat815)