proposition: Lemma phi_mono_RR : forall a b c, nf a -> nf b -> nf c -> phi a b t2< phi a c -> b t2< c.
proof: Proof. intros;tricho b c T;auto. subst c. case (lt_irr H2). case (lt_not_gt H2). apply phi_mono_r;auto. 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)