proposition: Lemma stack_bound B n : bounded_t n (enc_stack B).
proof: Proof. induction B as [|[s t] B IH]; cbn; repeat solve_bounds; trivial. all: apply string_bound. 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)