proposition: Lemma nf_intro' : forall a n b, nf a -> nf b -> lt b (cons a 0 zero) -> nf (cons a n b).
proof: Proof. destruct b. - eauto with T1. - intros H H0 H1; apply cons_nf; auto. now apply lt_a_phi0_b_inv in H1. 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)