proposition: Lemma LE_phi0 : forall a n b, nf (cons a n b) -> phi0 a t1<= cons a n b.
proof: Proof. intros a n b; repeat split; eauto with T1. apply le_phi0. 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)