proposition: Lemma lt_a_phi0_b_iff : forall a b, nf a -> nf b -> (b <_phi0 a <-> forall n, nf (cons a n b)).
proof: Proof. split. - intros; now apply nf_intro. - intro; now apply lt_a_phi0_b_intro with 0. Qed.
imports: Coq(Arith Max Bool Lia Compare_dec Relations Ensembles Wellfounded Bool RelationClasses Operators_Properties ArithRing Logic.Eqdep_dec) hydras(More_Arith Restriction DecPreOrder) hydras(OrdNotations)