Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Iso.connected_iff

∀ {V : Type u} {V' : Type v} {G : SimpleGraph V} {H : SimpleGraph V'} (e : G ≃g H), G.Connected ↔ H.Connected
Defined in
Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
Cited by
1 results in Mathlib
Foundations
Depth 25 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.Iso.isTree_iff · cited by 0Iso.isTree_iffSimpleGraph · cited by 3072SimpleGraphEquiv.surjective · cited by 198Equiv.surjectiveRelIso.toEquiv · cited by 113RelIso.toEquivSimpleGraph.Iso · cited by 99SimpleGraph.IsoSimpleGraph.Connected · cited by 75SimpleGraph.ConnectedSimpleGraph.Iso.symm · cited by 34Iso.symmSimpleGraph.Iso.toHom · cited by 13Iso.toHomSimpleGraph.Connected.map · cited by 1Connected.mapIso.connected_iffCITED BYCITES

Cites8

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.