Proof of `Unary presentations associated with legal runs` (2nd statement)
groundedproofs/Lax369799Proofs/RunPresentations.lean · lax-369799
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
All unary labels are selected. Finite choice splitting therefore applies to the run presentation, including its cycles and retained vertices.