proposition: Lemma rpo_3_1 : forall ta1 tb1 tb2 n1 n2 tc1 tc2, rpo tb1 tb2 -> 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_cons ((Term ord_psi (ta1:: tb2 ::nil))::(nat_2_term n2) ::tc2::nil)).
proof: Proof. intros; apply rpo_trans with (Term ord_psi (ta1 :: tb2 :: nil)). - apply rpo_3_3;auto with T2. - eapply Subterm. + now 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)