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

Proof of `Feasible departure times`

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

Suppose one traversal departs at time a and a later traversal departs at b. With traversal time zero the first arrival is a, so feasibility requires a ≤ b. With traversal time one the arrival is a + 1. Since timestamps are integers, a + 1 ≤ b holds exactly when a < b. Applying this to every pair of steps gives both equivalences.