Proof of `Finite-state evaluation of terminating branch words` (2nd statement)
groundedproofs/Lax369799Proofs/FiniteBranchWords.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
Associativity evaluates each unary prefix before its suffix. Induction identifies the whole path presentation with iterated unary application.