Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.ConnectedComponent.eq

∀ {V : Type u} {G : SimpleGraph V} {v w : V}, G.connectedComponentMk v = G.connectedComponentMk w ↔ G.Reachable v w
Defined in
Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
Cited by
2 results in Mathlib
Foundations
Depth 14 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.ComponentCompl.mem_of_adj · cited by 1ComponentCompl.mem_of_adjSimpleGraph.componentComplMk_eq_of_adj · cited by 0SimpleGraph.componentComp…SimpleGraph · cited by 3072SimpleGraphSimpleGraph.Reachable · cited by 141SimpleGraph.ReachableSimpleGraph.ConnectedComponent · cited by 86SimpleGraph.ConnectedComp…SimpleGraph.connectedComponentMk · cited by 40SimpleGraph.connectedComp…Quotient.eq' · cited by 14Quotient.eq'ConnectedComponent.eqCITED BYCITES

Cites5

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

Cited by2

Results whose statement or proof uses this declaration.