proposition: Fact bte_inv_0 s : s ≈ ∅ <-> s = ∅.
proof: Proof. split. + intros H; destruct s; auto. apply bte_discr in H; tauto. + intros ->; 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)