proposition: Lemma extensional_eq_min' V (M : @interp sig_empty _ V) rho : extensional M -> rho ⊫ minZF' -> rho ⊫ minZFeq'.
proof: Proof. intros H1 H2 phi [<-|[<-|[<-|[<-|H]]]]; try now apply H2. all: cbn; intros; rewrite !H1 in *; congruence. 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)