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

Proof of `Word acceptance and evaluation of algebraic runs` (1st 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

Project each regular branch of the unary run presentation into the input run. Word correctness and branch evaluation give acceptance of every regular branch; choice splitting gives acceptance of the graph.