Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Iso.map_adj_iff

∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G ≃g G') {v w : V},
  G'.Adj (f v) (f w) ↔ G.Adj v w
Defined in
Mathlib.Combinatorics.SimpleGraph.Maps
Cited by
2 results in Mathlib
Foundations
Depth 22 from the axioms · uses Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.Iso.map_mem_edgeSet_iff · cited by 1Iso.map_mem_edgeSet_iffSimpleGraph.Iso.apply_mem_neighborSet_iff · cited by 0Iso.apply_mem_neighborSet…DFunLike.coe · cited by 62936DFunLike.coeSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.Iso · cited by 99SimpleGraph.IsoRelIso.map_rel_iff · cited by 17RelIso.map_rel_iffIso.map_adj_iffCITED 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.