proposition: Lemma minZF_refl' { p : peirce } t : minZFeq' ⊢ t ≡' t.
proof: Proof. change (minZFeq' ⊢ ($0 ≡' $0)[t..]). apply AllE. apply Ctx. firstorder. 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)