Mathlib Map

Theorems · Theorem · combinatorics

Prefunctor.costar_apply

∀ {U : Type u_1} [inst : Quiver U] {V : Type u_2} [inst_1 : Quiver V] (φ : U ⥤q V) {u v : U} (e : u ⟶ v),
  φ.costar v (Quiver.Costar.mk e) = Quiver.Costar.mk (φ.map e)
Defined in
Mathlib.Combinatorics.Quiver.Covering
Cited by
0 results in Mathlib
Foundations
Depth 5 from the axioms · uses no axioms
Assumes
QuiverQuiver
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Quiver.Hom · cited by 32603Quiver.HomPrefunctor.obj · cited by 1241Prefunctor.objPrefunctor.map · cited by 952Prefunctor.mapQuiver · cited by 405QuiverPrefunctor · cited by 116PrefunctorQuiver.Costar · cited by 19Quiver.CostarPrefunctor.costar · cited by 14Prefunctor.costarQuiver.Costar.mk · cited by 6Costar.mkPrefunctor.costar_applyCITED BYCITES

Cites8

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.