Theorems · Theorem · category theory

CategoryTheory.Functor.relativelyRepresentable.lift.congr_simp

∀ {C : Type u₁} [inst : CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [inst_1 : CategoryTheory.Category.{v₂, u₂} D]
  {F : CategoryTheory.Functor C D} {X Y : D} {f : X ⟶ Y} (hf : F.relativelyRepresentable f) {a : C} {g : F.obj a ⟶ Y}
  {c : C} (i i_1 : F.obj c ⟶ X) (e_i : i = i_1) (h h_1 : c ⟶ a) (e_h : h = h_1)
  (hi : CategoryTheory.CategoryStruct.comp i f = CategoryTheory.CategoryStruct.comp (F.map h) g) [inst_2 : F.Full],
  hf.lift i h hi = hf.lift i_1 h_1 ⋯

Defined in

Mathlib.CategoryTheory.MorphismProperty.Representable

Cited by

0 results in Mathlib

Foundations

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

Assumes

CategoryTheory.CategoryCategoryTheory.CategoryCategoryTheory.Functor.Full