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

Proof of `The same timed paths`

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

Fix the vertex sequence and its departure times. Both path definitions require distinct vertices and an available edge at every departure. For uniform time zero, arrival before or at the next departure means that departure times are weakly increasing. For uniform time one, it means that the integer times are strictly increasing. Thus the same sequences satisfy either description exactly in the stated mode.