fact: Definition btm_select (P : _ -> Prop) t : (forall s t, s ≈ t -> P s -> P t) -> (forall x, x ∈ t -> { P x } + { ~ P x }) -> { s | forall x, x ∈ s <-> x ∈ t /\ P x }.
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)