Proof of `Unfolding congruence for deterministic substitution` (1st statement)
groundedproofs/Lax369799Proofs/SystemSubstitution.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
Relabel the flattened system and its inner components by the same alphabet map. Relabelling commutes with flattening, so algebra associativity applies.