Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Reachable.rfl

∀ {V : Type u} {G : SimpleGraph V} {u : V}, G.Reachable u u
Defined in
Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
Cited by
4 results in Mathlib
Foundations
Depth 4 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.IsEdgeReachable.rfl · cited by 2IsEdgeReachable.rflSimpleGraph.reachable_or_compl_adj · cited by 1SimpleGraph.reachable_or_…SimpleGraph.reachable_bot · cited by 1SimpleGraph.reachable_botSimpleGraph.Reachable.of_isUniversal · cited by 1Reachable.of_isUniversalSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Reachable · cited by 141SimpleGraph.ReachableSimpleGraph.Reachable.refl · cited by 10Reachable.reflReachable.rflCITED BYCITES

Cites3

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

Cited by4

Results whose statement or proof uses this declaration.