proposition: Lemma M_enc_stack_app A B : M_enc_stack (A ++ B) = M_enc_stack A ∪ M_enc_stack B.
proof: Proof. Proof using M_ZF VIEQ. induction A as [|[s t] A IH]; cbn. - apply binunion_eset. - rewrite IH. rewrite !binunion_assoc. now rewrite (binunion_com (M_enc_stack B) (M_sing (M_enc_card s t))). 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)