proposition: Lemma phi0_mono_strict_LT : forall alpha beta, alpha t1< beta -> phi0 alpha t1< phi0 beta.
proof: Proof. intros. apply LT2; eauto with T1. 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)