proposition: Lemma rm_const_prv { p : peirce } A phi : (A ++ ZFeq') ⊢ phi -> ((map rm_const_fm A) ++ binZF) ⊢ rm_const_fm phi.
proof: Proof. intros H. now apply (rm_const_prv' 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)