proposition: Lemma bZF_refl { p : peirce } T x : binZF <<= T -> T ⊢ x ≡' x.
proof: Proof. intros H. prv_all' y. apply CI; apply II; auto. Qed.
imports: Undecidability.FOL.Syntax.Facts Undecidability.FOL.Semantics.Tarski.FullFacts Undecidability.FOL.Semantics.Tarski.FullSoundness Undecidability.FOL.Deduction.FullNDFacts Undecidability.FOL.Reductions.PCPb_to_binZF Undecidability.FOL.ZF Undecidability.FOL.FST Undecidability.FOL.Sets(Models.FST_model Models.ZF_model binFST binZF) Lia Undecidability(Shared.ListAutomation)