Proof of `Substitution closure of deterministic values` (1st statement)
groundedproofs/Lax369799Proofs/FiniteDeterministicElements.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
Each flattened vertex belongs to a chosen generating presentation, so its label still has rank at most one. Associativity gives the evaluation law.