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

Proof of `Simultaneous deterministic replacements in finite presentations` (2nd statement)

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

Drill the selected vertex and expand the atomic labels at the others. The inner unit isomorphism identifies filling with relabelling.