Proof of `Simultaneous deterministic replacements in finite presentations` (2nd statement)
groundedproofs/Lax369799Proofs/FiniteVertexReplacement.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
Drill the selected vertex and expand the atomic labels at the others. The inner unit isomorphism identifies filling with relabelling.