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

Proof of `A common condition for finite and infinite algebraic branch words`

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

Combine the linked-pair parity automaton with the finite evaluator. Its second component records the composed action of the unary prefix on a terminal nullary value.