proposition: Lemma enc_bool_inj b c : M_enc_bool b = M_enc_bool c -> b = c.
proof: Proof. Proof using VIEQ M_ZF. destruct b, c; trivial; cbn. - intros H. contradiction (@M_eset V M M_ZF VIEQ ∅). pattern ∅ at 2. rewrite <- H. apply M_pair; auto. - intros H. contradiction (@M_eset V M M_ZF VIEQ ∅). pattern ∅ at 2. rewrite H. apply M_pair; auto. Qed.
imports: Undecidability.FOL.ZF Undecidability.FOL.Syntax.Facts Undecidability.FOL.Semantics.Tarski.FullFacts Undecidability.FOL.Sets.ZF Lia Undecidability.PCP(PCP Util.PCP_facts Reductions.PCPb_iff_dPCPb) Undecidability(Shared.ListAutomation)