Mathlib Map

Theorems · Definition · category theory

CategoryTheory.Limits.mapPair

{C : Type u} →
  [inst : CategoryTheory.Category.{v, u} C] →
    {F G : CategoryTheory.Functor (CategoryTheory.Discrete CategoryTheory.Limits.WalkingPair) C} →
      (F.obj { as := CategoryTheory.Limits.WalkingPair.left } ⟶
          G.obj { as := CategoryTheory.Limits.WalkingPair.left }) →
        (F.obj { as := CategoryTheory.Limits.WalkingPair.right } ⟶
            G.obj { as := CategoryTheory.Limits.WalkingPair.right }) →
          (F ⟶ G)

The natural transformation between two functors out of the walking pair, specified by its components.

Defined in
Mathlib.CategoryTheory.Limits.Shapes.BinaryProducts
Cited by
18 results in Mathlib
Foundations
Depth 20 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
CategoryTheory.Category

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.

Cited by22

Results whose statement or proof uses this declaration.