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

Proof of `Finite-state evaluation of terminating branch words` (4th 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

There are finitely many functions on a finite nullary sort, together with finitely many final values and one dead state.