Proof of `Uniform word-RAM model checking for intrinsic MSO sentences` (1st statement)
groundedproofs/Lax53Proofs/FixedSentenceModelChecking.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
Specialize the pure automaton before program choice, then materialize it within a counted tree-only run from zero memory. The reusable predicate packages the program and all sufficient-width premises.