Proof of `Evaluation and variable renaming in regular-tree algebras` (1st statement)
groundedproofs/Lax369799Proofs/SystemEvaluation.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
The context labelled by atomic ordinary letters and the supplied hole system is deterministic. Associativity evaluates its flattening by first evaluating its labels; the unit law restores the ordinary letters.