Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Iso.mapEdgeSet_apply

∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G ≃g G') (e : ↑G.edgeSet),
  f.mapEdgeSet e = SimpleGraph.Hom.mapEdgeSet (RelIso.toRelEmbedding f).toRelHom e
Defined in
Mathlib.Combinatorics.SimpleGraph.Maps
Cited by
0 results in Mathlib
Foundations
Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

DFunLike.coe · cited by 62936DFunLike.coeEquiv · cited by 8337EquivSet.Elem · cited by 7166Set.ElemSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSym2 · cited by 737Sym2SimpleGraph.edgeSet · cited by 199SimpleGraph.edgeSetSimpleGraph.Iso · cited by 99SimpleGraph.IsoRelIso.toRelEmbedding · cited by 34RelIso.toRelEmbeddingRelEmbedding.toRelHom · cited by 15RelEmbedding.toRelHomSimpleGraph.Hom.mapEdgeSet · cited by 6Hom.mapEdgeSetSimpleGraph.Iso.mapEdgeSet · cited by 3Iso.mapEdgeSetIso.mapEdgeSet_applyCITED BYCITES

Cites12

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

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.