proposition: Lemma extensional_eq_min_Z V (M : @interp sig_empty _ V) rho : extensional M -> (forall phi, minZ phi -> rho ⊨ phi) -> (forall phi, minZeq phi -> rho ⊨ phi).
proof: Proof. intros H1 H2 phi []; try now apply H2; auto using minZ. apply extensional_eq_min'; auto using minZ. 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)