proposition: Lemma minZF_refl { p : peirce } A t : minZFeq' <<= A -> A ⊢ t ≡' t.
proof: Proof. apply Weak, minZF_refl'. 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)