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

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.

Read the Lean proof on GitHub

Description

Separate the first vertex by the flattening isomorphism. Associativity reduces its suffix to a value, and induction gives the word evaluation.