Mathlib Map

Theorems · Definition · combinatorics

Equiv.simpleGraph

{V : Type u_1} → {W : Type u_2} → V ≃ W → SimpleGraph V ≃ SimpleGraph W

Equivalent types have equivalent simple graphs.

Defined in
Mathlib.Combinatorics.SimpleGraph.Maps
Cited by
4 results in Mathlib
Foundations
Depth 17 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Equiv.symm_simpleGraph · cited by 0Equiv.symm_simpleGraphEquiv.simpleGraph_apply · cited by 0Equiv.simpleGraph_applyEquiv.simpleGraph_refl · cited by 0Equiv.simpleGraph_reflEquiv.simpleGraph_trans · cited by 0Equiv.simpleGraph_transDFunLike.coe · cited by 62936DFunLike.coeEquiv · cited by 8337EquivEquiv.symm · cited by 3681Equiv.symmSimpleGraph · cited by 3072SimpleGraphSimpleGraph.comap · cited by 29SimpleGraph.comapEquiv.simpleGraphCITED BYCITES

Cites5

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.