Loogle!
Result
Found 212 declarations mentioning CategoryTheory.Limits.WalkingMultispan. Of these, only the first 200 are shown.
- CategoryTheory.Limits.WalkingMultispan 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
(J : CategoryTheory.Limits.MultispanShape) : Type (max w w') - CategoryTheory.Limits.WalkingMultispan.instSmallCategory 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} : CategoryTheory.SmallCategory (CategoryTheory.Limits.WalkingMultispan J) - CategoryTheory.Limits.WalkingMultispan.left 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} : J.L → CategoryTheory.Limits.WalkingMultispan J - CategoryTheory.Limits.WalkingMultispan.right 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} : J.R → CategoryTheory.Limits.WalkingMultispan J - CategoryTheory.Limits.WalkingMultispan.Hom 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} : CategoryTheory.Limits.WalkingMultispan J → CategoryTheory.Limits.WalkingMultispan J → Type (max w w') - CategoryTheory.Limits.WalkingMultispan.instLocallySmall 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} : CategoryTheory.LocallySmall.{t, max w w', max w' w} (CategoryTheory.Limits.WalkingMultispan J) - CategoryTheory.Limits.WalkingMultispan.instInhabitedOfL 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} [Inhabited J.L] : Inhabited (CategoryTheory.Limits.WalkingMultispan J) - CategoryTheory.Limits.WalkingMultispan.Hom.id 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} (A : CategoryTheory.Limits.WalkingMultispan J) : A.Hom A - CategoryTheory.Limits.WalkingMultispan.instInhabitedHom 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} {a : CategoryTheory.Limits.WalkingMultispan J} : Inhabited (a.Hom a) - CategoryTheory.Limits.WalkingMultispan.equiv 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
(J : CategoryTheory.Limits.MultispanShape) : CategoryTheory.Limits.WalkingMultispan J ≃ J.L ⊕ J.R - CategoryTheory.Limits.WalkingMultispan.instSmallOfLOfR 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} [Small.{t, w} J.L] [Small.{t, w'} J.R] : Small.{t, max w' w} (CategoryTheory.Limits.WalkingMultispan J) - CategoryTheory.Limits.MultispanIndex.multispan 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) : CategoryTheory.Functor (CategoryTheory.Limits.WalkingMultispan J) C - CategoryTheory.Limits.WalkingMultispan.arrowEquiv 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
(J : CategoryTheory.Limits.MultispanShape) : CategoryTheory.Arrow (CategoryTheory.Limits.WalkingMultispan J) ≃ CategoryTheory.Limits.WalkingMultispan J ⊕ J.L ⊕ J.L - CategoryTheory.Limits.WalkingMultispan.instUniqueHom 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} (a : CategoryTheory.Limits.WalkingMultispan J) : Unique (a ⟶ a) - CategoryTheory.Limits.WalkingMultispan.inclusionOfLinearOrder 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
(ι : Type w) [LinearOrder ι] : CategoryTheory.Functor (CategoryTheory.Limits.WalkingMultispan (CategoryTheory.Limits.MultispanShape.ofLinearOrder ι)) (CategoryTheory.Limits.WalkingMultispan (CategoryTheory.Limits.MultispanShape.prod ι)) - CategoryTheory.Limits.WalkingMultispan.Hom.comp 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} {A B C : CategoryTheory.Limits.WalkingMultispan J} : A.Hom B → B.Hom C → A.Hom C - CategoryTheory.Limits.WalkingMultispan.Hom.id_eq_id 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} (X : CategoryTheory.Limits.WalkingMultispan J) : CategoryTheory.Limits.WalkingMultispan.Hom.id X = CategoryTheory.CategoryStruct.id X - CategoryTheory.Limits.WalkingMultispan.instIsEmptyHomRightLeft 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} (a : J.R) (b : J.L) : IsEmpty (CategoryTheory.Limits.WalkingMultispan.right a ⟶ CategoryTheory.Limits.WalkingMultispan.left b) - CategoryTheory.Limits.WalkingMultispan.instSubsingletonHomLeft 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} (a b : J.L) : Subsingleton (CategoryTheory.Limits.WalkingMultispan.left a ⟶ CategoryTheory.Limits.WalkingMultispan.left b) - CategoryTheory.Limits.WalkingMultispan.instSubsingletonHomRight 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} (a b : J.R) : Subsingleton (CategoryTheory.Limits.WalkingMultispan.right a ⟶ CategoryTheory.Limits.WalkingMultispan.right b) - CategoryTheory.Limits.MultispanIndex.multispan_obj_left 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) (a : J.L) : I.multispan.obj (CategoryTheory.Limits.WalkingMultispan.left a) = I.left a - CategoryTheory.Limits.MultispanIndex.multispan_obj_right 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) (b : J.R) : I.multispan.obj (CategoryTheory.Limits.WalkingMultispan.right b) = I.right b - CategoryTheory.Limits.Multicofork.π 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (K : CategoryTheory.Limits.Multicofork I) (b : J.R) : I.right b ⟶ K.pt - CategoryTheory.Limits.WalkingMultispan.Hom.comp_eq_comp 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} {X Y Z : CategoryTheory.Limits.WalkingMultispan J} (f : X ⟶ Y) (g : Y ⟶ Z) : CategoryTheory.Limits.WalkingMultispan.Hom.comp f g = CategoryTheory.CategoryStruct.comp f g - CategoryTheory.Limits.Multicofork.isoOfπ 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (t : CategoryTheory.Limits.Multicofork I) : t ≅ CategoryTheory.Limits.Multicofork.ofπ I t.pt t.π ⋯ - CategoryTheory.Limits.Multicoequalizer.multicofork_π 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) [CategoryTheory.Limits.HasMulticoequalizer I] (b : J.R) : (CategoryTheory.Limits.Multicoequalizer.multicofork I).π b = CategoryTheory.Limits.Multicoequalizer.π I b - CategoryTheory.Limits.Multicofork.isColimitToLinearOrder 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type w} [LinearOrder ι] {I : CategoryTheory.Limits.MultispanIndex (CategoryTheory.Limits.MultispanShape.prod ι) C} (c : CategoryTheory.Limits.Multicofork I) (hc : CategoryTheory.Limits.IsColimit c) (h : I.SymmStruct) : CategoryTheory.Limits.IsColimit c.toLinearOrder - CategoryTheory.Limits.MultispanIndex.toLinearOrderMultispanIso 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type w} (I : CategoryTheory.Limits.MultispanIndex (CategoryTheory.Limits.MultispanShape.prod ι) C) [LinearOrder ι] : (CategoryTheory.Limits.WalkingMultispan.inclusionOfLinearOrder ι).comp I.multispan ≅ I.toLinearOrder.multispan - CategoryTheory.Limits.Multicoequalizer.multicofork_ι_app_right' 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) [CategoryTheory.Limits.HasMulticoequalizer I] (b : J.R) : CategoryTheory.Limits.colimit.ι I.multispan (CategoryTheory.Limits.WalkingMultispan.right b) = CategoryTheory.Limits.Multicoequalizer.π I b - CategoryTheory.Limits.MultispanIndex.multispan_map_fst 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) (a : J.L) : I.multispan.map (CategoryTheory.Limits.WalkingMultispan.Hom.fst a) = I.fst a - CategoryTheory.Limits.MultispanIndex.multispan_map_snd 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) (a : J.L) : I.multispan.map (CategoryTheory.Limits.WalkingMultispan.Hom.snd a) = I.snd a - CategoryTheory.Limits.WalkingMultispan.inclusionOfLinearOrder_obj 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
(ι : Type w) [LinearOrder ι] (x : CategoryTheory.Limits.WalkingMultispan (CategoryTheory.Limits.MultispanShape.ofLinearOrder ι)) : (CategoryTheory.Limits.WalkingMultispan.inclusionOfLinearOrder ι).obj x = match x with | CategoryTheory.Limits.WalkingMultispan.left a => CategoryTheory.Limits.WalkingMultispan.left ↑a | CategoryTheory.Limits.WalkingMultispan.right b => CategoryTheory.Limits.WalkingMultispan.right b - CategoryTheory.Limits.Multicofork.ofπ_pt 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) (P : C) (π : (b : J.R) → I.right b ⟶ P) (w : ∀ (a : J.L), CategoryTheory.CategoryStruct.comp (I.fst a) (π (J.fst a)) = CategoryTheory.CategoryStruct.comp (I.snd a) (π (J.snd a))) : (CategoryTheory.Limits.Multicofork.ofπ I P π w).pt = P - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCofork 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) [CategoryTheory.Limits.HasCoproduct I.left] [CategoryTheory.Limits.HasCoproduct I.right] : CategoryTheory.Limits.Multicofork I ≌ CategoryTheory.Limits.Cofork I.fstSigmaMap I.sndSigmaMap - CategoryTheory.Limits.Multicofork.condition 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (K : CategoryTheory.Limits.Multicofork I) (a : J.L) : CategoryTheory.CategoryStruct.comp (I.fst a) (K.π (J.fst a)) = CategoryTheory.CategoryStruct.comp (I.snd a) (K.π (J.snd a)) - CategoryTheory.Limits.Multicofork.IsColimit.desc 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} {K : CategoryTheory.Limits.Multicofork I} (hK : CategoryTheory.Limits.IsColimit K) {T : C} (k : (a : J.R) → I.right a ⟶ T) (hk : ∀ (b : J.L), CategoryTheory.CategoryStruct.comp (I.fst b) (k (J.fst b)) = CategoryTheory.CategoryStruct.comp (I.snd b) (k (J.snd b))) : K.pt ⟶ T - CategoryTheory.Limits.Multicofork.π_comp_hom 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (K₁ K₂ : CategoryTheory.Limits.Multicofork I) (f : K₁ ⟶ K₂) (b : J.R) : CategoryTheory.CategoryStruct.comp (K₁.π b) f.hom = K₂.π b - CategoryTheory.Limits.Multicofork.π_eq_app_right 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (K : CategoryTheory.Limits.Multicofork I) (b : J.R) : K.ι.app (CategoryTheory.Limits.WalkingMultispan.right b) = K.π b - CategoryTheory.Limits.Multicofork.toSigmaCofork_pt 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (hd : CategoryTheory.Limits.IsColimit d) (K : CategoryTheory.Limits.Multicofork I) : (CategoryTheory.Limits.Multicofork.toSigmaCofork hc hd K).pt = K.pt - CategoryTheory.Limits.Multicoequalizer.multicofork_ι_app_right 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) [CategoryTheory.Limits.HasMulticoequalizer I] (b : J.R) : (CategoryTheory.Limits.Multicoequalizer.multicofork I).ι.app (CategoryTheory.Limits.WalkingMultispan.right b) = CategoryTheory.Limits.Multicoequalizer.π I b - CategoryTheory.Limits.Multicofork.IsColimit.hom_ext 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} {K : CategoryTheory.Limits.Multicofork I} (hK : CategoryTheory.Limits.IsColimit K) {T : C} {f g : K.pt ⟶ T} (h : ∀ (a : J.R), CategoryTheory.CategoryStruct.comp (K.π a) f = CategoryTheory.CategoryStruct.comp (K.π a) g) : f = g - CategoryTheory.Limits.Multicofork.condition_assoc 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (K : CategoryTheory.Limits.Multicofork I) (a : J.L) {Z : C} (h : K.pt ⟶ Z) : CategoryTheory.CategoryStruct.comp (I.fst a) (CategoryTheory.CategoryStruct.comp (K.π (J.fst a)) h) = CategoryTheory.CategoryStruct.comp (I.snd a) (CategoryTheory.CategoryStruct.comp (K.π (J.snd a)) h) - CategoryTheory.Limits.Multicofork.ext 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} {K K' : CategoryTheory.Limits.Multicofork I} (e : K.pt ≅ K'.pt) (h : ∀ (i : J.R), CategoryTheory.CategoryStruct.comp (K.π i) e.hom = K'.π i := by cat_disch) : K ≅ K' - CategoryTheory.Limits.Multicofork.IsColimit.fac 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} {K : CategoryTheory.Limits.Multicofork I} (hK : CategoryTheory.Limits.IsColimit K) {T : C} (k : (a : J.R) → I.right a ⟶ T) (hk : ∀ (b : J.L), CategoryTheory.CategoryStruct.comp (I.fst b) (k (J.fst b)) = CategoryTheory.CategoryStruct.comp (I.snd b) (k (J.snd b))) (a : J.R) : CategoryTheory.CategoryStruct.comp (K.π a) (CategoryTheory.Limits.Multicofork.IsColimit.desc hK k hk) = k a - CategoryTheory.Limits.MultispanIndex.ofSigmaCoforkFunctor 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} : CategoryTheory.Functor (CategoryTheory.Limits.Cofork (I.fstSigmaMapOfIsColimit d hc) (I.sndSigmaMapOfIsColimit d hc)) (CategoryTheory.Limits.Multicofork I) - CategoryTheory.Limits.Multicofork.isoOfπ_hom_hom 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (t : CategoryTheory.Limits.Multicofork I) : t.isoOfπ.hom.hom = CategoryTheory.CategoryStruct.id t.pt - CategoryTheory.Limits.Multicofork.isoOfπ_inv_hom 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (t : CategoryTheory.Limits.Multicofork I) : t.isoOfπ.inv.hom = CategoryTheory.CategoryStruct.id t.pt - CategoryTheory.Limits.Multicofork.ofSigmaCofork_pt 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} {c : CategoryTheory.Limits.Cofan I.left} {hc : CategoryTheory.Limits.IsColimit c} {d : CategoryTheory.Limits.Cofan I.right} (a : CategoryTheory.Limits.Cofork (I.fstSigmaMapOfIsColimit d hc) (I.sndSigmaMapOfIsColimit d hc)) : (CategoryTheory.Limits.Multicofork.ofSigmaCofork a).pt = a.pt - CategoryTheory.Limits.Multicofork.fst_app_right 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (K : CategoryTheory.Limits.Multicofork I) (a : J.L) : K.ι.app (CategoryTheory.Limits.WalkingMultispan.left a) = CategoryTheory.CategoryStruct.comp (I.fst a) (K.π (J.fst a)) - CategoryTheory.Limits.Multicofork.snd_app_right 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (K : CategoryTheory.Limits.Multicofork I) (a : J.L) : K.ι.app (CategoryTheory.Limits.WalkingMultispan.left a) = CategoryTheory.CategoryStruct.comp (I.snd a) (K.π (J.snd a)) - CategoryTheory.Limits.Multicofork.π_comp_hom_assoc 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (K₁ K₂ : CategoryTheory.Limits.Multicofork I) (f : K₁ ⟶ K₂) (b : J.R) {Z : C} (h : K₂.pt ⟶ Z) : CategoryTheory.CategoryStruct.comp (K₁.π b) (CategoryTheory.CategoryStruct.comp f.hom h) = CategoryTheory.CategoryStruct.comp (K₂.π b) h - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCoforkOfIsColimit 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (hd : CategoryTheory.Limits.IsColimit d) : CategoryTheory.Limits.Multicofork I ≌ CategoryTheory.Limits.Cofork (I.fstSigmaMapOfIsColimit d hc) (I.sndSigmaMapOfIsColimit d hc) - CategoryTheory.Limits.MultispanIndex.toSigmaCoforkFunctor 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (hd : CategoryTheory.Limits.IsColimit d) : CategoryTheory.Functor (CategoryTheory.Limits.Multicofork I) (CategoryTheory.Limits.Cofork (I.fstSigmaMapOfIsColimit d hc) (I.sndSigmaMapOfIsColimit d hc)) - CategoryTheory.Limits.Multicofork.IsColimit.fac_assoc 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} {K : CategoryTheory.Limits.Multicofork I} (hK : CategoryTheory.Limits.IsColimit K) {T : C} (k : (a : J.R) → I.right a ⟶ T) (hk : ∀ (b : J.L), CategoryTheory.CategoryStruct.comp (I.fst b) (k (J.fst b)) = CategoryTheory.CategoryStruct.comp (I.snd b) (k (J.snd b))) (a : J.R) {Z : C} (h : T ⟶ Z) : CategoryTheory.CategoryStruct.comp (K.π a) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Multicofork.IsColimit.desc hK k hk) h) = CategoryTheory.CategoryStruct.comp (k a) h - CategoryTheory.Limits.Multicofork.ext_hom_hom 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} {K K' : CategoryTheory.Limits.Multicofork I} (e : K.pt ≅ K'.pt) (h : ∀ (i : J.R), CategoryTheory.CategoryStruct.comp (K.π i) e.hom = K'.π i := by cat_disch) : (CategoryTheory.Limits.Multicofork.ext e h).hom.hom = e.hom - CategoryTheory.Limits.Multicofork.ext_inv_hom 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} {K K' : CategoryTheory.Limits.Multicofork I} (e : K.pt ≅ K'.pt) (h : ∀ (i : J.R), CategoryTheory.CategoryStruct.comp (K.π i) e.hom = K'.π i := by cat_disch) : (CategoryTheory.Limits.Multicofork.ext e h).inv.hom = e.inv - CategoryTheory.Limits.MultispanIndex.ofSigmaCoforkFunctor_obj 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (a : CategoryTheory.Limits.Cofork (I.fstSigmaMapOfIsColimit d hc) (I.sndSigmaMapOfIsColimit d hc)) : (I.ofSigmaCoforkFunctor hc).obj a = CategoryTheory.Limits.Multicofork.ofSigmaCofork a - CategoryTheory.Limits.Multicofork.toSigmaCofork_π 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (K : CategoryTheory.Limits.Multicofork I) {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (hd : CategoryTheory.Limits.IsColimit d) : (CategoryTheory.Limits.Multicofork.toSigmaCofork hc hd K).π = CategoryTheory.Limits.Cofan.IsColimit.desc hd K.π - CategoryTheory.Limits.MultispanIndex.toSigmaCoforkFunctor_obj 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (hd : CategoryTheory.Limits.IsColimit d) (K : CategoryTheory.Limits.Multicofork I) : (I.toSigmaCoforkFunctor hc hd).obj K = CategoryTheory.Limits.Multicofork.toSigmaCofork hc hd K - CategoryTheory.Limits.Multicofork.IsColimit.mk 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (K : CategoryTheory.Limits.Multicofork I) (desc : (E : CategoryTheory.Limits.Multicofork I) → K.pt ⟶ E.pt) (fac : ∀ (E : CategoryTheory.Limits.Multicofork I) (i : J.R), CategoryTheory.CategoryStruct.comp (K.π i) (desc E) = E.π i) (uniq : ∀ (E : CategoryTheory.Limits.Multicofork I) (m : K.pt ⟶ E.pt), (∀ (i : J.R), CategoryTheory.CategoryStruct.comp (K.π i) m = E.π i) → m = desc E) : CategoryTheory.Limits.IsColimit K - CategoryTheory.Limits.Multicofork.sigma_condition 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (K : CategoryTheory.Limits.Multicofork I) {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (hd : CategoryTheory.Limits.IsColimit d) : CategoryTheory.CategoryStruct.comp (I.fstSigmaMapOfIsColimit d hc) (CategoryTheory.Limits.Cofan.IsColimit.desc hd K.π) = CategoryTheory.CategoryStruct.comp (I.sndSigmaMapOfIsColimit d hc) (CategoryTheory.Limits.Cofan.IsColimit.desc hd K.π) - CategoryTheory.Limits.Multicofork.ofSigmaCofork_π 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (a : CategoryTheory.Limits.Cofork (I.fstSigmaMapOfIsColimit d hc) (I.sndSigmaMapOfIsColimit d hc)) (i : J.R) : (CategoryTheory.Limits.Multicofork.ofSigmaCofork a).π i = CategoryTheory.CategoryStruct.comp (d.inj i) a.π - CategoryTheory.Limits.Multicofork.snd_app_right_assoc 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (K : CategoryTheory.Limits.Multicofork I) (a : J.L) {Z : C} (h : ((CategoryTheory.Functor.const (CategoryTheory.Limits.WalkingMultispan J)).obj K.pt).obj (CategoryTheory.Limits.WalkingMultispan.left a) ⟶ Z) : CategoryTheory.CategoryStruct.comp (K.ι.app (CategoryTheory.Limits.WalkingMultispan.left a)) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (I.snd a) (K.π (J.snd a))) h - CategoryTheory.Limits.Multicofork.ofπ_ι_app 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) (P : C) (π : (b : J.R) → I.right b ⟶ P) (w : ∀ (a : J.L), CategoryTheory.CategoryStruct.comp (I.fst a) (π (J.fst a)) = CategoryTheory.CategoryStruct.comp (I.snd a) (π (J.snd a))) (x : CategoryTheory.Limits.WalkingMultispan J) : (CategoryTheory.Limits.Multicofork.ofπ I P π w).ι.app x = match x with | CategoryTheory.Limits.WalkingMultispan.left a => CategoryTheory.CategoryStruct.comp (I.fst a) (π (J.fst a)) | CategoryTheory.Limits.WalkingMultispan.right a => π a - CategoryTheory.Limits.Multicofork.IsColimit.mk_desc 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (K : CategoryTheory.Limits.Multicofork I) (desc : (E : CategoryTheory.Limits.Multicofork I) → K.pt ⟶ E.pt) (fac : ∀ (E : CategoryTheory.Limits.Multicofork I) (i : J.R), CategoryTheory.CategoryStruct.comp (K.π i) (desc E) = E.π i) (uniq : ∀ (E : CategoryTheory.Limits.Multicofork I) (m : K.pt ⟶ E.pt), (∀ (i : J.R), CategoryTheory.CategoryStruct.comp (K.π i) m = E.π i) → m = desc E) (E : CategoryTheory.Limits.Multicofork I) : (CategoryTheory.Limits.Multicofork.IsColimit.mk K desc fac uniq).desc E = desc E - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCoforkOfIsColimit_inverse 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (hd : CategoryTheory.Limits.IsColimit d) : (I.multicoforkEquivSigmaCoforkOfIsColimit hc hd).inverse = I.ofSigmaCoforkFunctor hc - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCoforkOfIsColimit_functor 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (hd : CategoryTheory.Limits.IsColimit d) : (I.multicoforkEquivSigmaCoforkOfIsColimit hc hd).functor = I.toSigmaCoforkFunctor hc hd - CategoryTheory.Limits.Multicofork.sigma_condition_assoc 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} (K : CategoryTheory.Limits.Multicofork I) {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (hd : CategoryTheory.Limits.IsColimit d) {Z : C} (h : K.pt ⟶ Z) : CategoryTheory.CategoryStruct.comp (I.fstSigmaMapOfIsColimit d hc) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Cofan.IsColimit.desc hd K.π) h) = CategoryTheory.CategoryStruct.comp (I.sndSigmaMapOfIsColimit d hc) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Cofan.IsColimit.desc hd K.π) h) - CategoryTheory.Limits.MultispanIndex.toSigmaCoforkFunctor_map_hom 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (hd : CategoryTheory.Limits.IsColimit d) {K₁ K₂ : CategoryTheory.Limits.Multicofork I} (f : K₁ ⟶ K₂) : ((I.toSigmaCoforkFunctor hc hd).map f).hom = f.hom - CategoryTheory.Limits.WalkingMultispan.functorExt 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.Functor (CategoryTheory.Limits.WalkingMultispan J) C} (left : (i : J.L) → F.obj (CategoryTheory.Limits.WalkingMultispan.left i) ≅ G.obj (CategoryTheory.Limits.WalkingMultispan.left i)) (right : (i : J.R) → F.obj (CategoryTheory.Limits.WalkingMultispan.right i) ≅ G.obj (CategoryTheory.Limits.WalkingMultispan.right i)) (wl : ∀ (i : J.L), CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.Limits.WalkingMultispan.Hom.fst i)) (right (J.fst i)).hom = CategoryTheory.CategoryStruct.comp (left i).hom (G.map (CategoryTheory.Limits.WalkingMultispan.Hom.fst i)) := by cat_disch) (wr : ∀ (i : J.L), CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.Limits.WalkingMultispan.Hom.snd i)) (right (J.snd i)).hom = CategoryTheory.CategoryStruct.comp (left i).hom (G.map (CategoryTheory.Limits.WalkingMultispan.Hom.snd i)) := by cat_disch) : F ≅ G - CategoryTheory.Limits.MultispanIndex.toLinearOrderMultispanIso_hom_app 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type w} (I : CategoryTheory.Limits.MultispanIndex (CategoryTheory.Limits.MultispanShape.prod ι) C) [LinearOrder ι] (X : CategoryTheory.Limits.WalkingMultispan (CategoryTheory.Limits.MultispanShape.ofLinearOrder ι)) : I.toLinearOrderMultispanIso.hom.app X = (match X with | CategoryTheory.Limits.WalkingMultispan.left a => CategoryTheory.Iso.refl (I.left ↑a) | CategoryTheory.Limits.WalkingMultispan.right a => CategoryTheory.Iso.refl (I.right a)).hom - CategoryTheory.Limits.MultispanIndex.toLinearOrderMultispanIso_inv_app 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type w} (I : CategoryTheory.Limits.MultispanIndex (CategoryTheory.Limits.MultispanShape.prod ι) C) [LinearOrder ι] (X : CategoryTheory.Limits.WalkingMultispan (CategoryTheory.Limits.MultispanShape.ofLinearOrder ι)) : I.toLinearOrderMultispanIso.inv.app X = (match X with | CategoryTheory.Limits.WalkingMultispan.left a => CategoryTheory.Iso.refl (I.left ↑a) | CategoryTheory.Limits.WalkingMultispan.right a => CategoryTheory.Iso.refl (I.right a)).inv - CategoryTheory.Limits.Multicofork.ofSigmaCofork_ι_app_left 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} {I : CategoryTheory.Limits.MultispanIndex J C} {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (a : CategoryTheory.Limits.Cofork (I.fstSigmaMapOfIsColimit d hc) (I.sndSigmaMapOfIsColimit d hc)) (i : J.L) : (CategoryTheory.Limits.Multicofork.ofSigmaCofork a).ι.app (CategoryTheory.Limits.WalkingMultispan.left i) = CategoryTheory.CategoryStruct.comp (c.inj i) (CategoryTheory.CategoryStruct.comp (I.fstSigmaMapOfIsColimit d hc) a.π) - CategoryTheory.Limits.WalkingMultispan.functorExt_hom_app 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.Functor (CategoryTheory.Limits.WalkingMultispan J) C} (left : (i : J.L) → F.obj (CategoryTheory.Limits.WalkingMultispan.left i) ≅ G.obj (CategoryTheory.Limits.WalkingMultispan.left i)) (right : (i : J.R) → F.obj (CategoryTheory.Limits.WalkingMultispan.right i) ≅ G.obj (CategoryTheory.Limits.WalkingMultispan.right i)) (wl : ∀ (i : J.L), CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.Limits.WalkingMultispan.Hom.fst i)) (right (J.fst i)).hom = CategoryTheory.CategoryStruct.comp (left i).hom (G.map (CategoryTheory.Limits.WalkingMultispan.Hom.fst i)) := by cat_disch) (wr : ∀ (i : J.L), CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.Limits.WalkingMultispan.Hom.snd i)) (right (J.snd i)).hom = CategoryTheory.CategoryStruct.comp (left i).hom (G.map (CategoryTheory.Limits.WalkingMultispan.Hom.snd i)) := by cat_disch) (X : CategoryTheory.Limits.WalkingMultispan J) : (CategoryTheory.Limits.WalkingMultispan.functorExt left right wl wr).hom.app X = (match X with | CategoryTheory.Limits.WalkingMultispan.left i => left i | CategoryTheory.Limits.WalkingMultispan.right i => right i).hom - CategoryTheory.Limits.WalkingMultispan.functorExt_inv_app 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.Functor (CategoryTheory.Limits.WalkingMultispan J) C} (left : (i : J.L) → F.obj (CategoryTheory.Limits.WalkingMultispan.left i) ≅ G.obj (CategoryTheory.Limits.WalkingMultispan.left i)) (right : (i : J.R) → F.obj (CategoryTheory.Limits.WalkingMultispan.right i) ≅ G.obj (CategoryTheory.Limits.WalkingMultispan.right i)) (wl : ∀ (i : J.L), CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.Limits.WalkingMultispan.Hom.fst i)) (right (J.fst i)).hom = CategoryTheory.CategoryStruct.comp (left i).hom (G.map (CategoryTheory.Limits.WalkingMultispan.Hom.fst i)) := by cat_disch) (wr : ∀ (i : J.L), CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.Limits.WalkingMultispan.Hom.snd i)) (right (J.snd i)).hom = CategoryTheory.CategoryStruct.comp (left i).hom (G.map (CategoryTheory.Limits.WalkingMultispan.Hom.snd i)) := by cat_disch) (X : CategoryTheory.Limits.WalkingMultispan J) : (CategoryTheory.Limits.WalkingMultispan.functorExt left right wl wr).inv.app X = (match X with | CategoryTheory.Limits.WalkingMultispan.left i => left i | CategoryTheory.Limits.WalkingMultispan.right i => right i).inv - CategoryTheory.Limits.MultispanIndex.ofSigmaCoforkFunctor_map_hom 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} {K₁ K₂ : CategoryTheory.Limits.Cofork (I.fstSigmaMapOfIsColimit d hc) (I.sndSigmaMapOfIsColimit d hc)} (f : K₁ ⟶ K₂) : ((I.ofSigmaCoforkFunctor hc).map f).hom = f.hom - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCofork_functor_obj_pt 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) [CategoryTheory.Limits.HasCoproduct I.left] [CategoryTheory.Limits.HasCoproduct I.right] (K : CategoryTheory.Limits.Multicofork I) : (I.multicoforkEquivSigmaCofork.functor.obj K).pt = K.pt - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCofork_inverse_obj_pt 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) [CategoryTheory.Limits.HasCoproduct I.left] [CategoryTheory.Limits.HasCoproduct I.right] (a : CategoryTheory.Limits.Cofork (I.fstSigmaMapOfIsColimit (CategoryTheory.Limits.colimit.cocone (CategoryTheory.Discrete.functor I.right)) (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Discrete.functor I.left))) (I.sndSigmaMapOfIsColimit (CategoryTheory.Limits.colimit.cocone (CategoryTheory.Discrete.functor I.right)) (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Discrete.functor I.left)))) : (I.multicoforkEquivSigmaCofork.inverse.obj a).pt = a.pt - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCofork_functor_map_hom 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) [CategoryTheory.Limits.HasCoproduct I.left] [CategoryTheory.Limits.HasCoproduct I.right] {K₁ K₂ : CategoryTheory.Limits.Multicofork I} (f : K₁ ⟶ K₂) : (I.multicoforkEquivSigmaCofork.functor.map f).hom = f.hom - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCoforkOfIsColimit_unitIso 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (hd : CategoryTheory.Limits.IsColimit d) : (I.multicoforkEquivSigmaCoforkOfIsColimit hc hd).unitIso = CategoryTheory.NatIso.ofComponents (fun K => CategoryTheory.Limits.Cocone.ext (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Limits.Multicofork I)).obj K).pt) ⋯) ⋯ - CategoryTheory.Limits.WalkingMultispan.inclusionOfLinearOrder_map 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
(ι : Type w) [LinearOrder ι] {x y : CategoryTheory.Limits.WalkingMultispan (CategoryTheory.Limits.MultispanShape.ofLinearOrder ι)} (f : x ⟶ y) : (CategoryTheory.Limits.WalkingMultispan.inclusionOfLinearOrder ι).map f = match x, y, f with | x, .(x), CategoryTheory.Limits.WalkingMultispan.Hom.id .(x) => CategoryTheory.CategoryStruct.id (match x with | CategoryTheory.Limits.WalkingMultispan.left a => CategoryTheory.Limits.WalkingMultispan.left ↑a | CategoryTheory.Limits.WalkingMultispan.right b => CategoryTheory.Limits.WalkingMultispan.right b) | .(CategoryTheory.Limits.WalkingMultispan.left b), .(CategoryTheory.Limits.WalkingMultispan.right ((CategoryTheory.Limits.MultispanShape.ofLinearOrder ι).fst b)), CategoryTheory.Limits.WalkingMultispan.Hom.fst b => CategoryTheory.Limits.WalkingMultispan.Hom.fst ↑b | .(CategoryTheory.Limits.WalkingMultispan.left b), .(CategoryTheory.Limits.WalkingMultispan.right ((CategoryTheory.Limits.MultispanShape.ofLinearOrder ι).snd b)), CategoryTheory.Limits.WalkingMultispan.Hom.snd b => CategoryTheory.Limits.WalkingMultispan.Hom.snd ↑b - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCofork_functor_obj_ι_app 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) [CategoryTheory.Limits.HasCoproduct I.left] [CategoryTheory.Limits.HasCoproduct I.right] (K : CategoryTheory.Limits.Multicofork I) (X : CategoryTheory.Limits.WalkingParallelPair) : (I.multicoforkEquivSigmaCofork.functor.obj K).ι.app X = CategoryTheory.Limits.WalkingParallelPair.rec (CategoryTheory.CategoryStruct.comp (I.sndSigmaMapOfIsColimit (CategoryTheory.Limits.colimit.cocone (CategoryTheory.Discrete.functor I.right)) (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Discrete.functor I.left))) (CategoryTheory.Limits.Cofan.IsColimit.desc (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Discrete.functor I.right)) K.π)) (CategoryTheory.Limits.Cofan.IsColimit.desc (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Discrete.functor I.right)) K.π) X - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCofork_inverse_obj_ι_app 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) [CategoryTheory.Limits.HasCoproduct I.left] [CategoryTheory.Limits.HasCoproduct I.right] (a : CategoryTheory.Limits.Cofork (I.fstSigmaMapOfIsColimit (CategoryTheory.Limits.colimit.cocone (CategoryTheory.Discrete.functor I.right)) (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Discrete.functor I.left))) (I.sndSigmaMapOfIsColimit (CategoryTheory.Limits.colimit.cocone (CategoryTheory.Discrete.functor I.right)) (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Discrete.functor I.left)))) (x : CategoryTheory.Limits.WalkingMultispan J) : (I.multicoforkEquivSigmaCofork.inverse.obj a).ι.app x = match x with | CategoryTheory.Limits.WalkingMultispan.left a_1 => CategoryTheory.CategoryStruct.comp (I.fst a_1) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Cofan.inj (CategoryTheory.Limits.colimit.cocone (CategoryTheory.Discrete.functor I.right)) (J.fst a_1)) a.π) | CategoryTheory.Limits.WalkingMultispan.right a_1 => CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Cofan.inj (CategoryTheory.Limits.colimit.cocone (CategoryTheory.Discrete.functor I.right)) a_1) a.π - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCofork_inverse_map_hom 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) [CategoryTheory.Limits.HasCoproduct I.left] [CategoryTheory.Limits.HasCoproduct I.right] {K₁ K₂ : CategoryTheory.Limits.Cofork (I.fstSigmaMapOfIsColimit (CategoryTheory.Limits.colimit.cocone (CategoryTheory.Discrete.functor I.right)) (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Discrete.functor I.left))) (I.sndSigmaMapOfIsColimit (CategoryTheory.Limits.colimit.cocone (CategoryTheory.Discrete.functor I.right)) (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Discrete.functor I.left)))} (f : K₁ ⟶ K₂) : (I.multicoforkEquivSigmaCofork.inverse.map f).hom = f.hom - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCofork_unitIso_hom_app_hom 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) [CategoryTheory.Limits.HasCoproduct I.left] [CategoryTheory.Limits.HasCoproduct I.right] (X : CategoryTheory.Limits.Multicofork I) : (I.multicoforkEquivSigmaCofork.unitIso.hom.app X).hom = CategoryTheory.CategoryStruct.id X.pt - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCofork_unitIso_inv_app_hom 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) [CategoryTheory.Limits.HasCoproduct I.left] [CategoryTheory.Limits.HasCoproduct I.right] (X : CategoryTheory.Limits.Multicofork I) : (I.multicoforkEquivSigmaCofork.unitIso.inv.app X).hom = CategoryTheory.CategoryStruct.id X.pt - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCoforkOfIsColimit_counitIso 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (hd : CategoryTheory.Limits.IsColimit d) : (I.multicoforkEquivSigmaCoforkOfIsColimit hc hd).counitIso = CategoryTheory.NatIso.ofComponents (fun K => CategoryTheory.Limits.Cofork.ext (CategoryTheory.Iso.refl (((I.ofSigmaCoforkFunctor hc).comp (I.toSigmaCoforkFunctor hc hd)).obj K).pt) ⋯) ⋯ - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCofork_counitIso_hom_app_hom 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) [CategoryTheory.Limits.HasCoproduct I.left] [CategoryTheory.Limits.HasCoproduct I.right] (X : CategoryTheory.Limits.Cofork (I.fstSigmaMapOfIsColimit (CategoryTheory.Limits.colimit.cocone (CategoryTheory.Discrete.functor I.right)) (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Discrete.functor I.left))) (I.sndSigmaMapOfIsColimit (CategoryTheory.Limits.colimit.cocone (CategoryTheory.Discrete.functor I.right)) (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Discrete.functor I.left)))) : (I.multicoforkEquivSigmaCofork.counitIso.hom.app X).hom = CategoryTheory.CategoryStruct.id X.pt - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCofork_counitIso_inv_app_hom 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) [CategoryTheory.Limits.HasCoproduct I.left] [CategoryTheory.Limits.HasCoproduct I.right] (X : CategoryTheory.Limits.Cofork (I.fstSigmaMapOfIsColimit (CategoryTheory.Limits.colimit.cocone (CategoryTheory.Discrete.functor I.right)) (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Discrete.functor I.left))) (I.sndSigmaMapOfIsColimit (CategoryTheory.Limits.colimit.cocone (CategoryTheory.Discrete.functor I.right)) (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Discrete.functor I.left)))) : (I.multicoforkEquivSigmaCofork.counitIso.inv.app X).hom = CategoryTheory.CategoryStruct.id X.pt - CategoryTheory.Limits.WalkingMultispan.instFintype 📋 Mathlib.CategoryTheory.Limits.Shapes.FiniteMultiequalizer
{J : CategoryTheory.Limits.MultispanShape} [Fintype J.L] [Fintype J.R] : Fintype (CategoryTheory.Limits.WalkingMultispan J) - CategoryTheory.Limits.WalkingMultispan.instFinCategoryOfLOfDecidableEqR 📋 Mathlib.CategoryTheory.Limits.Shapes.FiniteMultiequalizer
{J : CategoryTheory.Limits.MultispanShape} [Fintype J.L] [Fintype J.R] [DecidableEq J.L] [DecidableEq J.R] : CategoryTheory.FinCategory (CategoryTheory.Limits.WalkingMultispan J) - CategoryTheory.GlueData.hasColimit_multispan_comp 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] : CategoryTheory.Limits.HasColimit (D.diagram.multispan.comp F) - CategoryTheory.GlueData.hasColimit_mapGlueData_diagram 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] : CategoryTheory.Limits.HasMulticoequalizer (D.mapGlueData F).diagram - CategoryTheory.GlueData.gluedIso 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] : F.obj D.glued ≅ (D.mapGlueData F).glued - CategoryTheory.GlueData.diagramIso 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] : D.diagram.multispan.comp F ≅ (D.mapGlueData F).diagram.multispan - CategoryTheory.GlueData.ι_gluedIso_inv 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J) : CategoryTheory.CategoryStruct.comp ((D.mapGlueData F).ι i) (D.gluedIso F).inv = F.map (D.ι i) - CategoryTheory.GlueData.ι_gluedIso_hom 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J) : CategoryTheory.CategoryStruct.comp (F.map (D.ι i)) (D.gluedIso F).hom = (D.mapGlueData F).ι i - CategoryTheory.GlueData.ι_jointly_surjective 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasMulticoequalizer D.diagram] (F : CategoryTheory.Functor C (Type v)) [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (x : F.obj D.glued) : ∃ i y, (CategoryTheory.ConcreteCategory.hom (F.map (D.ι i))) y = x - CategoryTheory.GlueData.diagramIso_app_right 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J) : (D.diagramIso F).app (CategoryTheory.Limits.WalkingMultispan.right i) = CategoryTheory.Iso.refl ((D.diagram.multispan.comp F).obj (CategoryTheory.Limits.WalkingMultispan.right i)) - CategoryTheory.GlueData.vPullbackConeIsLimitOfMap 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i j : D.J) [CategoryTheory.Limits.ReflectsLimit (CategoryTheory.Limits.cospan (D.ι i) (D.ι j)) F] (hc : CategoryTheory.Limits.IsLimit ((D.mapGlueData F).vPullbackCone i j)) : CategoryTheory.Limits.IsLimit (D.vPullbackCone i j) - CategoryTheory.GlueData.diagramIso_app_left 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J × D.J) : (D.diagramIso F).app (CategoryTheory.Limits.WalkingMultispan.left i) = CategoryTheory.Iso.refl ((D.diagram.multispan.comp F).obj (CategoryTheory.Limits.WalkingMultispan.left i)) - CategoryTheory.GlueData.ι_gluedIso_inv_assoc 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J) {Z : C'} (h : F.obj D.glued ⟶ Z) : CategoryTheory.CategoryStruct.comp ((D.mapGlueData F).ι i) (CategoryTheory.CategoryStruct.comp (D.gluedIso F).inv h) = CategoryTheory.CategoryStruct.comp (F.map (D.ι i)) h - CategoryTheory.GlueData.ι_gluedIso_hom_assoc 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J) {Z : C'} (h : (D.mapGlueData F).glued ⟶ Z) : CategoryTheory.CategoryStruct.comp (F.map (D.ι i)) (CategoryTheory.CategoryStruct.comp (D.gluedIso F).hom h) = CategoryTheory.CategoryStruct.comp ((D.mapGlueData F).ι i) h - CategoryTheory.GlueData.diagramIso_inv_app_right 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J) : (D.diagramIso F).inv.app (CategoryTheory.Limits.WalkingMultispan.right i) = CategoryTheory.CategoryStruct.id ((D.mapGlueData F).diagram.multispan.obj (CategoryTheory.Limits.WalkingMultispan.right i)) - CategoryTheory.GlueData.types_ι_jointly_surjective 📋 Mathlib.CategoryTheory.GlueData
(D : CategoryTheory.GlueData (Type v)) (x : D.glued) : ∃ i y, (CategoryTheory.ConcreteCategory.hom (D.ι i)) y = x - CategoryTheory.GlueData.diagramIso_hom_app_right 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J) : (D.diagramIso F).hom.app (CategoryTheory.Limits.WalkingMultispan.right i) = CategoryTheory.CategoryStruct.id ((D.diagram.multispan.comp F).obj (CategoryTheory.Limits.WalkingMultispan.right i)) - CategoryTheory.GlueData.diagramIso_inv_app_left 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J × D.J) : (D.diagramIso F).inv.app (CategoryTheory.Limits.WalkingMultispan.left i) = CategoryTheory.CategoryStruct.id ((D.mapGlueData F).diagram.multispan.obj (CategoryTheory.Limits.WalkingMultispan.left i)) - CategoryTheory.GlueData.diagramIso_hom_app_left 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J × D.J) : (D.diagramIso F).hom.app (CategoryTheory.Limits.WalkingMultispan.left i) = CategoryTheory.CategoryStruct.id ((D.diagram.multispan.comp F).obj (CategoryTheory.Limits.WalkingMultispan.left i)) - CategoryTheory.GlueData.types_π_surjective 📋 Mathlib.CategoryTheory.GlueData
(D : CategoryTheory.GlueData (Type u_1)) : Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom D.π) - TopCat.GlueData.fromOpenSubsetsGlue 📋 Mathlib.Topology.Gluing
{α : Type u} [TopologicalSpace α] {J : Type u} (U : J → TopologicalSpace.Opens α) : (TopCat.GlueData.ofOpenSubsets U).glued ⟶ TopCat.of α - TopCat.GlueData.ι_mono 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i : D.J) : CategoryTheory.Mono (D.ι i) - TopCat.GlueData.openCoverGlueHomeo 📋 Mathlib.Topology.Gluing
{α : Type u} [TopologicalSpace α] {J : Type u} (U : J → TopologicalSpace.Opens α) (h : ⋃ i, ↑(U i) = Set.univ) : ↑(TopCat.GlueData.ofOpenSubsets U).glued ≃ₜ α - TopCat.GlueData.ι_fromOpenSubsetsGlue 📋 Mathlib.Topology.Gluing
{α : Type u} [TopologicalSpace α] {J : Type u} (U : J → TopologicalSpace.Opens α) (i : J) : CategoryTheory.CategoryStruct.comp ((TopCat.GlueData.ofOpenSubsets U).ι i) (TopCat.GlueData.fromOpenSubsetsGlue U) = (U i).inclusion' - TopCat.GlueData.ι_injective 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i : D.J) : Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom (D.ι i)) - TopCat.GlueData.ι_isOpenEmbedding 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i : D.J) : Topology.IsOpenEmbedding ⇑(CategoryTheory.ConcreteCategory.hom (D.ι i)) - TopCat.GlueData.ι_jointly_surjective 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (x : ↑D.glued) : ∃ i y, (CategoryTheory.ConcreteCategory.hom (D.ι i)) y = x - TopCat.GlueData.open_image_open 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i : D.J) (U : TopologicalSpace.Opens ↑(D.U i)) : IsOpen (⇑(CategoryTheory.ConcreteCategory.hom (D.ι i)) '' ↑U) - TopCat.GlueData.fromOpenSubsetsGlue_injective 📋 Mathlib.Topology.Gluing
{α : Type u} [TopologicalSpace α] {J : Type u} (U : J → TopologicalSpace.Opens α) : Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom (TopCat.GlueData.fromOpenSubsetsGlue U)) - TopCat.GlueData.range_fromOpenSubsetsGlue 📋 Mathlib.Topology.Gluing
{α : Type u} [TopologicalSpace α] {J : Type u} (U : J → TopologicalSpace.Opens α) : Set.range ⇑(CategoryTheory.ConcreteCategory.hom (TopCat.GlueData.fromOpenSubsetsGlue U)) = ⋃ i, ↑(U i) - TopCat.GlueData.isOpen_iff 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (U : Set ↑D.glued) : IsOpen U ↔ ∀ (i : D.J), IsOpen (⇑(CategoryTheory.ConcreteCategory.hom (D.ι i)) ⁻¹' U) - TopCat.GlueData.π_surjective 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) : Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom D.π) - TopCat.GlueData.fromOpenSubsetsGlue_isOpenEmbedding 📋 Mathlib.Topology.Gluing
{α : Type u} [TopologicalSpace α] {J : Type u} (U : J → TopologicalSpace.Opens α) : Topology.IsOpenEmbedding ⇑(CategoryTheory.ConcreteCategory.hom (TopCat.GlueData.fromOpenSubsetsGlue U)) - TopCat.GlueData.fromOpenSubsetsGlue_isOpenMap 📋 Mathlib.Topology.Gluing
{α : Type u} [TopologicalSpace α] {J : Type u} (U : J → TopologicalSpace.Opens α) : IsOpenMap ⇑(CategoryTheory.ConcreteCategory.hom (TopCat.GlueData.fromOpenSubsetsGlue U)) - TopCat.GlueData.ι_eq_iff_rel 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i j : D.J) (x : ↑(D.U i)) (y : ↑(D.U j)) : (CategoryTheory.ConcreteCategory.hom (D.ι i)) x = (CategoryTheory.ConcreteCategory.hom (D.ι j)) y ↔ D.Rel ⟨i, x⟩ ⟨j, y⟩ - TopCat.GlueData.preimage_range 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i j : D.J) : ⇑(CategoryTheory.ConcreteCategory.hom (D.ι j)) ⁻¹' Set.range ⇑(CategoryTheory.ConcreteCategory.hom (D.ι i)) = Set.range ⇑(CategoryTheory.ConcreteCategory.hom (D.f j i)) - TopCat.GlueData.preimage_image_eq_image 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i j : D.J) (U : Set ↑(D.U i)) : ⇑(CategoryTheory.ConcreteCategory.hom (D.ι j)) ⁻¹' ⇑(CategoryTheory.ConcreteCategory.hom (D.ι i)) '' U = ⇑(CategoryTheory.ConcreteCategory.hom (D.f j i)) '' ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp (D.t j i) (D.f i j))) ⁻¹' U - TopCat.GlueData.preimage_image_eq_image' 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i j : D.J) (U : Set ↑(D.U i)) : ⇑(CategoryTheory.ConcreteCategory.hom (D.ι j)) ⁻¹' ⇑(CategoryTheory.ConcreteCategory.hom (D.ι i)) '' U = ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp (D.t i j) (D.f j i))) '' ⇑(CategoryTheory.ConcreteCategory.hom (D.f i j)) ⁻¹' U - TopCat.GlueData.ι_fromOpenSubsetsGlue_apply 📋 Mathlib.Topology.Gluing
{α : Type u} [TopologicalSpace α] {J : Type u} (U : J → TopologicalSpace.Opens α) (i : J) (x : ↑((TopCat.GlueData.ofOpenSubsets U).U i)) : (CategoryTheory.ConcreteCategory.hom (TopCat.GlueData.fromOpenSubsetsGlue U)) ((CategoryTheory.ConcreteCategory.hom ((TopCat.GlueData.ofOpenSubsets U).ι i)) x) = (CategoryTheory.ConcreteCategory.hom (U i).inclusion') x - TopCat.GlueData.image_inter 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i j : D.J) : Set.range ⇑(CategoryTheory.ConcreteCategory.hom (D.ι i)) ∩ Set.range ⇑(CategoryTheory.ConcreteCategory.hom (D.ι j)) = Set.range ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp (D.f i j) (D.ι i))) - TopCat.GlueData.eqvGen_of_π_eq 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) {x y : ↑(∐ D.U)} (h : (CategoryTheory.ConcreteCategory.hom D.π) x = (CategoryTheory.ConcreteCategory.hom D.π) y) : Relation.EqvGen (Function.Coequalizer.Rel ⇑(CategoryTheory.ConcreteCategory.hom D.diagram.fstSigmaMap) ⇑(CategoryTheory.ConcreteCategory.hom D.diagram.sndSigmaMap)) x y - AlgebraicGeometry.PresheafedSpace.GlueData.diagramOverOpen 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] {i : D.J} (U : TopologicalSpace.Opens ↑↑(D.U i)) : CategoryTheory.Functor (CategoryTheory.Limits.WalkingMultispan (CategoryTheory.Limits.MultispanShape.prod D.J))ᵒᵖ C - AlgebraicGeometry.LocallyRingedSpace.GlueData.ι_isOpenImmersion 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
(D : AlgebraicGeometry.LocallyRingedSpace.GlueData) (i : D.J) : AlgebraicGeometry.LocallyRingedSpace.IsOpenImmersion (D.ι i) - AlgebraicGeometry.LocallyRingedSpace.GlueData.vPullbackConeIsLimit 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
(D : AlgebraicGeometry.LocallyRingedSpace.GlueData) (i j : D.J) : CategoryTheory.Limits.IsLimit (D.vPullbackCone i j) - AlgebraicGeometry.PresheafedSpace.GlueData.componentwise_diagram_π_isIso 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i : D.J) (U : TopologicalSpace.Opens ↑↑(D.U i)) : CategoryTheory.IsIso (D.diagramOverOpenπ U i) - AlgebraicGeometry.PresheafedSpace.GlueData.diagramOverOpenπ 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] {i : D.J} (U : TopologicalSpace.Opens ↑↑(D.U i)) (j : D.J) : CategoryTheory.Limits.limit (D.diagramOverOpen U) ⟶ (D.diagramOverOpen U).obj (Opposite.op (CategoryTheory.Limits.WalkingMultispan.right j)) - AlgebraicGeometry.LocallyRingedSpace.GlueData.isoSheafedSpace 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
(D : AlgebraicGeometry.LocallyRingedSpace.GlueData) : D.glued.toSheafedSpace ≅ D.toSheafedSpaceGlueData.glued - AlgebraicGeometry.PresheafedSpace.GlueData.ιInvAppπApp 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] {i : D.J} (U : TopologicalSpace.Opens ↑↑(D.U i)) (j : CategoryTheory.Limits.WalkingMultispan (CategoryTheory.Limits.MultispanShape.prod D.J)) : (D.U i).presheaf.obj (Opposite.op U) ⟶ (D.diagramOverOpen U).obj (Opposite.op j) - AlgebraicGeometry.SheafedSpace.GlueData.ιIsOpenImmersion 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.SheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i : D.J) : AlgebraicGeometry.SheafedSpace.IsOpenImmersion (D.ι i) - AlgebraicGeometry.PresheafedSpace.GlueData.ιInvApp 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] {i : D.J} (U : TopologicalSpace.Opens ↑↑(D.U i)) : (D.U i).presheaf.obj (Opposite.op U) ⟶ CategoryTheory.Limits.limit (D.diagramOverOpen U) - AlgebraicGeometry.SheafedSpace.GlueData.isoPresheafedSpace 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.SheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] : D.glued.toPresheafedSpace ≅ D.toPresheafedSpaceGlueData.glued - AlgebraicGeometry.PresheafedSpace.GlueData.ιIsOpenImmersion 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i : D.J) : AlgebraicGeometry.PresheafedSpace.IsOpenImmersion (D.ι i) - AlgebraicGeometry.LocallyRingedSpace.GlueData.ι_jointly_surjective 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
(D : AlgebraicGeometry.LocallyRingedSpace.GlueData) (x : ↑D.glued.toTopCat) : ∃ i y, (CategoryTheory.ConcreteCategory.hom (D.ι i).base) y = x - AlgebraicGeometry.SheafedSpace.GlueData.vPullbackConeIsLimit 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.SheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i j : D.J) : CategoryTheory.Limits.IsLimit (D.vPullbackCone i j) - AlgebraicGeometry.LocallyRingedSpace.GlueData.ι_isoSheafedSpace_inv 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
(D : AlgebraicGeometry.LocallyRingedSpace.GlueData) (i : D.J) : CategoryTheory.CategoryStruct.comp (D.toSheafedSpaceGlueData.ι i) D.isoSheafedSpace.inv = AlgebraicGeometry.LocallyRingedSpace.Hom.toShHom (D.ι i) - AlgebraicGeometry.PresheafedSpace.GlueData.vPullbackConeIsLimit 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i j : D.J) : CategoryTheory.Limits.IsLimit (D.vPullbackCone i j) - AlgebraicGeometry.PresheafedSpace.GlueData.π_ιInvApp_eq_id 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i : D.J) (U : TopologicalSpace.Opens ↑↑(D.U i)) : CategoryTheory.CategoryStruct.comp (D.diagramOverOpenπ U i) (CategoryTheory.CategoryStruct.comp (D.ιInvAppπEqMap U) (D.ιInvApp U)) = CategoryTheory.CategoryStruct.id (CategoryTheory.Limits.limit (D.diagramOverOpen U)) - AlgebraicGeometry.PresheafedSpace.GlueData.π_ιInvApp_π 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i j : D.J) (U : TopologicalSpace.Opens ↑↑(D.U i)) : CategoryTheory.CategoryStruct.comp (D.diagramOverOpenπ U i) (CategoryTheory.CategoryStruct.comp (D.ιInvAppπEqMap U) (CategoryTheory.CategoryStruct.comp (D.ιInvApp U) (D.diagramOverOpenπ U j))) = D.diagramOverOpenπ U j - AlgebraicGeometry.LocallyRingedSpace.GlueData.ι_isoSheafedSpace_inv_assoc 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
(D : AlgebraicGeometry.LocallyRingedSpace.GlueData) (i : D.J) {Z : AlgebraicGeometry.SheafedSpace CommRingCat} (h : D.glued.toSheafedSpace ⟶ Z) : CategoryTheory.CategoryStruct.comp ((D.mapGlueData AlgebraicGeometry.LocallyRingedSpace.forgetToSheafedSpace).ι i) (CategoryTheory.CategoryStruct.comp D.isoSheafedSpace.inv h) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.LocallyRingedSpace.Hom.toShHom (D.ι i)) h - AlgebraicGeometry.SheafedSpace.GlueData.ι_jointly_surjective 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.SheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (x : ↑↑D.glued.toPresheafedSpace) : ∃ i y, (CategoryTheory.ConcreteCategory.hom (D.ι i).hom.base) y = x - AlgebraicGeometry.SheafedSpace.GlueData.ι_isoPresheafedSpace_inv 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.SheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i : D.J) : CategoryTheory.CategoryStruct.comp (D.toPresheafedSpaceGlueData.ι i) D.isoPresheafedSpace.inv = (D.ι i).hom - AlgebraicGeometry.PresheafedSpace.GlueData.ι_isOpenEmbedding 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i : D.J) : Topology.IsOpenEmbedding ⇑(CategoryTheory.ConcreteCategory.hom (D.ι i).base) - AlgebraicGeometry.PresheafedSpace.GlueData.ι_jointly_surjective 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (x : ↑↑D.glued) : ∃ i y, (CategoryTheory.ConcreteCategory.hom (D.ι i).base) y = x - AlgebraicGeometry.PresheafedSpace.GlueData.ιInvAppπEqMap 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] {i : D.J} (U : TopologicalSpace.Opens ↑↑(D.U i)) : (D.U i).presheaf.obj (Opposite.op ((TopologicalSpace.Opens.map (CategoryTheory.Limits.colimit.ι D.diagram.multispan (Opposite.unop (Opposite.op (CategoryTheory.Limits.WalkingMultispan.right i)))).base).obj (⋯.functor.obj U))) ⟶ (D.U i).presheaf.obj (Opposite.op U) - AlgebraicGeometry.PresheafedSpace.GlueData.opensImagePreimageMap 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i j : D.J) (U : TopologicalSpace.Opens ↑↑(D.U i)) : (D.U i).presheaf.obj (Opposite.op U) ⟶ (D.U j).presheaf.obj (Opposite.op ((TopologicalSpace.Opens.map (D.ι j).base).obj (⋯.functor.obj U))) - AlgebraicGeometry.PresheafedSpace.GlueData.ι_image_preimage_eq 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i j : D.J) (U : TopologicalSpace.Opens ↑↑(D.U i)) : (TopologicalSpace.Opens.map (D.ι j).base).obj (⋯.functor.obj U) = (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.opensFunctor (D.f j i)).obj ((TopologicalSpace.Opens.map (D.t j i).base).obj ((TopologicalSpace.Opens.map (D.f i j).base).obj U)) - AlgebraicGeometry.PresheafedSpace.GlueData.ιInvApp_π 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] {i : D.J} (U : TopologicalSpace.Opens ↑↑(D.U i)) : ∃ (eq : Opposite.op U = Opposite.op ((TopologicalSpace.Opens.map (CategoryTheory.Limits.colimit.ι D.diagram.multispan (Opposite.unop (Opposite.op (CategoryTheory.Limits.WalkingMultispan.right i)))).base).obj (⋯.functor.obj U))), CategoryTheory.CategoryStruct.comp (D.ιInvApp U) (D.diagramOverOpenπ U i) = (D.U i).presheaf.map (CategoryTheory.eqToHom eq) - AlgebraicGeometry.PresheafedSpace.GlueData.opensImagePreimageMap_app' 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i j k : D.J) (U : TopologicalSpace.Opens ↑↑(D.U i)) : ∃ (eq : Opposite.op ((AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.opensFunctor (CategoryTheory.Limits.pullback.snd (D.f j i) (D.f j k))).obj (Opposite.unop (Opposite.op ((TopologicalSpace.Opens.map (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (D.f j i) (D.f j k)) (CategoryTheory.CategoryStruct.comp (D.t j i) (D.f i j))).base).1 (Opposite.unop (Opposite.op U)))))) = (TopologicalSpace.Opens.map (D.f j k).base).op.obj (Opposite.op ((TopologicalSpace.Opens.map (D.ι j).base).obj (⋯.functor.obj U)))), CategoryTheory.CategoryStruct.comp (D.opensImagePreimageMap i j U) ((D.f j k).c.app (Opposite.op ((TopologicalSpace.Opens.map (D.ι j).base).obj (⋯.functor.obj U)))) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (D.f j i) (D.f j k)) (CategoryTheory.CategoryStruct.comp (D.t j i) (D.f i j))).c.app (Opposite.op U)) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.invApp (CategoryTheory.Limits.pullback.snd (D.f j i) (D.f j k)) (Opposite.unop (Opposite.op ((TopologicalSpace.Opens.map (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (D.f j i) (D.f j k)) (CategoryTheory.CategoryStruct.comp (D.t j i) (D.f i j))).base).1 (Opposite.unop (Opposite.op U)))))) ((D.V (j, k)).presheaf.map (CategoryTheory.eqToHom eq))) - AlgebraicGeometry.PresheafedSpace.GlueData.opensImagePreimageMap_app 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i j k : D.J) (U : TopologicalSpace.Opens ↑↑(D.U i)) : CategoryTheory.CategoryStruct.comp (D.opensImagePreimageMap i j U) ((D.f j k).c.app (Opposite.op ((TopologicalSpace.Opens.map (D.ι j).base).obj (⋯.functor.obj U)))) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (D.f j i) (D.f j k)) (CategoryTheory.CategoryStruct.comp (D.t j i) (D.f i j))).c.app (Opposite.op U)) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.invApp (CategoryTheory.Limits.pullback.snd (D.f j i) (D.f j k)) (Opposite.unop (Opposite.op ((TopologicalSpace.Opens.map (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (D.f j i) (D.f j k)) (CategoryTheory.CategoryStruct.comp (D.t j i) (D.f i j))).base).1 (Opposite.unop (Opposite.op U)))))) ((D.V (j, k)).presheaf.map (CategoryTheory.eqToHom ⋯))) - AlgebraicGeometry.PresheafedSpace.GlueData.opensImagePreimageMap_app_assoc 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i j k : D.J) (U : TopologicalSpace.Opens ↑↑(D.U i)) {X' : C} (f' : ((TopCat.Presheaf.pushforward C (D.f j k).base).obj (D.V (j, k)).presheaf).obj (Opposite.op ((TopologicalSpace.Opens.map (D.ι j).base).obj (⋯.functor.obj U))) ⟶ X') : CategoryTheory.CategoryStruct.comp (D.opensImagePreimageMap i j U) (CategoryTheory.CategoryStruct.comp ((D.f j k).c.app (Opposite.op ((TopologicalSpace.Opens.map (D.ι j).base).obj (⋯.functor.obj U)))) f') = CategoryTheory.CategoryStruct.comp ((CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (D.f j i) (D.f j k)) (CategoryTheory.CategoryStruct.comp (D.t j i) (D.f i j))).c.app (Opposite.op U)) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.invApp (CategoryTheory.Limits.pullback.snd (D.f j i) (D.f j k)) (Opposite.unop (Opposite.op ((TopologicalSpace.Opens.map (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (D.f j i) (D.f j k)) (CategoryTheory.CategoryStruct.comp (D.t j i) (D.f i j))).base).1 (Opposite.unop (Opposite.op U)))))) (CategoryTheory.CategoryStruct.comp ((D.V (j, k)).presheaf.map (CategoryTheory.eqToHom ⋯)) f')) - AlgebraicGeometry.Scheme.GlueData.instCreatesColimitLocallyRingedSpaceWalkingMultispanProdJMultispanDiagramForgetToLocallyRingedSpace 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) : CategoryTheory.CreatesColimit D.diagram.multispan AlgebraicGeometry.Scheme.forgetToLocallyRingedSpace - AlgebraicGeometry.Scheme.GlueData.instPreservesColimitTopCatWalkingMultispanProdJMultispanDiagramForgetToTop 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) : CategoryTheory.Limits.PreservesColimit D.diagram.multispan AlgebraicGeometry.Scheme.forgetToTop - AlgebraicGeometry.Scheme.GlueData.instPreservesColimitWalkingMultispanProdJMultispanDiagramForget 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) : CategoryTheory.Limits.PreservesColimit D.diagram.multispan AlgebraicGeometry.Scheme.forget - AlgebraicGeometry.Scheme.GlueData.isoLocallyRingedSpace 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) : D.glued.toLocallyRingedSpace ≅ D.toLocallyRingedSpaceGlueData.glued - AlgebraicGeometry.Scheme.GlueData.instIsOpenImmersionιLocallyRingedSpaceToLocallyRingedSpaceGlueData 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i : D.J) : AlgebraicGeometry.LocallyRingedSpace.IsOpenImmersion (D.toLocallyRingedSpaceGlueData.ι i) - AlgebraicGeometry.Scheme.GlueData.isoCarrier 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) : ↑D.glued.toPresheafedSpace ≅ D.toLocallyRingedSpaceGlueData.toSheafedSpaceGlueData.toPresheafedSpaceGlueData.toTopGlueData.glued - AlgebraicGeometry.Scheme.GlueData.ι_isoLocallyRingedSpace_inv 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i : D.J) : CategoryTheory.CategoryStruct.comp (D.toLocallyRingedSpaceGlueData.ι i) D.isoLocallyRingedSpace.inv = AlgebraicGeometry.Scheme.Hom.toLRSHom (D.ι i) - AlgebraicGeometry.Scheme.GlueData.ι_isoCarrier_inv 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i : D.J) : CategoryTheory.CategoryStruct.comp (D.toLocallyRingedSpaceGlueData.toSheafedSpaceGlueData.toPresheafedSpaceGlueData.toTopGlueData.ι i) D.isoCarrier.inv = (D.ι i).base - CategoryTheory.Limits.MultispanIndex.multispanMapIso 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Multiequalizer
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {J : CategoryTheory.Limits.MultispanShape} (d : CategoryTheory.Limits.MultispanIndex J C) (F : CategoryTheory.Functor C D) : (d.map F).multispan ≅ d.multispan.comp F - CategoryTheory.Limits.Multicofork.map_pt 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Multiequalizer
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {J : CategoryTheory.Limits.MultispanShape} {d : CategoryTheory.Limits.MultispanIndex J C} (c : CategoryTheory.Limits.Multicofork d) (F : CategoryTheory.Functor C D) : (c.map F).pt = F.obj c.pt - CategoryTheory.Limits.Multicofork.isColimitMapOfPreserves 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Multiequalizer
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {J : CategoryTheory.Limits.MultispanShape} {d : CategoryTheory.Limits.MultispanIndex J C} (c : CategoryTheory.Limits.Multicofork d) (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesColimit d.multispan F] (hc : CategoryTheory.Limits.IsColimit c) : CategoryTheory.Limits.IsColimit (c.map F) - CategoryTheory.Limits.Multicofork.isColimitMapEquiv 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Multiequalizer
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {J : CategoryTheory.Limits.MultispanShape} {d : CategoryTheory.Limits.MultispanIndex J C} (c : CategoryTheory.Limits.Multicofork d) (F : CategoryTheory.Functor C D) : CategoryTheory.Limits.IsColimit (F.mapCocone c) ≃ CategoryTheory.Limits.IsColimit (c.map F) - CategoryTheory.Limits.MultispanIndex.multispanMapIso_hom_app 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Multiequalizer
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {J : CategoryTheory.Limits.MultispanShape} (d : CategoryTheory.Limits.MultispanIndex J C) (F : CategoryTheory.Functor C D) (X : CategoryTheory.Limits.WalkingMultispan J) : (d.multispanMapIso F).hom.app X = (match X with | CategoryTheory.Limits.WalkingMultispan.left a => CategoryTheory.Iso.refl (F.obj (d.left a)) | CategoryTheory.Limits.WalkingMultispan.right a => CategoryTheory.Iso.refl (F.obj (d.right a))).hom - CategoryTheory.Limits.MultispanIndex.multispanMapIso_inv_app 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Multiequalizer
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {J : CategoryTheory.Limits.MultispanShape} (d : CategoryTheory.Limits.MultispanIndex J C) (F : CategoryTheory.Functor C D) (X : CategoryTheory.Limits.WalkingMultispan J) : (d.multispanMapIso F).inv.app X = (match X with | CategoryTheory.Limits.WalkingMultispan.left a => CategoryTheory.Iso.refl (F.obj (d.left a)) | CategoryTheory.Limits.WalkingMultispan.right a => CategoryTheory.Iso.refl (F.obj (d.right a))).inv - CategoryTheory.Limits.Multicofork.map_ι_app 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Multiequalizer
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {J : CategoryTheory.Limits.MultispanShape} {d : CategoryTheory.Limits.MultispanIndex J C} (c : CategoryTheory.Limits.Multicofork d) (F : CategoryTheory.Functor C D) (x : CategoryTheory.Limits.WalkingMultispan J) : (c.map F).ι.app x = match x with | CategoryTheory.Limits.WalkingMultispan.left a => CategoryTheory.CategoryStruct.comp (F.map (d.fst a)) (F.map (c.π (J.fst a))) | CategoryTheory.Limits.WalkingMultispan.right a => F.map (c.π a) - CategoryTheory.Limits.Multicofork.IsColimit.isPushout 📋 Mathlib.CategoryTheory.Limits.Shapes.MultiequalizerPullback
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : CategoryTheory.Limits.MultispanShape} [Unique J.L] {I : CategoryTheory.Limits.MultispanIndex J C} (c : CategoryTheory.Limits.Multicofork I) (h : {J.fst default, J.snd default} = Set.univ) (h' : J.fst default ≠ J.snd default) (hc : CategoryTheory.Limits.IsColimit c) : CategoryTheory.IsPushout (I.fst default) (I.snd default) (c.π (J.fst default)) (c.π (J.snd default)) - CategoryTheory.Limits.Multicofork.IsColimit.isPushout.multicofork_π_eq_inl 📋 Mathlib.CategoryTheory.Limits.Shapes.MultiequalizerPullback
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : CategoryTheory.Limits.MultispanShape} [Unique J.L] {I : CategoryTheory.Limits.MultispanIndex J C} (h : {J.fst default, J.snd default} = Set.univ) (h' : J.fst default ≠ J.snd default) (s : CategoryTheory.Limits.PushoutCocone (I.fst default) (I.snd default)) : (CategoryTheory.Limits.Multicofork.IsColimit.isPushout.multicofork h h' s).π (J.fst default) = s.inl - CategoryTheory.Limits.Multicofork.IsColimit.isPushout.multicofork_π_eq_inr 📋 Mathlib.CategoryTheory.Limits.Shapes.MultiequalizerPullback
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : CategoryTheory.Limits.MultispanShape} [Unique J.L] {I : CategoryTheory.Limits.MultispanIndex J C} (h : {J.fst default, J.snd default} = Set.univ) (h' : J.fst default ≠ J.snd default) (s : CategoryTheory.Limits.PushoutCocone (I.fst default) (I.snd default)) : (CategoryTheory.Limits.Multicofork.IsColimit.isPushout.multicofork h h' s).π (J.snd default) = s.inr - CompleteLattice.MulticoequalizerDiagram.multicofork_pt 📋 Mathlib.Order.CompleteLattice.MulticoequalizerDiagram
{T : Type u} [CompleteLattice T] {ι : Type u_1} {x : T} {u : ι → T} {v : ι → ι → T} (d : CompleteLattice.MulticoequalizerDiagram x u v) : d.multicofork.pt = x - CategoryTheory.Limits.Types.isColimitOfMulticoequalizerDiagram 📋 Mathlib.CategoryTheory.Limits.Types.Multicoequalizer
{X : Type u} {ι : Type w} {A : Set X} {U : ι → Set X} {V : ι → ι → Set X} (c : CompleteLattice.MulticoequalizerDiagram A U V) : CategoryTheory.Limits.IsColimit (c.multicofork.map Set.functorToTypes) - CategoryTheory.Functor.CoconeTypes.isMulticoequalizer_iff 📋 Mathlib.CategoryTheory.Limits.Types.Multicoequalizer
{J : CategoryTheory.Limits.MultispanShape} {d : CategoryTheory.Limits.MultispanIndex J (Type u)} (c : d.multispan.CoconeTypes) : c.IsColimit ↔ (∀ (i₁ i₂ : J.R) (x₁ : d.right i₁) (x₂ : d.right i₂), c.ι (CategoryTheory.Limits.WalkingMultispan.right i₁) x₁ = c.ι (CategoryTheory.Limits.WalkingMultispan.right i₂) x₂ → d.multispan.ιColimitType (CategoryTheory.Limits.WalkingMultispan.right i₁) x₁ = d.multispan.ιColimitType (CategoryTheory.Limits.WalkingMultispan.right i₂) x₂) ∧ ∀ (x : c.pt), ∃ i a, c.ι (CategoryTheory.Limits.WalkingMultispan.right i) a = x - CategoryTheory.Limits.Types.isColimitOfMulticoequalizerDiagram' 📋 Mathlib.CategoryTheory.Limits.Types.Multicoequalizer
{X : Type u} {ι : Type w} {A : Set X} {U : ι → Set X} {V : ι → ι → Set X} [LinearOrder ι] (c : CompleteLattice.MulticoequalizerDiagram A U V) : CategoryTheory.Limits.IsColimit (c.multicofork.toLinearOrder.map Set.functorToTypes) - SSet.Subcomplex.MulticoequalizerDiagram.isColimit 📋 Mathlib.AlgebraicTopology.SimplicialSet.SubcomplexColimits
{X : SSet} {A : X.Subcomplex} {ι : Type u_1} {U : ι → X.Subcomplex} {V : ι → ι → X.Subcomplex} (h : A.MulticoequalizerDiagram U V) : CategoryTheory.Limits.IsColimit ((CompleteLattice.MulticoequalizerDiagram.multicofork h).map SSet.Subcomplex.toSSetFunctor) - SSet.Subcomplex.MulticoequalizerDiagram.isColimit' 📋 Mathlib.AlgebraicTopology.SimplicialSet.SubcomplexColimits
{X : SSet} {A : X.Subcomplex} {ι : Type u_1} {U : ι → X.Subcomplex} {V : ι → ι → X.Subcomplex} (h : A.MulticoequalizerDiagram U V) [LinearOrder ι] : CategoryTheory.Limits.IsColimit ((CompleteLattice.MulticoequalizerDiagram.multicofork h).toLinearOrder.map SSet.Subcomplex.toSSetFunctor) - SSet.horn₃₁.desc.multicofork_pt 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).pt = X - SSet.horn₃₂.desc.multicofork_pt 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).pt = X - SSet.horn.isColimit 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} (i : Fin (n + 1)) : CategoryTheory.Limits.IsColimit ((CompleteLattice.MulticoequalizerDiagram.multicofork ⋯).toLinearOrder.map SSet.Subcomplex.toSSetFunctor) - SSet.horn₃₁.desc.multicofork_π_three 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨3, SSet.horn₃₁.desc.multicofork_π_three._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 3).inv f₃ - SSet.horn₃₁.desc.multicofork_π_two 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨2, SSet.horn₃₁.desc.multicofork_π_two._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 2).inv f₂ - SSet.horn₃₁.desc.multicofork_π_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨0, SSet.horn₃₁.desc.multicofork_π_zero._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 0).inv f₀ - SSet.horn₃₂.desc.multicofork_π_one 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨1, SSet.horn₃₂.desc.multicofork_π_one._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 1).inv f₁ - SSet.horn₃₂.desc.multicofork_π_three 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨3, SSet.horn₃₂.desc.multicofork_π_three._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 3).inv f₃ - SSet.horn₃₂.desc.multicofork_π_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨0, SSet.horn₃₂.desc.multicofork_π_zero._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 0).inv f₀ - SSet.horn₃₁.desc.multicofork_π_three_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) {Z : SSet} (h : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨3, SSet.horn₃₁.desc.multicofork_π_three._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 3).inv f₃) h - SSet.horn₃₁.desc.multicofork_π_two_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) {Z : SSet} (h : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨2, SSet.horn₃₁.desc.multicofork_π_two._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 2).inv f₂) h - SSet.horn₃₁.desc.multicofork_π_zero_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) {Z : SSet} (h : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨0, SSet.horn₃₁.desc.multicofork_π_zero._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 0).inv f₀) h - SSet.horn₃₂.desc.multicofork_π_one_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) {Z : SSet} (h : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨1, SSet.horn₃₂.desc.multicofork_π_one._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 1).inv f₁) h - SSet.horn₃₂.desc.multicofork_π_three_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) {Z : SSet} (h : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨3, SSet.horn₃₂.desc.multicofork_π_three._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 3).inv f₃) h - SSet.horn₃₂.desc.multicofork_π_zero_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) {Z : SSet} (h : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨0, SSet.horn₃₂.desc.multicofork_π_zero._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 0).inv f₀) h - CategoryTheory.Limits.Cowedge.IsColimit.hom_ext 📋 Mathlib.CategoryTheory.Limits.Shapes.End
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {F : CategoryTheory.Functor Jᵒᵖ (CategoryTheory.Functor J C)} {c : CategoryTheory.Limits.Cowedge F} (hc : CategoryTheory.Limits.IsColimit c) {X : C} {f g : c.pt ⟶ X} (h : ∀ (j : (CategoryTheory.Limits.multispanShapeCoend J).R), CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Multicofork.π c j) f = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Multicofork.π c j) g) : f = g - CategoryTheory.Limits.Cowedge.ext 📋 Mathlib.CategoryTheory.Limits.Shapes.End
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {F : CategoryTheory.Functor Jᵒᵖ (CategoryTheory.Functor J C)} {W₁ W₂ : CategoryTheory.Limits.Cowedge F} (e : W₁.pt ≅ W₂.pt) (he : ∀ (j : J), CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Multicofork.π W₁ j) e.hom = CategoryTheory.Limits.Multicofork.π W₂ j := by cat_disch) : W₁ ≅ W₂
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