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

Proof of `Word acceptance and evaluation of algebraic runs` (4th statement)

groundedproofs/Lax369799Proofs/RunAcceptance.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.

Read the Lean proof on GitHub

Description

Specialize the common finite/infinite algebraic condition to the unary and nullary sorts of the yield-syntactic algebra.