proposition: Lemma ZF_eset { p : peirce } : ZFeq' ⊢ ∀ ¬ $0 ∈ ∅.
proof: Proof. assert (H : ZFeq' ⊢ ax_eset) by (apply Ctx; unfold ZFeq', ZF'; eauto 6). prv_all x. apply (AllE x H). Qed.
imports: Undecidability.FOL(Semantics.Tarski.FullFacts Syntax.Facts Deduction.FullNDFacts) Undecidability.FOL.Sets(ZF minZF) Undecidability.FOL.Reductions(PCPb_to_ZF PCPb_to_minZF PCPb_to_ZFD) Undecidability(Shared.ListAutomation)