proposition: Lemma lt_epsilon0_ok : forall alpha, nf alpha -> lt_epsilon0 alpha -> alpha t2< epsilon0.
proof: Proof. induction 1;intros; compute;auto with T2. - inversion_clear H1; constructor 2. + auto with T2. + apply IHnf2;auto with T2. - inversion_clear H3; constructor 2;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)