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

Proof of `Algebraic evaluation and the words of a regular branch`

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

A terminating branch covers the entire unary system. An infinite branch visits every vertex, and the unary graph evaluation theorem applies. If there is a leaf, reachability supplies a terminating branch; otherwise all vertices are unary and the successor function supplies an infinite one.