proposition: Lemma rpo_6_4 : forall ta1 tb1 n2 tc2, (0 < n2)%nat -> rpo (Term ord_psi (ta1:: tb1 ::nil)) (Term ord_cons ((Term ord_psi (ta1:: tb1 ::nil)):: (nat_2_term n2) ::tc2::nil)).
proof: Proof. intros; eapply Subterm; [| eleft]. now 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)