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

Proof of `Reachability on a proper graph`

groundedproofs/Lax330177Proofs/Basic.lean · lax-330177

What this proof establishes

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

In the paper

  • page 2 of this submission's paper

Description

A strict path also satisfies the nonstrict timing rule. For the converse, take a nonstrict path. Consecutive edges form a two-step path with distinct outer vertices. Properness prevents both steps from using the same time. Their weakly increasing times must therefore increase strictly, giving a strict path with the same endpoints.