Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Subgraph.edgeSet_map

∀ {V : Type u} {W : Type v} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G →g G') (H : G.Subgraph),
  (SimpleGraph.Subgraph.map f H).edgeSet = Sym2.map ⇑f '' H.edgeSet
Defined in
Mathlib.Combinatorics.SimpleGraph.Subgraph
Cited by
1 results in Mathlib
Foundations
Depth 18 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.free_killCopies · cited by 0SimpleGraph.free_killCopi…DFunLike.coe · cited by 62936DFunLike.coeSet · cited by 53352SetSet.image · cited by 5609Set.imageSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSym2 · cited by 737Sym2SimpleGraph.Subgraph · cited by 326SimpleGraph.SubgraphSimpleGraph.Hom · cited by 139SimpleGraph.HomSym2.map · cited by 61Sym2.mapSimpleGraph.Subgraph.edgeSet · cited by 37Subgraph.edgeSetSimpleGraph.Subgraph.map · cited by 24Subgraph.mapSimpleGraph.Subgraph.symm · cited by 3Subgraph.symmSym2.fromRel_relationMap · cited by 1Sym2.fromRel_relationMapSubgraph.edgeSet_mapCITED BYCITES

Cites13

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.