proposition: Lemma prv_to_min_ext { p : peirce } : minZFeq' ⊢ rm_const_fm ax_ext.
proof: Proof. prv_all x. prv_all y. apply II. apply II. repeat simpl_ex. apply minZF_ext; auto; prv_all z; apply II. - assert3 H. apply (AllE z) in H. cbn in H. subsimpl_in H. repeat simpl_ex_in H. rewrite imps in H. repeat simpl_ex_in H. apply (Weak H). auto. - assert2 H. apply (AllE z) in H. cbn in H. subsimpl_in H. repeat simpl_ex_in H. rewrite imps in H. repeat simpl_ex_in H. apply (Weak H). 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)