Theorems · Definition · combinatorics
SimpleGraph.Hom.mapEdgeSet
{V : Type u_1} → {W : Type u_2} → {G : SimpleGraph V} → {G' : SimpleGraph W} → G →g G' → ↑G.edgeSet → ↑G'.edgeSetThe map between edge sets induced by a homomorphism.
The underlying map on edges is given by Sym2.map.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Maps
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Set.Elemstatement and proof · cited by 7,166
- SimpleGraphstatement and proof · cited by 3,072
- Sym2statement · cited by 737
- SimpleGraph.edgeSetstatement and proof · cited by 199
- SimpleGraph.Homstatement and proof · cited by 139
- Sym2.mapproof · cited by 61
Cited by10
Results whose statement or proof uses this declaration.
- SimpleGraph.Iso.mapEdgeSetproof · cited by 3
- SimpleGraph.EdgeLabeling.pullbackproof · cited by 2
- SimpleGraph.Embedding.mapEdgeSetproof · cited by 1
- SimpleGraph.Iso.mapEdgeSet_symm_applystatement · cited by 0
- SimpleGraph.EdgeLabeling.pullback_applystatement · cited by 0
- SimpleGraph.Hom.mapEdgeSet.injectivestatement · cited by 0
- SimpleGraph.Hom.mapEdgeSet_coestatement and proof · cited by 0
- SimpleGraph.Copy.mapEdgeSetproof · cited by 0
- SimpleGraph.Embedding.mapEdgeSet_applystatement · cited by 0
- SimpleGraph.Iso.mapEdgeSet_applystatement · cited by 0