proposition: Lemma nat_lt_cons : forall (n:nat) a p b , rpo (nat_2_term n) (Term ord_cons (a::p::b::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 Lia Compare_dec Relations Wellfounded Wf_nat List Bool Eqdep_dec Ensembles ArithRing Logic) hydras(More_Arith Restriction DecPreOrder rpo.term rpo.rpo Epsilon0.T1)