Proof of `The finite modal acceptance game` (2nd statement)
groundedproofs/Lax369799Proofs/ModalAcceptanceGame.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 word states, input vertices, and sets of state-successor pairs are finite.