proposition: Lemma eval_enc_stack rho B : eval rho (enc_stack B) = M_enc_stack B.
proof: Proof. induction B; cbn; trivial. destruct a. unfold M_enc_card. now rewrite <- IHB, <- !eval_enc_string with (rho:=rho), <- eval_opair. 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)