Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.reachable_eq_reflTransGen

∀ {V : Type u} {G : SimpleGraph V}, G.Reachable = Relation.ReflTransGen G.Adj
Defined in
Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
Cited by
1 results in Mathlib
Foundations
Depth 10 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.reachable_fromEdgeSet_eq_reflTransGen_toRel · cited by 1SimpleGraph.reachable_fro…SimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.Reachable · cited by 141SimpleGraph.ReachableRelation.ReflTransGen · cited by 104Relation.ReflTransGenSimpleGraph.reachable_iff_reflTransGen · cited by 3SimpleGraph.reachable_iff…SimpleGraph.reachable_eq_refl…CITED BYCITES

Cites5

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.