proposition: Fact bte_incl_equiv s t : s ≈ t <-> s ⊆ t /\ t ⊆ s.
proof: Proof. split. + intro; split; apply bte_bti; auto. + intros []; apply bti_equiv; auto. 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)