Theorems · Theorem · combinatorics
Prefunctor.mapPath_cons
∀ {V : Type u₁} [inst : Quiver V] {W : Type u₂} [inst_1 : Quiver W] (F : V ⥤q W) {a b c : V} (p : Quiver.Path a b)
(e : b ⟶ c), F.mapPath (p.cons e) = (F.mapPath p).cons (F.map e)- Defined in
- Mathlib.Combinatorics.Quiver.Path
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses no axioms
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.
- Quiver.Homstatement and proof · cited by 32,603
- Prefunctor.objstatement · cited by 1,241
- Prefunctor.mapstatement · cited by 952
- Quiverstatement and proof · cited by 405
- Quiver.Pathstatement and proof · cited by 166
- Prefunctorstatement and proof · cited by 116
- Prefunctor.mapPathstatement · cited by 15
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.