Theorems · Definition · category theory

CategoryTheory.StructuredArrow.preEquivalenceFunctor

{C : Type u₁} →
  [inst : CategoryTheory.Category.{v₁, u₁} C] →
    {D : Type u₂} →
      [inst_1 : CategoryTheory.Category.{v₂, u₂} D] →
        {E : Type u₃} →
          [inst_2 : CategoryTheory.Category.{v₃, u₃} E] →
            (F : CategoryTheory.Functor C D) →
              {G : CategoryTheory.Functor D E} →
                {e : E} →
                  (f : CategoryTheory.StructuredArrow e G) →
                    CategoryTheory.Functor (CategoryTheory.StructuredArrow f (CategoryTheory.StructuredArrow.pre e F G))
                      (CategoryTheory.StructuredArrow f.right F)

The functor establishing the equivalence StructuredArrow.preEquivalence.

Defined in

Mathlib.CategoryTheory.Comma.StructuredArrow.Basic

Cited by

7 results in Mathlib

Foundations

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

Assumes

CategoryTheory.CategoryCategoryTheory.CategoryCategoryTheory.Category