proposition: Lemma min_embed (rho : nat -> V) (phi : form') : sat I rho (embed phi) <-> sat min_model rho phi.
proof: Proof. induction phi in rho |- *; try destruct b0; try destruct q; cbn. 1,3-7: firstorder. erewrite Vector.map_map, Vector.map_ext. reflexivity. apply min_embed_eval. 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 PCPb_to_ZFeq PCPb_to_minZF) Undecidability(Shared.ListAutomation) Morphisms