Theorems · Definition · category theory

CategoryTheory.GradedObject.mapBifunctorMapObjDesc

{C₁ : Type u_1} →
  {C₂ : Type u_2} →
    {C₃ : Type u_3} →
      [inst : CategoryTheory.Category.{v_1, u_1} C₁] →
        [inst_1 : CategoryTheory.Category.{v_2, u_2} C₂] →
          [inst_2 : CategoryTheory.Category.{v_3, u_3} C₃] →
            {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} →
              {I : Type u_4} →
                {J : Type u_5} →
                  {K : Type u_6} →
                    {p : I × J → K} →
                      {X : CategoryTheory.GradedObject I C₁} →
                        {Y : CategoryTheory.GradedObject J C₂} →
                          {A : C₃} →
                            {k : K} →
                              [inst_3 : (((CategoryTheory.GradedObject.mapBifunctor F I J).obj X).obj Y).HasMap p] →
                                ((i : I) → (j : J) → p (i, j) = k → ((F.obj (X i)).obj (Y j) ⟶ A)) →
                                  (CategoryTheory.GradedObject.mapBifunctorMapObj F p X Y k ⟶ A)

Constructor for morphisms from mapBifunctorMapObj F p X Y k.

Defined in

Mathlib.CategoryTheory.GradedObject.Bifunctor

Cited by

2 results in Mathlib

Foundations

Depth 29 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

CategoryTheory.CategoryCategoryTheory.CategoryCategoryTheory.CategoryCategoryTheory.GradedObject.HasMap