Proof of `The path criterion and the automaton property` (2nd statement)
groundedproofs/Lax369799Proofs/ExtremalPaths.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.
Description
Split outgoing choices until the presentation is functional. Cover each restriction by its rooted branches and by unmarked tails from every other vertex. Reachability in the original graph extends each such tail to a regular branch, using a finite prefix. Surjectivity of the covering family retains every vertex through substitution. The empty graph is accepted by the empty-yield test.