Proof of `The terminating-word condition for algebraic runs` (1st statement)
groundedproofs/Lax369799Proofs/RunWordCondition.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
Decoding commutes with the fold of encoded unary actions. The direct path evaluation theorem identifies the resulting accepting value.