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

Proof of `Modal transitions obtained from type supports` (3rd statement)

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

Mark every successor by the word state reached through a direction of the run. Determinism supplies a successor for each supported type, and every decoded edge is covered by its direction's type. At a leaf the assumed final-state test supplies the nullary disjunct.