Proof of `The same reachable pairs`
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
Choose a path witnessing reachability. With uniform traversal time one, feasibility requires strictly increasing integer departures. With time zero, it requires weakly increasing departures. In either case the same timed path witnesses reachability in the corresponding mode. Reading the timing equivalence in reverse gives the converse.