Proof of `A simple graph can separate the traversal modes`
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.
Description
Let the only arcs be 0 → 1 and 1 → 2, both at time 0. Each has one label, so the graph is simple. They form a two-step path from 0 to 2 at the same time, so it fails properness. Taking both arcs at time 0 reaches vertex 2 nonstrictly from 0. A strict path would need two distinct times, since there is no direct arc.