proposition: Lemma solvabe_bound B : bounded 0 (solvable B).
proof: Proof. repeat solve_bounds. - apply stack_bound. - apply combinations_bound; lia. 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)