proposition: Lemma nat_lt_cons : forall (n:nat) t p c , rpo (nat_2_term n) (Term ord_cons (t::p::c::nil)).
proof: Proof. induction n;simpl. - constructor 2. + simpl; trivial. + destruct 1. - constructor 2. + simpl; trivial. + inversion_clear 1. * subst s';apply IHn. * case H0. 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)