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

Proof of `Unfolding congruence for deterministic substitution` (1st statement)

groundedproofs/Lax369799Proofs/SystemSubstitution.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 flattened system and its inner components by the same alphabet map. Relabelling commutes with flattening, so algebra associativity applies.