proposition: Theorem le_b_phi_ab : forall a b, nf a -> nf b -> b t2<= phi a b.
proof: Proof. intros a b Ha Hb; case (phi_cases a Hb). - destruct 1. + rewrite e;left;auto with T2. + rewrite e;right; auto with T2. - intro x; case x;intros b' (e,(i,i')); subst b; rewrite i. apply lt_succ_le;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)