proposition: Lemma prep_string_bound s t n : bounded_t n t -> bounded_t n (prep_string s t).
proof: Proof. intros Ht. induction s; cbn; trivial. repeat solve_bounds; trivial. all: apply bool_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)