Proof of `A computable finite-model bound under bisimulation invariance` (2nd statement)
groundedproofs/Lax369799Proofs/QuantitativeFiniteTheorem.lean · lax-369799
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 bounded modal certificate and the word-state small-model theorem supply a model within the syntax-computed bound whenever the invariant MSO sentence has a finite reachable model.