proposition: Lemma prv_to_min_eset { p : peirce } : binZF ⊢ rm_const_fm ax_eset.
proof: Proof. prv_all' x. simpl_ex. apply II. assert1 H. use_exists' H y. clear H. eapply IE. 2: eapply CE2, Ctx; auto 1. assert1 H. apply CE1 in H. apply (AllE x) in H. cbn in H. now subsimpl_in H. Qed.
imports: Undecidability.FOL.Syntax.Facts Undecidability.FOL.Syntax.Asimpl Undecidability.FOL.Semantics.Tarski.FullFacts Undecidability.FOL.Deduction.FullNDFacts Undecidability.FOL.Sets(binZF ZF) Undecidability.FOL.Reductions.PCPb_to_ZF Undecidability(Shared.ListAutomation) Morphisms Undecidability.FOL(Reductions.PCPb_to_ZFeq)