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

Proof of `Clone-automaton normal form and modal translation` (3rd statement)

groundedproofs/Lax369799Proofs/BisimAutomatonTheorem.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 modal game has a sentence defining its winning region. Accepting runs give winning plays, and sentence invariance transfers this across an unfolding. Conversely, a winning strategy yields a bisimilar finite presentation with an accepting run; the assumed language invariance transfers acceptance back to the input presentation.