proposition: Theorem btm_wf : well_founded (fun s t => s ∈ t).
proof: Proof. apply wf_incl with (1 := btm_depth), wf_inverse_image, lt_wf. Qed.
imports: List Arith Lia Max Wellfounded Setoid Eqdep_dec Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list utils_decidable finite seteq) Undecidability.Shared.Libs.DLW.Vec(pos) Undecidability.Shared.Libs.DLW.Wf(wf_finite wf_chains) Undecidability.FOL.TRAKHTENBROT(notations fol_ops)