Proof of `Uniform word-RAM model checking for intrinsic MSO sentences` (2nd statement)
groundedproofs/Lax53Proofs/IntrinsicUniformModelChecking.lean · lax-53
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The formula compiler is executed within the counted run. Parameter-only computable envelopes cover its resources, the linear tree evaluator, and the finite layout's machine addresses. Lax58's reusable predicate hides the expanded program and sufficient-width quantifiers without weakening them.