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

Proof of `Translating the modal acceptance game to a sentence` (2nd statement)

groundedproofs/Lax369799Proofs/ModalGameTranslation.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

Select the formula for the initial word state. The same sentence works on every finite input transition system.