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

Proof of `Simultaneous deterministic replacements in finite presentations` (1st 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

Process the finite vertex set one vertex at a time. At each stage the current labels outside the selected vertex form its testing context.