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

Proof of `Relabelling and deterministic context substitution` (1st statement)

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

Relabel the context and use associativity to replace each inserted system by its value. Equal values give the same filled context. Unfolding invariance of the algebra is not needed.