While this submission is a draft, it cannot be used by other submissions.

Proof of `The finite modal acceptance game` (2nd statement)

groundedproofs/Lax369799Proofs/ModalAcceptanceGame.lean · lax-369799

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

The word states, input vertices, and sets of state-successor pairs are finite.