proposition: Lemma prv_to_min_elem { p : peirce } : minZFeq' ⊢ rm_const_fm ax_eq_elem.
proof: Proof. prv_all x. prv_all y. prv_all u. prv_all v. repeat simpl_ex. apply II. repeat simpl_ex. apply II. repeat simpl_ex. apply II. repeat simpl_ex. eapply minZF_elem; auto. Qed.
imports: Undecidability.FOL.ZF Undecidability.FOL.Syntax.Facts Undecidability.FOL.Semantics.Tarski.FullFacts Undecidability.FOL.Sets(minZF ZF) Undecidability.FOL.Sets.ZF Undecidability.FOL.Reductions.PCPb_to_ZF Undecidability(Shared.ListAutomation)