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

Proof of `Finite presentations without reachability pruning` (1st statement)

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

Keep all vertices at each stage. Reassociate the three vertex coordinates, then account for the finite enumerations on the two intermediate graphs. The associator preserves and reflects every mark and transition.