proposition: Lemma head_LT_cons : forall alpha n beta, nf (cons alpha n beta) -> alpha t1< cons alpha n beta.
proof: Proof. split; 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)