proposition: Lemma bti_dec s t : { s ⊆ t } + { ~ s ⊆ t }.
proof: Proof. destruct btm_fa_dec with (P := fun x => x ∈ t) (t := s) as [ (? & ? & ?) | ]; eauto. 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)