proposition: Lemma prv_to_min_trans { p : peirce } : binZF ⊢ rm_const_fm ax_trans.
proof: Proof. prv_all' x. prv_all' y. prv_all' z. repeat simpl_ex. apply II. repeat simpl_ex. apply II. repeat simpl_ex. eapply minZF_trans; auto. 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)