proposition: Lemma tail_lt_cons : forall b n a, nf (cons a n b) -> lt b (cons a n b).
proof: Proof. induction b. - eauto with T1. - intros n0 a H; apply head_lt; eapply nf_inv3; eauto. 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)