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

Proof of `Translating the modal acceptance game to a sentence` (1st 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

Induct over the priority binders, using formula substitution and scalar elimination of each finite simultaneous fixed point.