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

Proof of `Departure times on a proper graph`

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

In the paper

  • page 2 of this submission's paper

Description

Consecutive steps have the form u → v → w with u and w distinct because the path never repeats a vertex. Properness forbids equal departure times for these two steps. Since the times are already weakly increasing, each is strictly smaller than its successor.