proposition: Theorem conservativity_back_ZF' { p : peirce } phi : minZFeq' ⊢ phi -> ZFeq' ⊢ embed phi.
proof: Proof. intros HP. apply prv_embed in HP. apply (prv_cut HP). intros psi' [psi[<- H]] % in_map_iff. now apply embed_ZF'. 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)