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

Proof of `Unary presentations associated with legal runs` (2nd statement)

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

All unary labels are selected. Finite choice splitting therefore applies to the run presentation, including its cycles and retained vertices.