proposition: Lemma lt_epsilon0_trans : forall a, lt_epsilon0 a -> nf a -> forall b, lt b a -> nf b -> lt_epsilon0 b.
proof: Proof. intros; apply lt_epsilon0_okR; auto. apply lt_trans with a; auto. apply lt_epsilon0_ok;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)