Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Reachable.dist_triangle_left

∀ {V : Type u_1} {G : SimpleGraph V} {u v : V}, G.Reachable u v → ∀ (w : V), G.dist u w ≤ G.dist u v + G.dist v w
Defined in
Mathlib.Combinatorics.SimpleGraph.Metric
Cited by
1 results in Mathlib
Foundations
Depth 77 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph.Adj.diff_dist_adj · cited by 0Adj.diff_dist_adjENat · cited by 4985ENatSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Reachable · cited by 141SimpleGraph.ReachableSimpleGraph.dist · cited by 40SimpleGraph.distENat.natCast_le_natCast · cited by 19ENat.natCast_le_natCastENat.natCast_add · cited by 17ENat.natCast_addReachable.dist_triangle_leftCITED BYCITES

Cites6

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.