Theorems · Theorem · combinatorics
SimpleGraph.Walk.edges_map
∀ {V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} (f : G →g G') {u v : V} (p : G.Walk u v),
(SimpleGraph.Walk.map f p).edges = List.map (Sym2.map ⇑f) p.edges- Cited by
- 7 results in Mathlib
- Foundations
- Depth 9 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
- Sym2statement · cited by 737
- Sym2.mkproof · cited by 332
- SimpleGraph.Walk.edgesstatement and proof · cited by 145
- SimpleGraph.Homstatement and proof · cited by 139
- SimpleGraph.Walk.mapstatement and proof · cited by 66
- Sym2.mapstatement and proof · cited by 61
Cited by7
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.isTrail_map_iff_of_injectiveproof · cited by 5
- SimpleGraph.reachable_deleteEdges_iff_exists_walkproof · cited by 3
- SimpleGraph.Walk.IsTrail.of_mapproof · cited by 2
- SimpleGraph.Walk.edgeSet_mapproof · cited by 1
- SimpleGraph.Walk.edges_mapLe_eq_edgesproof · cited by 0
- SimpleGraph.Walk.IsPath.isCycles_spanningCoe_toSubgraph_sup_edgeproof · cited by 0
- SimpleGraph.isTree_iff_minimal_connectedproof · cited by 0