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

Proof of `Finite-state evaluation of terminating branch words` (2nd statement)

groundedproofs/Lax369799Proofs/FiniteBranchWords.lean · lax-369799

What this proof establishes

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

Associativity evaluates each unary prefix before its suffix. Induction identifies the whole path presentation with iterated unary application.