Strict paths give nonstrict reachability
Lax330177.StrictInclusion · concepts/Lax330177/StrictInclusion.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
If u can reach v by a strict temporal path, then u can also reach v by a nonstrict temporal path in the same graph.
Concept map
Lean source view on GitHub
| 1 | import Lax330177.Paths |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Strict paths give nonstrict reachability |
| 6 | type: lemma |
| 7 | --- |
| 8 | If u can reach v by a strict temporal path, then u can also reach v by a nonstrict temporal path in the same graph. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.Basic.strict_inclusion.html) |
| 11 | -/ |
| 12 | namespace Lax330177.StrictInclusion |
| 13 | open Lax330177.Representations |
| 14 | open Lax330177.Settings |
| 15 | open Lax330177.Paths |
| 16 | |
| 17 | axiom strict_inclusion {n} {G : Graph n} {u v} : Reaches G .strict u v → Reaches G .nonstrict u v |
| 18 | end Lax330177.StrictInclusion |
| 19 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments