proposition: Lemma lt_a_phi_ab : forall a b, nf a -> nf b -> a t2< phi a b.
proof: Proof. intros; apply lt_le_trans with (phi a zero). - apply phi_alpha_zero_gt_alpha. - apply phi_mono_weak_r;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)