Loogle!
Result
Found 96 declarations mentioning CategoryTheory.IsCardinalFiltered.
- CategoryTheory.IsCardinalFiltered 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type u) [CategoryTheory.Category.{v, u} J] (κ : Cardinal.{w}) [Fact κ.IsRegular] : Prop - CategoryTheory.isCardinalFiltered_aleph0_iff 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type u) [CategoryTheory.Category.{v, u} J] : CategoryTheory.IsCardinalFiltered J Cardinal.aleph0 ↔ CategoryTheory.IsFiltered J - CategoryTheory.IsCardinalFiltered.nonempty 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type u) [CategoryTheory.Category.{v, u} J] (κ : Cardinal.{w}) [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] : Nonempty J - CategoryTheory.isCardinalFiltered_of_hasTerminal 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type u) [CategoryTheory.Category.{v, u} J] [CategoryTheory.Limits.HasTerminal J] (κ : Cardinal.{w}) [Fact κ.IsRegular] : CategoryTheory.IsCardinalFiltered J κ - CategoryTheory.isFiltered_of_isCardinalFiltered 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type u) [CategoryTheory.Category.{v, u} J] (κ : Cardinal.{w}) [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] : CategoryTheory.IsFiltered J - CategoryTheory.Limits.IsTerminal.isCardinalFiltered 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {X : J} (hX : CategoryTheory.Limits.IsTerminal X) (κ : Cardinal.{w}) [Fact κ.IsRegular] : CategoryTheory.IsCardinalFiltered J κ - CategoryTheory.IsCardinalFiltered.max 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {K : Type u'} (S : K → J) (hS : HasCardinalLT K κ) : J - CategoryTheory.IsCardinalFiltered.instOfSubsingletonOfNonemptyOfIsThin 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(κ : Cardinal.{w}) [Fact κ.IsRegular] (J : Type u_1) [CategoryTheory.Category.{v_1, u_1} J] [Subsingleton J] [Nonempty J] [Quiver.IsThin J] : CategoryTheory.IsCardinalFiltered J κ - CategoryTheory.isCardinalFiltered_under 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type u) [CategoryTheory.Category.{v, u} J] (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (j₀ : J) : CategoryTheory.IsCardinalFiltered (CategoryTheory.Under j₀) κ - CategoryTheory.IsCardinalFiltered.of_equivalence 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] (κ : Cardinal.{w}) [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {J' : Type u'} [CategoryTheory.Category.{v', u'} J'] (e : J ≌ J') : CategoryTheory.IsCardinalFiltered J' κ - CategoryTheory.IsCardinalFiltered.of_le 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type u) [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {κ' : Cardinal.{w}} [Fact κ'.IsRegular] (h : κ' ≤ κ) : CategoryTheory.IsCardinalFiltered J κ' - CategoryTheory.isCardinalFiltered_pi 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{ι : Type u'} (J : ι → Type u) [(i : ι) → CategoryTheory.Category.{v, u} (J i)] (κ : Cardinal.{w}) [Fact κ.IsRegular] [∀ (i : ι), CategoryTheory.IsCardinalFiltered (J i) κ] : CategoryTheory.IsCardinalFiltered ((i : ι) → J i) κ - CategoryTheory.IsCardinalFiltered.coeq 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {K : Type v'} {j j' : J} (f : K → (j ⟶ j')) (hK : HasCardinalLT K κ) : J - CategoryTheory.isCardinalFiltered_prod 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J₁ : Type u) (J₂ : Type u') [CategoryTheory.Category.{v, u} J₁] [CategoryTheory.Category.{v', u'} J₂] (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J₁ κ] [CategoryTheory.IsCardinalFiltered J₂ κ] : CategoryTheory.IsCardinalFiltered (J₁ × J₂) κ - CategoryTheory.IsCardinalFiltered.cocone 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {A : Type v'} [CategoryTheory.Category.{u', v'} A] (F : CategoryTheory.Functor A J) (hA : HasCardinalLT (CategoryTheory.Arrow A) κ) : CategoryTheory.Limits.Cocone F - CategoryTheory.IsCardinalFiltered.of_final 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J₁ : Type u} [CategoryTheory.Category.{v, u} J₁] {J₂ : Type u'} [CategoryTheory.Category.{v', u'} J₂] (F : CategoryTheory.Functor J₁ J₂) [F.Final] (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J₁ κ] : CategoryTheory.IsCardinalFiltered J₂ κ - CategoryTheory.IsCardinalFiltered.mk 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [Fact κ.IsRegular] (nonempty_cocone : ∀ {A : Type w} [inst : CategoryTheory.SmallCategory A] (F : CategoryTheory.Functor A J), HasCardinalLT (CategoryTheory.Arrow A) κ → Nonempty (CategoryTheory.Limits.Cocone F)) : CategoryTheory.IsCardinalFiltered J κ - CategoryTheory.IsCardinalFiltered.nonempty_cocone 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} {inst✝ : CategoryTheory.Category.{v, u} J} {κ : Cardinal.{w}} {inst✝¹ : Fact κ.IsRegular} [self : CategoryTheory.IsCardinalFiltered J κ] {A : Type w} [CategoryTheory.SmallCategory A] (F : CategoryTheory.Functor A J) (hA : HasCardinalLT (CategoryTheory.Arrow A) κ) : Nonempty (CategoryTheory.Limits.Cocone F) - CategoryTheory.IsCardinalFiltered.exists_max 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {K : Type u'} (S : K → J) (hS : HasCardinalLT K κ) : ∃ j, Nonempty ((k : K) → S k ⟶ j) - CategoryTheory.IsCardinalFiltered.toMax 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {K : Type u'} (S : K → J) (hS : HasCardinalLT K κ) (k : K) : S k ⟶ CategoryTheory.IsCardinalFiltered.max S hS - CategoryTheory.isCardinalFiltered_preorder 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type w) [Preorder J] (κ : Cardinal.{w}) [Fact κ.IsRegular] (h : ∀ ⦃K : Type w⦄ (s : K → J), Cardinal.mk K < κ → ∃ j, ∀ (k : K), s k ≤ j) : CategoryTheory.IsCardinalFiltered J κ - CategoryTheory.instIsCardinalFilteredToTypeOrd 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(κ : Cardinal.{w}) [hκ : Fact κ.IsRegular] : CategoryTheory.IsCardinalFiltered κ.ord.ToType κ - CategoryTheory.IsCardinalFiltered.coeqHom 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {K : Type v'} {j j' : J} (f : K → (j ⟶ j')) (hK : HasCardinalLT K κ) : j' ⟶ CategoryTheory.IsCardinalFiltered.coeq f hK - CategoryTheory.IsCardinalFiltered.toCoeq 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {K : Type v'} {j j' : J} (f : K → (j ⟶ j')) (hK : HasCardinalLT K κ) : j ⟶ CategoryTheory.IsCardinalFiltered.coeq f hK - CategoryTheory.IsCardinalFiltered.coeq_condition 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {K : Type v'} {j j' : J} (f : K → (j ⟶ j')) (hK : HasCardinalLT K κ) (k : K) : CategoryTheory.CategoryStruct.comp (f k) (CategoryTheory.IsCardinalFiltered.coeqHom f hK) = CategoryTheory.IsCardinalFiltered.toCoeq f hK - CategoryTheory.IsCardinalFiltered.multicoequalizer 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {ι : Type v'} {j : ι → J} {k : J} (f₁ f₂ : (i : ι) → j i ⟶ k) (hι : HasCardinalLT ι κ) : ∃ l a, ∀ (i : ι), CategoryTheory.CategoryStruct.comp (f₁ i) a = CategoryTheory.CategoryStruct.comp (f₂ i) a - CategoryTheory.IsCardinalFiltered.wideSpan 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {ι : Type v'} {j : J} {k : ι → J} (f : (i : ι) → j ⟶ k i) (hι : HasCardinalLT ι κ) : ∃ m a b, ∀ (i : ι), CategoryTheory.CategoryStruct.comp (f i) (a i) = b - CategoryTheory.isCardinalFiltered_iff 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type u) [CategoryTheory.Category.{v, u} J] (κ : Cardinal.{w}) [Fact κ.IsRegular] : CategoryTheory.IsCardinalFiltered J κ ↔ (∀ ⦃ι : Type w⦄ (j : ι → J), HasCardinalLT ι κ → ∃ k, ∀ (i : ι), Nonempty (j i ⟶ k)) ∧ ∀ ⦃ι : Type w⦄ ⦃j k : J⦄ (f : ι → (j ⟶ k)), HasCardinalLT ι κ → ∃ l a b, ∀ (i : ι), CategoryTheory.CategoryStruct.comp (f i) a = b - CategoryTheory.isCardinalFiltered_iff' 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [Fact κ.IsRegular] : CategoryTheory.IsCardinalFiltered J κ ↔ (∀ ⦃ι : Type w⦄ (j : ι → J), HasCardinalLT ι κ → ∃ k, ∀ (i : ι), Nonempty (j i ⟶ k)) ∧ ∀ ⦃ι : Type w⦄ ⦃j k : J⦄ (f : ι → (j ⟶ k)), HasCardinalLT ι κ → Nonempty ι → ∃ l a b, ∀ (i : ι), CategoryTheory.CategoryStruct.comp (f i) a = b - CategoryTheory.IsCardinalFiltered.coeq_condition_assoc 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {K : Type v'} {j j' : J} (f : K → (j ⟶ j')) (hK : HasCardinalLT K κ) (k : K) {Z : J} (h : CategoryTheory.IsCardinalFiltered.coeq f hK ⟶ Z) : CategoryTheory.CategoryStruct.comp (f k) (CategoryTheory.CategoryStruct.comp (CategoryTheory.IsCardinalFiltered.coeqHom f hK) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.IsCardinalFiltered.toCoeq f hK) h - CategoryTheory.HasCardinalFilteredColimits.hasColimitsOfShape 📋 Mathlib.CategoryTheory.Presentable.Basic
(C : Type u₁) {inst✝ : CategoryTheory.Category.{v₁, u₁} C} (κ : Cardinal.{w}) {inst✝¹ : Fact κ.IsRegular} [self : CategoryTheory.HasCardinalFilteredColimits C κ] (J : Type w) [CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] : CategoryTheory.Limits.HasColimitsOfShape J C - CategoryTheory.HasCardinalFilteredColimits.mk 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {κ : Cardinal.{w}} [Fact κ.IsRegular] (hasColimitsOfShape : ∀ (J : Type w) [inst : CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ], CategoryTheory.Limits.HasColimitsOfShape J C := by intros; infer_instance) : CategoryTheory.HasCardinalFilteredColimits C κ - CategoryTheory.Functor.preservesColimitsOfShape_of_isCardinalAccessible 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (κ : Cardinal.{w}) [Fact κ.IsRegular] [F.IsCardinalAccessible κ] (J : Type w) [CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] : CategoryTheory.Limits.PreservesColimitsOfShape J F - CategoryTheory.Functor.IsCardinalAccessible.preservesColimitOfShape 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} {inst✝ : CategoryTheory.Category.{v₁, u₁} C} {D : Type u₂} {inst✝¹ : CategoryTheory.Category.{v₂, u₂} D} {F : CategoryTheory.Functor C D} (κ : Cardinal.{w}) {inst✝² : Fact κ.IsRegular} [self : F.IsCardinalAccessible κ] (J : Type w) [CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] : CategoryTheory.Limits.PreservesColimitsOfShape J F - CategoryTheory.Functor.IsCardinalAccessible.mk 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {κ : Cardinal.{w}} [Fact κ.IsRegular] (preservesColimitOfShape : ∀ (J : Type w) [inst : CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ], CategoryTheory.Limits.PreservesColimitsOfShape J F := by intros; infer_instance) : F.IsCardinalAccessible κ - CategoryTheory.Functor.preservesColimitsOfShape_of_isCardinalAccessible_of_essentiallySmall 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (κ : Cardinal.{w}) [Fact κ.IsRegular] [F.IsCardinalAccessible κ] (J : Type u₃) [CategoryTheory.Category.{v₃, u₃} J] [CategoryTheory.EssentiallySmall.{w, v₃, u₃} J] [CategoryTheory.IsCardinalFiltered J κ] : CategoryTheory.Limits.PreservesColimitsOfShape J F - CategoryTheory.preservesColimitsOfShape_of_isCardinalPresentable 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalPresentable X κ] (J : Type w) [CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] : CategoryTheory.Limits.PreservesColimitsOfShape J (CategoryTheory.coyoneda.obj (Opposite.op X)) - CategoryTheory.preservesColimitsOfShape_of_isCardinalPresentable_of_essentiallySmall 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalPresentable X κ] (J : Type u₃) [CategoryTheory.Category.{v₃, u₃} J] [CategoryTheory.EssentiallySmall.{w, v₃, u₃} J] [CategoryTheory.IsCardinalFiltered J κ] : CategoryTheory.Limits.PreservesColimitsOfShape J (CategoryTheory.coyoneda.obj (Opposite.op X)) - CategoryTheory.IsCardinalPresentable.exists_hom_of_isColimit 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} (κ : Cardinal.{w}) [Fact κ.IsRegular] {J : Type u_1} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.IsCardinalPresentable X κ] [CategoryTheory.EssentiallySmall.{w, v_1, u_1} J] [CategoryTheory.IsCardinalFiltered J κ] {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone F} (hc : CategoryTheory.Limits.IsColimit c) (f : X ⟶ c.pt) : ∃ j f', CategoryTheory.CategoryStruct.comp f' (c.ι.app j) = f - CategoryTheory.IsCardinalPresentable.exists_eq_of_isColimit' 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} (κ : Cardinal.{w}) [Fact κ.IsRegular] {J : Type u_1} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.IsCardinalPresentable X κ] [CategoryTheory.EssentiallySmall.{w, v_1, u_1} J] [CategoryTheory.IsCardinalFiltered J κ] {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone F} (hc : CategoryTheory.Limits.IsColimit c) {i : J} (f₁ f₂ : X ⟶ F.obj i) (hf : CategoryTheory.CategoryStruct.comp f₁ (c.ι.app i) = CategoryTheory.CategoryStruct.comp f₂ (c.ι.app i)) : ∃ j u, CategoryTheory.CategoryStruct.comp f₁ (F.map u) = CategoryTheory.CategoryStruct.comp f₂ (F.map u) - CategoryTheory.IsCardinalPresentable.exists_hom₂_of_isColimit 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} (κ : Cardinal.{w}) [Fact κ.IsRegular] {J : Type u_1} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.IsCardinalPresentable X κ] [CategoryTheory.EssentiallySmall.{w, v_1, u_1} J] [CategoryTheory.IsCardinalFiltered J κ] {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone F} (hc : CategoryTheory.Limits.IsColimit c) (f g : X ⟶ c.pt) : ∃ j f' g', CategoryTheory.CategoryStruct.comp f' (c.ι.app j) = f ∧ CategoryTheory.CategoryStruct.comp g' (c.ι.app j) = g - CategoryTheory.IsCardinalPresentable.exists_eq_of_isColimit 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} (κ : Cardinal.{w}) [Fact κ.IsRegular] {J : Type u_1} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.IsCardinalPresentable X κ] [CategoryTheory.EssentiallySmall.{w, v_1, u_1} J] [CategoryTheory.IsCardinalFiltered J κ] {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone F} (hc : CategoryTheory.Limits.IsColimit c) {i₁ i₂ : J} (f₁ : X ⟶ F.obj i₁) (f₂ : X ⟶ F.obj i₂) (hf : CategoryTheory.CategoryStruct.comp f₁ (c.ι.app i₁) = CategoryTheory.CategoryStruct.comp f₂ (c.ι.app i₂)) : ∃ j u v, CategoryTheory.CategoryStruct.comp f₁ (F.map u) = CategoryTheory.CategoryStruct.comp f₂ (F.map v) - CategoryTheory.IsCardinalPresentable.mk 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} {κ : Cardinal.{w}} [Fact κ.IsRegular] (hX : ∀ (J : Type w) [inst : CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] (F : CategoryTheory.Functor J C) (c : CategoryTheory.Limits.Cocone F) (x : CategoryTheory.Limits.IsColimit c), (∀ (g : X ⟶ c.pt), ∃ j f, CategoryTheory.CategoryStruct.comp f (c.ι.app j) = g) ∧ ∀ (j : J) (f₁ f₂ : X ⟶ F.obj j), CategoryTheory.CategoryStruct.comp f₁ (c.ι.app j) = CategoryTheory.CategoryStruct.comp f₂ (c.ι.app j) → ∃ j' a, CategoryTheory.CategoryStruct.comp f₁ (F.map a) = CategoryTheory.CategoryStruct.comp f₂ (F.map a)) : CategoryTheory.IsCardinalPresentable X κ - CategoryTheory.IsCardinalPresentable.exists_commSq_of_isColimit 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (κ : Cardinal.{w}) [Fact κ.IsRegular] {J : Type u_2} [CategoryTheory.Category.{v_2, u_2} J] [CategoryTheory.EssentiallySmall.{w, v_2, u_2} J] [CategoryTheory.IsCardinalFiltered J κ] {X Y : CategoryTheory.Functor J C} (f : X ⟶ Y) {c₁ : CategoryTheory.Limits.Cocone X} {c₂ : CategoryTheory.Limits.Cocone Y} (hc₁ : CategoryTheory.Limits.IsColimit c₁) (hc₂ : CategoryTheory.Limits.IsColimit c₂) (f' : c₁.pt ⟶ c₂.pt) (hf' : ∀ (j : J), CategoryTheory.CategoryStruct.comp (c₁.ι.app j) f' = CategoryTheory.CategoryStruct.comp (f.app j) (c₂.ι.app j)) ⦃X' Y' : C⦄ ⦃t : X' ⟶ Y'⦄ ⦃l : X' ⟶ c₁.pt⦄ ⦃r : Y' ⟶ c₂.pt⦄ [CategoryTheory.IsCardinalPresentable X' κ] [CategoryTheory.IsCardinalPresentable Y' κ] (sq : CategoryTheory.CommSq t l r f') : ∃ j l' r', CategoryTheory.CategoryStruct.comp l' (c₁.ι.app j) = l ∧ CategoryTheory.CategoryStruct.comp r' (c₂.ι.app j) = r ∧ CategoryTheory.CommSq t l' r' (f.app j) - CategoryTheory.IsGrothendieckAbelian.exists_isIso_of_functor_from_monoOver 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver X)) {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hXκ : HasCardinalLT (CategoryTheory.Subobject X) κ) (c : CategoryTheory.Limits.Cocone (F.comp ((CategoryTheory.MonoOver.forget X).comp (CategoryTheory.Over.forget X)))) (hc : CategoryTheory.Limits.IsColimit c) (f : c.pt ⟶ X) (hf : ∀ (j : J), CategoryTheory.CategoryStruct.comp (c.ι.app j) f = (F.obj j).obj.hom) (h : CategoryTheory.Epi f) : ∃ j, CategoryTheory.IsIso (F.obj j).obj.hom - CategoryTheory.IsGrothendieckAbelian.preservesColimit_coyoneda_obj_of_mono 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (Y : CategoryTheory.Functor J C) {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hXκ : HasCardinalLT (CategoryTheory.Subobject X) κ) [∀ (j j' : J) (φ : j ⟶ j'), CategoryTheory.Mono (Y.map φ)] : CategoryTheory.Limits.PreservesColimit Y (CategoryTheory.coyoneda.obj (Opposite.op X)) - CategoryTheory.IsGrothendieckAbelian.IsPresentable.surjectivity 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (hc : CategoryTheory.Limits.IsColimit c) [∀ (j j' : J) (φ : j ⟶ j'), CategoryTheory.Mono (Y.map φ)] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hXκ : HasCardinalLT (CategoryTheory.Subobject X) κ) (z : X ⟶ c.pt) : ∃ j₀ y, z = CategoryTheory.CategoryStruct.comp y (c.ι.app j₀) - CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivity 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (hc : CategoryTheory.Limits.IsColimit c) {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hXκ : HasCardinalLT (CategoryTheory.Subobject X) κ) (j₀ : J) (y₁ y₂ : X ⟶ Y.obj j₀) (hy : CategoryTheory.CategoryStruct.comp y₁ (c.ι.app j₀) = CategoryTheory.CategoryStruct.comp y₂ (c.ι.app j₀)) : ∃ j φ, CategoryTheory.CategoryStruct.comp y₁ (Y.map φ) = CategoryTheory.CategoryStruct.comp y₂ (Y.map φ) - CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivity₀ 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (hc : CategoryTheory.Limits.IsColimit c) {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hXκ : HasCardinalLT (CategoryTheory.Subobject X) κ) {j₀ : J} (y : X ⟶ Y.obj j₀) (hy : CategoryTheory.CategoryStruct.comp y (c.ι.app j₀) = 0) : ∃ j φ, CategoryTheory.CategoryStruct.comp y (Y.map φ) = 0 - CategoryTheory.Functor.Accessible.Limits.isColimitMapCocone 📋 Mathlib.CategoryTheory.Presentable.Limits
{C : Type u} [CategoryTheory.Category.{v, u} C] {K : Type u'} [CategoryTheory.Category.{v', u'} K] {F : CategoryTheory.Functor K (CategoryTheory.Functor C (Type w'))} (c : CategoryTheory.Limits.Cone F) (hc : (Y : C) → CategoryTheory.Limits.IsLimit (((CategoryTheory.evaluation C (Type w')).obj Y).mapCone c)) (κ : Cardinal.{w}) [Fact κ.IsRegular] (hK : HasCardinalLT (CategoryTheory.Arrow K) κ) {J : Type w} [CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] {X : CategoryTheory.Functor J C} (cX : CategoryTheory.Limits.Cocone X) (hF : (k : K) → CategoryTheory.Limits.IsColimit ((F.obj k).mapCocone cX)) : CategoryTheory.Limits.IsColimit (c.pt.mapCocone cX) - CategoryTheory.Functor.Accessible.Limits.isColimitMapCocone.surjective 📋 Mathlib.CategoryTheory.Presentable.Limits
{C : Type u} [CategoryTheory.Category.{v, u} C] {K : Type u'} [CategoryTheory.Category.{v', u'} K] {F : CategoryTheory.Functor K (CategoryTheory.Functor C (Type w'))} (c : CategoryTheory.Limits.Cone F) (hc : (Y : C) → CategoryTheory.Limits.IsLimit (((CategoryTheory.evaluation C (Type w')).obj Y).mapCone c)) (κ : Cardinal.{w}) [Fact κ.IsRegular] (hK : HasCardinalLT (CategoryTheory.Arrow K) κ) {J : Type w} [CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] {X : CategoryTheory.Functor J C} (cX : CategoryTheory.Limits.Cocone X) (hF : (k : K) → CategoryTheory.Limits.IsColimit ((F.obj k).mapCocone cX)) (x : c.pt.obj cX.pt) : ∃ j x', x = (CategoryTheory.ConcreteCategory.hom ((c.pt.mapCocone cX).ι.app j)) x' - CategoryTheory.Functor.Accessible.Limits.isColimitMapCocone.injective 📋 Mathlib.CategoryTheory.Presentable.Limits
{C : Type u} [CategoryTheory.Category.{v, u} C] {K : Type u'} [CategoryTheory.Category.{v', u'} K] {F : CategoryTheory.Functor K (CategoryTheory.Functor C (Type w'))} (c : CategoryTheory.Limits.Cone F) (hc : (Y : C) → CategoryTheory.Limits.IsLimit (((CategoryTheory.evaluation C (Type w')).obj Y).mapCone c)) (κ : Cardinal.{w}) [Fact κ.IsRegular] (hK : HasCardinalLT (CategoryTheory.Arrow K) κ) {J : Type w} [CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] {X : CategoryTheory.Functor J C} (cX : CategoryTheory.Limits.Cocone X) (hF : (k : K) → CategoryTheory.Limits.IsColimit ((F.obj k).mapCocone cX)) (j : J) (x₁ x₂ : c.pt.obj (X.obj j)) (h : (CategoryTheory.ConcreteCategory.hom (c.pt.map (cX.ι.app j))) x₁ = (CategoryTheory.ConcreteCategory.hom (c.pt.map (cX.ι.app j))) x₂) : ∃ j' α, (CategoryTheory.ConcreteCategory.hom (c.pt.map (X.map α))) x₁ = (CategoryTheory.ConcreteCategory.hom (c.pt.map (X.map α))) x₂ - CategoryTheory.ObjectProperty.IsCardinalFilteredGenerator.exists_colimitsOfShape 📋 Mathlib.CategoryTheory.Presentable.CardinalFilteredPresentation
{C : Type u} [CategoryTheory.Category.{v, u} C] {P : CategoryTheory.ObjectProperty C} {κ : Cardinal.{w}} [Fact κ.IsRegular] (self : P.IsCardinalFilteredGenerator κ) (X : C) : ∃ J x, ∃ (_ : CategoryTheory.IsCardinalFiltered J κ), P.colimitsOfShape J X - CategoryTheory.ObjectProperty.IsCardinalFilteredGenerator.mk 📋 Mathlib.CategoryTheory.Presentable.CardinalFilteredPresentation
{C : Type u} [CategoryTheory.Category.{v, u} C] {P : CategoryTheory.ObjectProperty C} {κ : Cardinal.{w}} [Fact κ.IsRegular] (le_isCardinalPresentable : P ≤ CategoryTheory.isCardinalPresentable C κ) (exists_colimitsOfShape : ∀ (X : C), ∃ J x, ∃ (_ : CategoryTheory.IsCardinalFiltered J κ), P.colimitsOfShape J X) : P.IsCardinalFilteredGenerator κ - CategoryTheory.ObjectProperty.IsCardinalFilteredGenerator.mk' 📋 Mathlib.CategoryTheory.Presentable.CardinalFilteredPresentation
{C : Type u} [CategoryTheory.Category.{v, u} C] {P : CategoryTheory.ObjectProperty C} {κ : Cardinal.{w}} [Fact κ.IsRegular] (h₁ : P ≤ CategoryTheory.isCardinalPresentable C κ) (h₂ : ∀ (X : C), ∃ J x, ∃ (_ : CategoryTheory.EssentiallySmall.{w, w₂, w₁} J) (_ : CategoryTheory.IsCardinalFiltered J κ), P.colimitsOfShape J X) : P.IsCardinalFilteredGenerator κ - CategoryTheory.ObjectProperty.isCardinalFiltered_costructuredArrow_colimitsCardinalClosure_ι 📋 Mathlib.CategoryTheory.Presentable.StrongGenerator
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.ObjectProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v, u} C] (X : C) : CategoryTheory.IsCardinalFiltered (CategoryTheory.CostructuredArrow (P.colimitsCardinalClosure κ).ι X) κ - CategoryTheory.IsCardinalFilteredGenerator.of_isDense 📋 Mathlib.CategoryTheory.Presentable.StrongGenerator
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {J : Type u'} [CategoryTheory.Category.{v', u'} J] [CategoryTheory.EssentiallySmall.{w, v', u'} J] (F : CategoryTheory.Functor J C) [F.IsDense] (κ : Cardinal.{w}) [Fact κ.IsRegular] [∀ (j : J), CategoryTheory.IsCardinalPresentable (F.obj j) κ] [∀ (X : C), CategoryTheory.IsCardinalFiltered (CategoryTheory.CostructuredArrow F X) κ] : (⊤.map F).IsCardinalFilteredGenerator κ - CategoryTheory.IsCardinalFilteredGenerator.of_isDense_ι 📋 Mathlib.CategoryTheory.Presentable.StrongGenerator
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.ObjectProperty C) [CategoryTheory.ObjectProperty.EssentiallySmall.{w, v, u} P] (κ : Cardinal.{w}) [Fact κ.IsRegular] [P.ι.IsDense] [CategoryTheory.LocallySmall.{w, v, u} C] (hP : P ≤ CategoryTheory.isCardinalPresentable C κ) [∀ (X : C), CategoryTheory.IsCardinalFiltered (CategoryTheory.CostructuredArrow P.ι X) κ] : P.IsCardinalFilteredGenerator κ - CategoryTheory.IsCardinalAccessibleCategory.instIsCardinalFilteredCostructuredArrowFullSubcategoryIsCardinalPresentableι 📋 Mathlib.CategoryTheory.Presentable.Dense
{C : Type u} [CategoryTheory.Category.{v, u} C] {κ : Cardinal.{w}} [Fact κ.IsRegular] [CategoryTheory.IsCardinalAccessibleCategory C κ] (X : C) : CategoryTheory.IsCardinalFiltered (CategoryTheory.CostructuredArrow (CategoryTheory.isCardinalPresentable C κ).ι X) κ - CategoryTheory.IsCardinalAccessibleCategory.final_toCostructuredArrow 📋 Mathlib.CategoryTheory.Presentable.Dense
{C : Type u} [CategoryTheory.Category.{v, u} C] {κ : Cardinal.{w}} [Fact κ.IsRegular] {J : Type u'} [CategoryTheory.Category.{v', u'} J] [CategoryTheory.EssentiallySmall.{w, v', u'} J] [CategoryTheory.IsCardinalFiltered J κ] {X : C} (p : (CategoryTheory.isCardinalPresentable C κ).ColimitOfShape J X) : p.toCostructuredArrow.Final - PartOrdEmb.instIsClosedUnderColimitsOfShapeIsCardinalFilteredOfIsCardinalFiltered 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
(κ : Cardinal.{u}) [Fact κ.IsRegular] (J : Type u) [CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] : (PartOrdEmb.isCardinalFiltered κ).IsClosedUnderColimitsOfShape J - CategoryTheory.CardinalDirectedPoset.of 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] (J : PartOrdEmb) [CategoryTheory.IsCardinalFiltered (↑J) κ] : CategoryTheory.CardinalDirectedPoset κ - CategoryTheory.CardinalFilteredPoset.of 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] (J : PartOrdEmb) [CategoryTheory.IsCardinalFiltered (↑J) κ] : CategoryTheory.CardinalDirectedPoset κ - PartOrdEmb.isCardinalFiltered_iff 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
(κ : Cardinal.{u}) [Fact κ.IsRegular] (X : PartOrdEmb) : PartOrdEmb.isCardinalFiltered κ X ↔ CategoryTheory.IsCardinalFiltered (↑X) κ - CategoryTheory.CardinalDirectedPoset.instIsCardinalFilteredSetCardinalLT 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
(κ : Cardinal.{u}) [Fact κ.IsRegular] (X : Type u) : CategoryTheory.IsCardinalFiltered (CategoryTheory.CardinalDirectedPoset.SetCardinalLT κ X) κ - CategoryTheory.CardinalDirectedPoset.instIsCardinalFilteredCarrierObjPartOrdEmbIsCardinalFiltered 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] (J : CategoryTheory.CardinalDirectedPoset κ) : CategoryTheory.IsCardinalFiltered (↑J.obj) κ - CategoryTheory.CardinalDirectedPoset.instIsCardinalFilteredWithTopCarrierObjPartOrdEmbIsCardinalFiltered 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] (J : CategoryTheory.CardinalDirectedPoset κ) (κ' : Cardinal.{u}) [Fact κ'.IsRegular] : CategoryTheory.IsCardinalFiltered (WithTop ↑J.obj) κ' - CategoryTheory.CardinalDirectedPoset.instIsCardinalFilteredSubtypeSetCarrierObjPartOrdEmbIsCardinalFilteredPropSet 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] (J : CategoryTheory.CardinalDirectedPoset κ) : CategoryTheory.IsCardinalFiltered (Subtype J.PropSet) κ - CategoryTheory.CardinalDirectedPoset.instIsCardinalFilteredSubtypeSetCarrierObjPartOrdEmbIsCardinalFilteredWithTopPropSetWithTop 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] (J : CategoryTheory.CardinalDirectedPoset κ) (κ' : Cardinal.{u}) [Fact κ'.IsRegular] : CategoryTheory.IsCardinalFiltered (Subtype (J.PropSetWithTop κ')) κ' - CategoryTheory.CardinalDirectedPoset.instIsCardinalFilteredElemCarrierObjPartOrdEmbIsCardinalFilteredValSetPropSet 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] (J : CategoryTheory.CardinalDirectedPoset κ) (S : Subtype J.PropSet) : CategoryTheory.IsCardinalFiltered (↑↑S) κ - CategoryTheory.CardinalDirectedPoset.instIsCardinalFilteredElemCarrierObjPartOrdEmbIsCardinalFilteredWithTopValSetPropSetWithTop 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] (J : CategoryTheory.CardinalDirectedPoset κ) (κ' : Cardinal.{u}) [Fact κ'.IsRegular] (S : Subtype (J.PropSetWithTop κ')) : CategoryTheory.IsCardinalFiltered (↑↑S) κ - PartOrdEmb.Limits.CoconePt.isCardinalFiltered_pt 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] {J : Type u} [CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] {F : CategoryTheory.Functor J PartOrdEmb} {c : CategoryTheory.Limits.Cocone (F.comp (CategoryTheory.forget PartOrdEmb))} (hc : CategoryTheory.Limits.IsColimit c) (hF : ∀ (j : J), CategoryTheory.IsCardinalFiltered (↑(F.obj j)) κ) : CategoryTheory.IsCardinalFiltered (PartOrdEmb.Limits.CoconePt hc) κ - CategoryTheory.CardinalDirectedPoset.functorOfPredicateSet 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] {J : CategoryTheory.CardinalDirectedPoset κ} (P : Set ↑J.obj → Prop) [∀ (S : Subtype P), CategoryTheory.IsCardinalFiltered (↑↑S) κ] : CategoryTheory.Functor (Subtype P) (CategoryTheory.CardinalDirectedPoset κ) - CategoryTheory.CardinalFilteredPoset.functorOfPredicateSet 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] {J : CategoryTheory.CardinalDirectedPoset κ} (P : Set ↑J.obj → Prop) [∀ (S : Subtype P), CategoryTheory.IsCardinalFiltered (↑↑S) κ] : CategoryTheory.Functor (Subtype P) (CategoryTheory.CardinalDirectedPoset κ) - CategoryTheory.CardinalDirectedPoset.coconeOfPredicateSet 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] {J : CategoryTheory.CardinalDirectedPoset κ} (P : Set ↑J.obj → Prop) [∀ (S : Subtype P), CategoryTheory.IsCardinalFiltered (↑↑S) κ] : CategoryTheory.Limits.Cocone (CategoryTheory.CardinalDirectedPoset.functorOfPredicateSet P) - CategoryTheory.CardinalFilteredPoset.coconeOfPredicateSet 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] {J : CategoryTheory.CardinalDirectedPoset κ} (P : Set ↑J.obj → Prop) [∀ (S : Subtype P), CategoryTheory.IsCardinalFiltered (↑↑S) κ] : CategoryTheory.Limits.Cocone (CategoryTheory.CardinalDirectedPoset.functorOfPredicateSet P) - CategoryTheory.CardinalDirectedPoset.instPreservesColimitsOfShapeForgetOrderEmbeddingCarrierObjPartOrdEmbIsCardinalFilteredOfIsCardinalFiltered 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] (A : Type u) [CategoryTheory.SmallCategory A] [CategoryTheory.IsCardinalFiltered A κ] : CategoryTheory.Limits.PreservesColimitsOfShape A (CategoryTheory.forget (CategoryTheory.CardinalDirectedPoset κ)) - CategoryTheory.CardinalDirectedPoset.coconeOfPredicateSet_pt 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] {J : CategoryTheory.CardinalDirectedPoset κ} (P : Set ↑J.obj → Prop) [∀ (S : Subtype P), CategoryTheory.IsCardinalFiltered (↑↑S) κ] : (CategoryTheory.CardinalDirectedPoset.coconeOfPredicateSet P).pt = J - CategoryTheory.CardinalDirectedPoset.functorOfPredicateSet_obj_obj_coe 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] {J : CategoryTheory.CardinalDirectedPoset κ} (P : Set ↑J.obj → Prop) [∀ (S : Subtype P), CategoryTheory.IsCardinalFiltered (↑↑S) κ] (X : Subtype P) : ↑((CategoryTheory.CardinalDirectedPoset.functorOfPredicateSet P).obj X).obj = ↑↑X - CategoryTheory.CardinalDirectedPoset.isColimitCoconeOfPredicateSet 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] {J : CategoryTheory.CardinalDirectedPoset κ} (P : Set ↑J.obj → Prop) [IsDirectedOrder (Subtype P)] [Nonempty (Subtype P)] [∀ (S : Subtype P), CategoryTheory.IsCardinalFiltered (↑↑S) κ] (hP : ∀ (a : ↑J.obj), ∃ S, P S ∧ a ∈ S) : CategoryTheory.Limits.IsColimit (CategoryTheory.CardinalDirectedPoset.coconeOfPredicateSet P) - CategoryTheory.CardinalFilteredPoset.isColimitCoconeOfPredicateSet 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] {J : CategoryTheory.CardinalDirectedPoset κ} (P : Set ↑J.obj → Prop) [IsDirectedOrder (Subtype P)] [Nonempty (Subtype P)] [∀ (S : Subtype P), CategoryTheory.IsCardinalFiltered (↑↑S) κ] (hP : ∀ (a : ↑J.obj), ∃ S, P S ∧ a ∈ S) : CategoryTheory.Limits.IsColimit (CategoryTheory.CardinalDirectedPoset.coconeOfPredicateSet P) - CategoryTheory.CardinalDirectedPoset.functorOfPredicateSet_map_hom_hom_apply_coe 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] {J : CategoryTheory.CardinalDirectedPoset κ} (P : Set ↑J.obj → Prop) [∀ (S : Subtype P), CategoryTheory.IsCardinalFiltered (↑↑S) κ] {X✝ Y✝ : Subtype P} (f : X✝ ⟶ Y✝) (x : ↑↑X✝) : ↑((PartOrdEmb.Hom.hom ((CategoryTheory.CardinalDirectedPoset.functorOfPredicateSet P).map f).hom) x) = ↑x - CategoryTheory.CardinalDirectedPoset.coconeOfPredicateSet_ι_app 📋 Mathlib.CategoryTheory.Presentable.CardinalDirectedPoset
{κ : Cardinal.{u}} [Fact κ.IsRegular] {J : CategoryTheory.CardinalDirectedPoset κ} (P : Set ↑J.obj → Prop) [∀ (S : Subtype P), CategoryTheory.IsCardinalFiltered (↑↑S) κ] (j : Subtype P) : (CategoryTheory.CardinalDirectedPoset.coconeOfPredicateSet P).ι.app j = CategoryTheory.ObjectProperty.homMk ((PartOrdEmb.coconeOfPredicateSet P).ι.app j) - CategoryTheory.instIsStableUnderColimitsOfShapeIsCardinalPureOfEssentiallySmallOfIsCardinalFiltered 📋 Mathlib.CategoryTheory.Presentable.CardinalPure
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (κ : Cardinal.{w}) [Fact κ.IsRegular] (J : Type u_3) [CategoryTheory.Category.{v_3, u_3} J] [CategoryTheory.EssentiallySmall.{w, v_3, u_3} J] [CategoryTheory.IsCardinalFiltered J κ] : (CategoryTheory.isCardinalPure C κ).IsStableUnderColimitsOfShape J - CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.isCardinalFiltered 📋 Mathlib.CategoryTheory.Presentable.Directed
(J : Type w) [CategoryTheory.SmallCategory J] (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hJ : ∀ (e : J), ∃ m x, IsEmpty (m ⟶ e)) : CategoryTheory.IsCardinalFiltered (CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.DiagramWithUniqueTerminal J κ) κ - CategoryTheory.IsCardinalFiltered.exists_cardinal_directed 📋 Mathlib.CategoryTheory.Presentable.Directed
(J : Type w) [CategoryTheory.SmallCategory J] (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] : ∃ α x, ∃ (_ : CategoryTheory.IsCardinalFiltered α κ), ∃ F, F.Final - CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.final_functor 📋 Mathlib.CategoryTheory.Presentable.Directed
(J : Type w) [CategoryTheory.SmallCategory J] (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hJ : ∀ (e : J), ∃ m x, IsEmpty (m ⟶ e)) : (CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.functor J κ).Final - CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.aux 📋 Mathlib.CategoryTheory.Presentable.Directed
(J : Type w) [CategoryTheory.SmallCategory J] (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hJ : ∀ (e : J), ∃ m x, IsEmpty (m ⟶ e)) : ∃ α x, ∃ (_ : CategoryTheory.IsCardinalFiltered α κ), ∃ F, F.Final - CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.isCardinalFiltered_aux 📋 Mathlib.CategoryTheory.Presentable.Directed
(J : Type w) [CategoryTheory.SmallCategory J] (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hJ : ∀ (e : J), ∃ m x, IsEmpty (m ⟶ e)) {ι : Type w} (D : ι → CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.DiagramWithUniqueTerminal J κ) (hι : HasCardinalLT ι κ) : ∃ m u, (∀ (i : ι), IsEmpty (m ⟶ (D i).top)) ∧ ∀ (i₁ i₂ : ι) (j : J) (hj₁ : (D i₁).P j) (hj₂ : (D i₂).P j), CategoryTheory.CategoryStruct.comp ((D i₁).isTerminal.lift hj₁) (u i₁) = CategoryTheory.CategoryStruct.comp ((D i₂).isTerminal.lift hj₂) (u i₂) - CategoryTheory.MorphismProperty.isClosedUnderColimitsOfShape_isLocal 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) (J : Type u') [CategoryTheory.Category.{v', u'} J] [CategoryTheory.EssentiallySmall.{w, v', u'} J] (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hW : ∀ ⦃X Y : C⦄ (f : X ⟶ Y), W f → CategoryTheory.IsCardinalPresentable X κ ∧ CategoryTheory.IsCardinalPresentable Y κ) : W.isLocal.IsClosedUnderColimitsOfShape J - Cardinal.SharplyLT.exists_isCardinalFiltered_set 📋 Mathlib.CategoryTheory.Presentable.SharplyLT.Basic
{κ₁ κ₂ : Cardinal.{w}} [Fact κ₁.IsRegular] [Fact κ₂.IsRegular] (h : κ₁.SharplyLT κ₂) {X : Type w} [PartialOrder X] [CategoryTheory.IsCardinalFiltered X κ₁] (A : Set X) (hA : HasCardinalLT (↑A) κ₂) : ∃ B, A ⊆ B ∧ CategoryTheory.IsCardinalFiltered (↑B) κ₁ ∧ HasCardinalLT (↑B) κ₂ - Cardinal.SharplyLT.exists_isCardinalFiltered_set_of_exists_cofinal 📋 Mathlib.CategoryTheory.Presentable.SharplyLT.Basic
{κ₁ κ₂ : Cardinal.{w}} [Fact κ₁.IsRegular] [Fact κ₂.IsRegular] (h₀ : κ₁ < κ₂) (h : ∀ (X : Type w), HasCardinalLT X κ₂ → ∃ Y, HasCardinalLT (↑Y) κ₂ ∧ IsCofinal Y) {X : Type w} [PartialOrder X] [CategoryTheory.IsCardinalFiltered X κ₁] (A : Set X) (hA : HasCardinalLT (↑A) κ₂) : ∃ B, A ⊆ B ∧ CategoryTheory.IsCardinalFiltered (↑B) κ₁ ∧ HasCardinalLT (↑B) κ₂ - Cardinal.SharplyLT.IsCardinalFilteredAndHasCardinalLT.isCardinalFiltered_subtype 📋 Mathlib.CategoryTheory.Presentable.SharplyLT.Basic
{κ₁ κ₂ : Cardinal.{w}} [Fact κ₁.IsRegular] [Fact κ₂.IsRegular] (hκ' : ∀ {X : Type w} [inst : PartialOrder X] [CategoryTheory.IsCardinalFiltered X κ₁] (A : Set X), HasCardinalLT (↑A) κ₂ → ∃ B, A ⊆ B ∧ CategoryTheory.IsCardinalFiltered (↑B) κ₁ ∧ HasCardinalLT (↑B) κ₂) {J : Type w} [PartialOrder J] [CategoryTheory.IsCardinalFiltered J κ₁] : CategoryTheory.IsCardinalFiltered (Subtype (Cardinal.SharplyLT.IsCardinalFilteredAndHasCardinalLT κ₁ κ₂ J)) κ₂ - Cardinal.SharplyLT.tfae 📋 Mathlib.CategoryTheory.Presentable.SharplyLT.Basic
{κ₁ κ₂ : Cardinal.{w}} [Fact κ₁.IsRegular] [Fact κ₂.IsRegular] (h : κ₁ < κ₂) : [κ₁.SharplyLT κ₂, CategoryTheory.IsCardinalAccessibleCategory (CategoryTheory.CardinalDirectedPoset κ₁) κ₂, ∀ (C : Type (w + 1)) [inst : CategoryTheory.Category.{w, w + 1} C] [CategoryTheory.IsCardinalAccessibleCategory C κ₁], CategoryTheory.IsCardinalAccessibleCategory C κ₂, ∀ (X : Type w), HasCardinalLT X κ₂ → ∃ A, HasCardinalLT (↑A) κ₂ ∧ IsCofinal A, ∀ ⦃X : Type w⦄ [inst : PartialOrder X] [CategoryTheory.IsCardinalFiltered X κ₁] (A : Set X), HasCardinalLT (↑A) κ₂ → ∃ B, A ⊆ B ∧ CategoryTheory.IsCardinalFiltered (↑B) κ₁ ∧ HasCardinalLT (↑B) κ₂].TFAE - HasCardinalLT.Set.instIsCardinalFiltered 📋 Mathlib.CategoryTheory.Presentable.Type
(X : Type u) (κ : Cardinal.{u}) [Fact κ.IsRegular] : CategoryTheory.IsCardinalFiltered (HasCardinalLT.Set X κ) κ - Cardinal.SharplyLT.exists_retract_of_isCardinalPresentable 📋 Mathlib.CategoryTheory.Presentable.Uniformization
{κ₁ κ₂ : Cardinal.{w}} [Fact κ₁.IsRegular] [Fact κ₂.IsRegular] (hκ : κ₁.SharplyLT κ₂) {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.IsCardinalAccessibleCategory C κ₁] (X : C) [CategoryTheory.IsCardinalPresentable X κ₂] : ∃ Y x J x, CategoryTheory.IsCardinalFiltered J κ₁ ∧ HasCardinalLT J κ₂ ∧ Nonempty ((CategoryTheory.isCardinalPresentable C κ₁).ColimitOfShape J Y)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c