Theorems · Theorem · combinatorics
SimpleGraph.Walk.mapLe_append
∀ {V : Type u} {G G' : SimpleGraph V} (h : G ≤ G') {u v w : V} (p : G.Walk u v) (q : G.Walk v w),
SimpleGraph.Walk.mapLe h (p.append q) = (SimpleGraph.Walk.mapLe h p).append (SimpleGraph.Walk.mapLe h q)- Cited by
- 0 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses propext
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.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.appendstatement and proof · cited by 95
- SimpleGraph.Walk.mapproof · cited by 66
- SimpleGraph.Hom.ofLEproof · cited by 27
- SimpleGraph.Walk.mapLestatement and proof · cited by 26
- SimpleGraph.Walk.map_appendproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.