Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.map_verts
∀ {V : Type u} {W : Type v} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G →g G') (H : G.Subgraph),
(SimpleGraph.Subgraph.map f H).verts = ⇑f '' H.verts- Cited by
- 13 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Setstatement · cited by 53,352
- Set.imagestatement · cited by 5,609
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement · cited by 1,346
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.Subgraph.vertsstatement and proof · cited by 210
- SimpleGraph.Homstatement and proof · cited by 139
- SimpleGraph.Subgraph.mapstatement and proof · cited by 24
Cited by13
Results whose statement or proof uses this declaration.
- SimpleGraph.isIndContained_iff_exists_iso_subgraphproof · cited by 2
- SimpleGraph.Subgraph.Connected.mapproof · cited by 1
- SimpleGraph.map_singletonSubgraphproof · cited by 1
- SimpleGraph.Subgraph.map_hom_topproof · cited by 1
- SimpleGraph.Subgraph.map_idproof · cited by 1
- SimpleGraph.Subgraph.map_iso_topproof · cited by 1
- SimpleGraph.Subgraph.map_monoproof · cited by 1
- SimpleGraph.Subgraph.map_supproof · cited by 1
- SimpleGraph.Subgraph.restrict_coeSubgraphproof · cited by 1
- SimpleGraph.Subgraph.coeSubgraph_leproof · cited by 0
- SimpleGraph.Subgraph.coeSubgraph_restrict_eqproof · cited by 0
- SimpleGraph.IsMatchingFree.monoproof · cited by 0