proposition: Corollary T1_wf : well_founded LT.
proof: Proof. intros alpha; case_eq(nf_b alpha). - intro H; now generalize (nf_Wf H). - intros H; split. destruct 1 as [H1 [H2 H3]]. red in H3; rewrite H in H3; discriminate. 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)