proposition: Theorem btm_finite_t t : { l | forall s, s ∈ t <-> exists s', s ≈ s' /\ s' ∊ l }.
proof: Proof. exists (bt_list t); apply bt_list_spec. 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)