Proof of `Evaluation of finite path graphs`
groundedproofs/Lax369799Proofs/FinitePathEvaluation.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
Separate the first vertex by the flattening isomorphism. Associativity reduces its suffix to a value, and induction gives the word evaluation.