Theorems · Theorem · category theory
Prefunctor.comp_map
∀ {U : Type u_1} [inst : Quiver U] {V : Type u_2} [inst_1 : Quiver V] {W : Type u_3} [inst_2 : Quiver W] (F : U ⥤q V)
(G : V ⥤q W) {X Y : U} (f : X ⟶ Y), (F ⋙q G).map f = G.map (F.map f)- Defined in
- Mathlib.Combinatorics.Quiver.Prefunctor
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 5 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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 and proof · cited by 952
- Quiverstatement and proof · cited by 405
- Prefunctorstatement and proof · cited by 116
- Prefunctor.compstatement and proof · cited by 35
Cited by5
Results whose statement or proof uses this declaration.
- Quiver.FreeGroupoid.lift_uniqueproof · cited by 3
- CategoryTheory.Quiv.hom_map_inv_map_of_isoproof · cited by 1
- Quiver.Push.lift_compproof · cited by 0
- Quiver.SchreierGraph.map_smul_of_comp_labelling_eqproof · cited by 0
- Quiver.Push.lift_uniqueproof · cited by 0