proposition: Lemma prv_to_min { p : peirce } phi : phi el ZFeq' -> binZF ⊢ rm_const_fm phi.
proof: Proof. intros [<-|[<-|[<-|[<-|[<-|[<-|[<-|[<-|[<-|[<-|[<-|[]]]]]]]]]]]]. - apply prv_to_min_refl. - apply prv_to_min_sym. - apply prv_to_min_trans. - apply prv_to_min_elem. - apply prv_to_min_ext. - apply prv_to_min_eset. - apply prv_to_min_pair. - apply prv_to_min_union. - apply prv_to_min_power. - apply prv_to_min_om1. - apply prv_to_min_om2. 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)