proposition: Lemma rpo_5_4 : forall ta1 ta2 tb1 n2 tc2, rpo (Term ord_psi (ta1:: tb1 ::nil)) (Term ord_cons ((Term ord_psi (ta2:: (Term ord_psi (ta1:: tb1 ::nil)) ::nil)):: (nat_2_term n2) ::tc2::nil)).
proof: Proof. intros; apply rpo_trans with (Term ord_psi (ta2 :: Term ord_psi (ta1 :: tb1 :: nil) :: nil)). - eapply Subterm. + eright; now eleft. + left. - eapply Subterm. + now eleft. + left. 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)