Loogle!
Result
Found 128 declarations mentioning CategoryTheory.Limits.MultispanShape.prod.
- CategoryTheory.Limits.MultispanShape.prod 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
(ι : Type w) : CategoryTheory.Limits.MultispanShape - CategoryTheory.Limits.MultispanShape.prod_R 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
(ι : Type w) : (CategoryTheory.Limits.MultispanShape.prod ι).R = ι - CategoryTheory.Limits.MultispanShape.prod_L 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
(ι : Type w) : (CategoryTheory.Limits.MultispanShape.prod ι).L = (ι × ι) - CategoryTheory.Limits.MultispanIndex.SymmStruct 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type w} (I : CategoryTheory.Limits.MultispanIndex (CategoryTheory.Limits.MultispanShape.prod ι) C) : Type (max v w) - CategoryTheory.Limits.MultispanShape.prod_fst 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
(ι : Type w) (self : ι × ι) : (CategoryTheory.Limits.MultispanShape.prod ι).fst self = self.1 - CategoryTheory.Limits.MultispanShape.prod_snd 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
(ι : Type w) (self : ι × ι) : (CategoryTheory.Limits.MultispanShape.prod ι).snd self = self.2 - CategoryTheory.Limits.MultispanIndex.toLinearOrder 📋 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.MultispanIndex (CategoryTheory.Limits.MultispanShape.ofLinearOrder ι) C - 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.Multicofork.toLinearOrder 📋 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) : CategoryTheory.Limits.Multicofork I.toLinearOrder - CategoryTheory.Limits.Multicofork.ofLinearOrder 📋 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.toLinearOrder) (h : I.SymmStruct) : CategoryTheory.Limits.Multicofork I - CategoryTheory.Limits.MultispanIndex.toLinearOrder_right 📋 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 ι] (i : (CategoryTheory.Limits.MultispanShape.ofLinearOrder ι).R) : I.toLinearOrder.right i = I.right i - CategoryTheory.Limits.MultispanIndex.SymmStruct.iso 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type w} {I : CategoryTheory.Limits.MultispanIndex (CategoryTheory.Limits.MultispanShape.prod ι) C} (self : I.SymmStruct) (i j : ι) : I.left (i, j) ≅ I.left (j, i) - 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.SymmStruct.fst_eq_snd 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type w} {I : CategoryTheory.Limits.MultispanIndex (CategoryTheory.Limits.MultispanShape.prod ι) C} (self : I.SymmStruct) (i : ι) : I.fst (i, i) = I.snd (i, i) - 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.MultispanIndex.toLinearOrder_left 📋 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 ι] (j : (CategoryTheory.Limits.MultispanShape.ofLinearOrder ι).L) : I.toLinearOrder.left j = I.left ↑j - 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.MultispanIndex.SymmStruct.iso_hom_fst 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type w} {I : CategoryTheory.Limits.MultispanIndex (CategoryTheory.Limits.MultispanShape.prod ι) C} (self : I.SymmStruct) (i j : ι) : CategoryTheory.CategoryStruct.comp (self.iso i j).hom (I.fst (j, i)) = I.snd (i, j) - CategoryTheory.Limits.MultispanIndex.SymmStruct.iso_hom_snd 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type w} {I : CategoryTheory.Limits.MultispanIndex (CategoryTheory.Limits.MultispanShape.prod ι) C} (self : I.SymmStruct) (i j : ι) : CategoryTheory.CategoryStruct.comp (self.iso i j).hom (I.snd (j, i)) = I.fst (i, j) - CategoryTheory.Limits.MultispanIndex.SymmStruct.iso_hom_fst_assoc 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type w} {I : CategoryTheory.Limits.MultispanIndex (CategoryTheory.Limits.MultispanShape.prod ι) C} (self : I.SymmStruct) (i j : ι) {Z : C} (h : I.right ((CategoryTheory.Limits.MultispanShape.prod ι).fst (j, i)) ⟶ Z) : CategoryTheory.CategoryStruct.comp (self.iso i j).hom (CategoryTheory.CategoryStruct.comp (I.fst (j, i)) h) = CategoryTheory.CategoryStruct.comp (I.snd (i, j)) h - CategoryTheory.Limits.MultispanIndex.SymmStruct.iso_hom_snd_assoc 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type w} {I : CategoryTheory.Limits.MultispanIndex (CategoryTheory.Limits.MultispanShape.prod ι) C} (self : I.SymmStruct) (i j : ι) {Z : C} (h : I.right ((CategoryTheory.Limits.MultispanShape.prod ι).snd (j, i)) ⟶ Z) : CategoryTheory.CategoryStruct.comp (self.iso i j).hom (CategoryTheory.CategoryStruct.comp (I.snd (j, i)) h) = CategoryTheory.CategoryStruct.comp (I.fst (i, j)) h - CategoryTheory.Limits.MultispanIndex.toLinearOrder_fst 📋 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 ι] (j : (CategoryTheory.Limits.MultispanShape.ofLinearOrder ι).L) : I.toLinearOrder.fst j = I.fst ↑j - CategoryTheory.Limits.MultispanIndex.toLinearOrder_snd 📋 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 ι] (j : (CategoryTheory.Limits.MultispanShape.ofLinearOrder ι).L) : I.toLinearOrder.snd j = I.snd ↑j - CategoryTheory.Limits.MultispanIndex.SymmStruct.mk 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type w} {I : CategoryTheory.Limits.MultispanIndex (CategoryTheory.Limits.MultispanShape.prod ι) C} (iso : (i j : ι) → I.left (i, j) ≅ I.left (j, i)) (iso_hom_fst : ∀ (i j : ι), CategoryTheory.CategoryStruct.comp (iso i j).hom (I.fst (j, i)) = I.snd (i, j)) (iso_hom_snd : ∀ (i j : ι), CategoryTheory.CategoryStruct.comp (iso i j).hom (I.snd (j, i)) = I.fst (i, j)) (fst_eq_snd : ∀ (i : ι), I.fst (i, i) = I.snd (i, i)) : I.SymmStruct - 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.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.GlueData.diagram 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) : CategoryTheory.Limits.MultispanIndex (CategoryTheory.Limits.MultispanShape.prod D.J) C - CategoryTheory.GlueData.glued 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasMulticoequalizer D.diagram] : C - CategoryTheory.GlueData.diagram_left 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) : D.diagram.left = D.V - CategoryTheory.GlueData.diagram_right 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) : D.diagram.right = D.U - CategoryTheory.GlueData.ι 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasMulticoequalizer D.diagram] (i : D.J) : D.U i ⟶ D.glued - CategoryTheory.GlueData.vPullbackCone 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasMulticoequalizer D.diagram] (i j : D.J) : CategoryTheory.Limits.PullbackCone (D.ι i) (D.ι j) - CategoryTheory.GlueData.π 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.HasColimits C] : D.sigmaOpens ⟶ D.glued - CategoryTheory.GlueData.π_epi 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.HasColimits C] : CategoryTheory.Epi D.π - 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.diagram_fst 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) (i j : D.J) : D.diagram.fst (i, j) = D.f i j - CategoryTheory.GlueData.diagram_snd 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) (i j : D.J) : D.diagram.snd (i, j) = CategoryTheory.CategoryStruct.comp (D.t i j) (D.f j i) - 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.glue_condition 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasMulticoequalizer D.diagram] (i j : D.J) : CategoryTheory.CategoryStruct.comp (D.t i j) (CategoryTheory.CategoryStruct.comp (D.f j i) (D.ι j)) = CategoryTheory.CategoryStruct.comp (D.f i j) (D.ι i) - 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.glue_condition_apply 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasMulticoequalizer D.diagram] (i j : D.J) {F : C → C → Type uF} {carrier : C → Type w} {instFunLike : (X Y : C) → FunLike (F X Y) (carrier X) (carrier Y)} [inst : CategoryTheory.ConcreteCategory C F] (x : carrier (D.V (i, j))) : (CategoryTheory.ConcreteCategory.hom (D.ι j)) ((CategoryTheory.ConcreteCategory.hom (D.f j i)) ((CategoryTheory.ConcreteCategory.hom (D.t i j)) x)) = (CategoryTheory.ConcreteCategory.hom (D.ι i)) ((CategoryTheory.ConcreteCategory.hom (D.f i j)) x) - 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.instHasMulticoequalizerDiagram 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) : CategoryTheory.Limits.HasMulticoequalizer D.diagram - 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 - AlgebraicGeometry.Scheme.Pullback.gluing_ι 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (j : 𝒰.I₀) : (AlgebraicGeometry.Scheme.Pullback.gluing 𝒰 f g).ι j = CategoryTheory.Limits.Multicoequalizer.π (AlgebraicGeometry.Scheme.Pullback.gluing 𝒰 f g).diagram j - AlgebraicGeometry.Scheme.Pullback.pullbackP1Iso_hom_ι 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (i : 𝒰.I₀) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Pullback.pullbackP1Iso 𝒰 f g i).hom (CategoryTheory.Limits.Multicoequalizer.π (AlgebraicGeometry.Scheme.Pullback.gluing 𝒰 f g).diagram i) = CategoryTheory.Limits.pullback.fst (AlgebraicGeometry.Scheme.Pullback.p1 𝒰 f g) (𝒰.f i) - AlgebraicGeometry.Scheme.Pullback.pullbackP1Iso_hom_ι_assoc 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (i : 𝒰.I₀) {Z✝ : AlgebraicGeometry.Scheme} (h : CategoryTheory.Limits.multicoequalizer (AlgebraicGeometry.Scheme.Pullback.gluing 𝒰 f g).diagram ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Pullback.pullbackP1Iso 𝒰 f g i).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Multicoequalizer.π (AlgebraicGeometry.Scheme.Pullback.gluing 𝒰 f g).diagram i) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (AlgebraicGeometry.Scheme.Pullback.p1 𝒰 f g) (𝒰.f i)) h - CompleteLattice.MulticoequalizerDiagram.multispanIndex 📋 Mathlib.Order.CompleteLattice.MulticoequalizerDiagram
{T : Type u} [CompleteLattice T] {ι : Type u_1} {x : T} {u : ι → T} {v : ι → ι → T} (d : CompleteLattice.MulticoequalizerDiagram x u v) : CategoryTheory.Limits.MultispanIndex (CategoryTheory.Limits.MultispanShape.prod ι) T - CompleteLattice.MulticoequalizerDiagram.multicofork 📋 Mathlib.Order.CompleteLattice.MulticoequalizerDiagram
{T : Type u} [CompleteLattice T] {ι : Type u_1} {x : T} {u : ι → T} {v : ι → ι → T} (d : CompleteLattice.MulticoequalizerDiagram x u v) : CategoryTheory.Limits.Multicofork d.multispanIndex - CompleteLattice.MulticoequalizerDiagram.multispanIndex_right 📋 Mathlib.Order.CompleteLattice.MulticoequalizerDiagram
{T : Type u} [CompleteLattice T] {ι : Type u_1} {x : T} {u : ι → T} {v : ι → ι → T} (d : CompleteLattice.MulticoequalizerDiagram x u v) (a✝ : ι) : d.multispanIndex.right a✝ = u a✝ - CompleteLattice.MulticoequalizerDiagram.multispanIndex_left 📋 Mathlib.Order.CompleteLattice.MulticoequalizerDiagram
{T : Type u} [CompleteLattice T] {ι : Type u_1} {x : T} {u : ι → T} {v : ι → ι → T} (d : CompleteLattice.MulticoequalizerDiagram x u v) (x✝ : (CategoryTheory.Limits.MultispanShape.prod ι).L) : d.multispanIndex.left x✝ = match x✝ with | (i, j) => v i j - 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 - CompleteLattice.MulticoequalizerDiagram.multispanIndex_fst 📋 Mathlib.Order.CompleteLattice.MulticoequalizerDiagram
{T : Type u} [CompleteLattice T] {ι : Type u_1} {x : T} {u : ι → T} {v : ι → ι → T} (d : CompleteLattice.MulticoequalizerDiagram x u v) (x✝ : (CategoryTheory.Limits.MultispanShape.prod ι).L) : d.multispanIndex.fst x✝ = CategoryTheory.homOfLE ⋯ - CompleteLattice.MulticoequalizerDiagram.multispanIndex_snd 📋 Mathlib.Order.CompleteLattice.MulticoequalizerDiagram
{T : Type u} [CompleteLattice T] {ι : Type u_1} {x : T} {u : ι → T} {v : ι → ι → T} (d : CompleteLattice.MulticoequalizerDiagram x u v) (x✝ : (CategoryTheory.Limits.MultispanShape.prod ι).L) : d.multispanIndex.snd x✝ = CategoryTheory.homOfLE ⋯ - 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) - 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)
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