proposition: Lemma M_eset x : ~ x ∈ ∅.
proof: Proof. Proof using M_ZF VIEQ. refine (@M_ZF (fun _ => ∅) ax_eset _ x). cbn; tauto. Qed.
imports: Undecidability.FOL(Syntax.Facts Semantics.Tarski.FullFacts) Undecidability.FOL(Sets.ZF) Undecidability.FOL(ZF) Undecidability.FOL.TRAKHTENBROT(hfs) Undecidability.Shared.Libs.DLW.Utils(finite) Undecidability(Shared.ListAutomation) Lia