Theorems · Theorem · combinatorics
SimpleGraph.reachable_of_edist_ne_top
∀ {V : Type u_1} {G : SimpleGraph V} {u v : V}, G.edist u v ≠ ⊤ → G.Reachable u v- Defined in
- Mathlib.Combinatorics.SimpleGraph.Metric
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 35 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topstatement and proof · cited by 9,680
- ENatstatement · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Reachablestatement · cited by 141
- SimpleGraph.ediststatement and proof · cited by 55
- Function.mtproof · cited by 27
- SimpleGraph.edist_eq_top_of_not_reachableproof · cited by 4
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.edist_ne_top_iff_reachableproof · cited by 4
- SimpleGraph.exists_walk_of_edist_ne_topproof · cited by 4