Theorems · Theorem · combinatorics
SimpleGraph.map_singletonSubgraph
∀ {V : Type u} {W : Type v} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G →g G') {v : V},
SimpleGraph.Subgraph.map f (G.singletonSubgraph v) = G'.singletonSubgraph (f v)- Cited by
- 1 results in Mathlib
- Foundations
- Depth 24 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites16
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Set.imageproof · cited by 5,609
- Bot.botproof · cited by 4,720
- SimpleGraphstatement and proof · cited by 3,072
- Set.extproof · cited by 2,266
- SimpleGraph.Adjstatement · cited by 1,346
- SimpleGraph.Subgraphstatement · cited by 326
- Set.image_singletonproof · cited by 174
- SimpleGraph.Homstatement and proof · cited by 139
- SimpleGraph.Subgraph.extproof · cited by 33
- SimpleGraph.Subgraph.mapstatement · cited by 24
- SimpleGraph.singletonSubgraphstatement and proof · cited by 15
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.toSubgraph_mapproof · cited by 2