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

Proof of `Finite presentations without reachability pruning` (2nd statement)

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

The two outer vertices select the two disjoint summands. Their inner vertices are retained without pruning, and the coordinate correspondence preserves and reflects every mark and edge.