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

Proof of `Contextual preorders on finite presentations` (5th statement)

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

Replace the finitely many labels one at a time. Drilling a hole at the selected vertex and extending that context by the other presentations reduces each replacement to contextual monotonicity.