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

Proof of `Strict paths give nonstrict 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

Take a strict path between the two vertices and keep its vertices and departure times. Every strict increase is also a weak increase, so the same path witnesses nonstrict reachability.