Proof of `Finite-state evaluation of terminating branch words` (4th 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
There are finitely many functions on a finite nullary sort, together with finitely many final values and one dead state.