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

Proof of `Walks and paths have the same reachability`

groundedproofs/Lax330177Proofs/Basic.lean · lax-330177

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

If a walk visits a vertex twice, delete the steps between those visits. The remaining prefix and suffix join at the same vertex. Their departure times form a subsequence of the original times, so they still satisfy the chosen timing rule. Each deletion shortens the walk and preserves its endpoints. Eventually no vertex repeats, giving a path. Conversely, every path is already a walk.