Proof of `Finite-state evaluation of terminating branch words` (3rd 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
The state after a unary prefix is its composed action. Reading the final nullary letter applies that action and enters the corresponding final state.