Proof of `Unit traversal time`
groundedproofs/Lax330177Proofs/UniformCosts.lean · lax-330177
What this proof establishes
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
Set c to one in the elapsed-time identity. A path with k hops and w units of waiting takes k + w units from departure to arrival. Comparing this sum over all feasible paths is therefore exactly the comparison that defines a fastest path.