Loogle!
Result
Found 50 declarations mentioning CategoryTheory.TransfiniteCompositionOfShape.F.
- CategoryTheory.TransfiniteCompositionOfShape.F 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (self : CategoryTheory.TransfiniteCompositionOfShape J f) : CategoryTheory.Functor J C - CategoryTheory.TransfiniteCompositionOfShape.isWellOrderContinuous 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (self : CategoryTheory.TransfiniteCompositionOfShape J f) : self.F.IsWellOrderContinuous - CategoryTheory.TransfiniteCompositionOfShape.isoBot 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (self : CategoryTheory.TransfiniteCompositionOfShape J f) : self.F.obj ⊥ ≅ X - CategoryTheory.TransfiniteCompositionOfShape.isColimit 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (self : CategoryTheory.TransfiniteCompositionOfShape J f) : CategoryTheory.Limits.IsColimit { pt := Y, ι := self.incl } - CategoryTheory.TransfiniteCompositionOfShape.ofArrowIso_F 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) {X' Y' : C} {f' : X' ⟶ Y'} (e : CategoryTheory.Arrow.mk f ≅ CategoryTheory.Arrow.mk f') : (c.ofArrowIso e).F = c.F - CategoryTheory.TransfiniteCompositionOfShape.map_F 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u'} [CategoryTheory.Category.{v', u'} D] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesWellOrderContinuousOfShape J F] [CategoryTheory.Limits.PreservesColimitsOfShape J F] : (c.map F).F = c.F.comp F - CategoryTheory.TransfiniteCompositionOfShape.incl 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (self : CategoryTheory.TransfiniteCompositionOfShape J f) : self.F ⟶ (CategoryTheory.Functor.const J).obj Y - CategoryTheory.TransfiniteCompositionOfShape.ofArrowIso_isoBot 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) {X' Y' : C} {f' : X' ⟶ Y'} (e : CategoryTheory.Arrow.mk f ≅ CategoryTheory.Arrow.mk f') : (c.ofArrowIso e).isoBot = c.isoBot ≪≫ CategoryTheory.Arrow.leftFunc.mapIso e - CategoryTheory.TransfiniteCompositionOfShape.map_isoBot 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u'} [CategoryTheory.Category.{v', u'} D] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesWellOrderContinuousOfShape J F] [CategoryTheory.Limits.PreservesColimitsOfShape J F] : (c.map F).isoBot = F.mapIso c.isoBot - CategoryTheory.TransfiniteCompositionOfShape.ofOrderIso_F 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) {J' : Type w'} [LinearOrder J'] [OrderBot J'] [SuccOrder J'] [WellFoundedLT J'] (e : J' ≃o J) : (c.ofOrderIso e).F = e.equivalence.functor.comp c.F - CategoryTheory.TransfiniteCompositionOfShape.ofComposableArrows_F 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {n : ℕ} (G : CategoryTheory.ComposableArrows C n) : (CategoryTheory.TransfiniteCompositionOfShape.ofComposableArrows G).F = G - CategoryTheory.TransfiniteCompositionOfShape.iic 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) (j : J) : CategoryTheory.TransfiniteCompositionOfShape (↑(Set.Iic j)) (c.F.map (CategoryTheory.homOfLE ⋯)) - CategoryTheory.TransfiniteCompositionOfShape.ici 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) (j : J) : CategoryTheory.TransfiniteCompositionOfShape (↑(Set.Ici j)) (c.incl.app j) - CategoryTheory.TransfiniteCompositionOfShape.fac 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (self : CategoryTheory.TransfiniteCompositionOfShape J f) : CategoryTheory.CategoryStruct.comp self.isoBot.inv (self.incl.app ⊥) = f - CategoryTheory.TransfiniteCompositionOfShape.ofArrowIso_incl 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) {X' Y' : C} {f' : X' ⟶ Y'} (e : CategoryTheory.Arrow.mk f ≅ CategoryTheory.Arrow.mk f') : (c.ofArrowIso e).incl = CategoryTheory.CategoryStruct.comp c.incl ((CategoryTheory.Functor.const J).map (CategoryTheory.Arrow.Hom.right e.hom)) - CategoryTheory.TransfiniteCompositionOfShape.ofOrderIso_incl 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) {J' : Type w'} [LinearOrder J'] [OrderBot J'] [SuccOrder J'] [WellFoundedLT J'] (e : J' ≃o J) : (c.ofOrderIso e).incl = e.equivalence.functor.whiskerLeft c.incl - CategoryTheory.TransfiniteCompositionOfShape.fac_assoc 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (self : CategoryTheory.TransfiniteCompositionOfShape J f) {Z : C} (h : ((CategoryTheory.Functor.const J).obj Y).obj ⊥ ⟶ Z) : CategoryTheory.CategoryStruct.comp self.isoBot.inv (CategoryTheory.CategoryStruct.comp (self.incl.app ⊥) h) = CategoryTheory.CategoryStruct.comp f h - CategoryTheory.TransfiniteCompositionOfShape.ofOrderIso_isoBot 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) {J' : Type w'} [LinearOrder J'] [OrderBot J'] [SuccOrder J'] [WellFoundedLT J'] (e : J' ≃o J) : (c.ofOrderIso e).isoBot = c.F.mapIso (CategoryTheory.eqToIso ⋯) ≪≫ c.isoBot - CategoryTheory.TransfiniteCompositionOfShape.map_incl 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u'} [CategoryTheory.Category.{v', u'} D] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesWellOrderContinuousOfShape J F] [CategoryTheory.Limits.PreservesColimitsOfShape J F] : (c.map F).incl = CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight c.incl F) (CategoryTheory.Functor.constComp J Y F).hom - CategoryTheory.TransfiniteCompositionOfShape.ici_F 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) (j : J) : (c.ici j).F = ⋯.functor.comp c.F - CategoryTheory.TransfiniteCompositionOfShape.iic_F 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) (j : J) : (c.iic j).F = ⋯.functor.comp c.F - CategoryTheory.TransfiniteCompositionOfShape.ici_incl 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) (j : J) : (c.ici j).incl = ⋯.functor.whiskerLeft c.incl - CategoryTheory.TransfiniteCompositionOfShape.ici_isoBot 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) (j : J) : (c.ici j).isoBot = CategoryTheory.Iso.refl ((⋯.functor.comp c.F).obj ⊥) - CategoryTheory.TransfiniteCompositionOfShape.iic_isoBot 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) (j : J) : (c.iic j).isoBot = CategoryTheory.Iso.refl ((⋯.functor.comp c.F).obj ⊥) - CategoryTheory.TransfiniteCompositionOfShape.iic_incl_app 📋 Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {X Y : C} {f : X ⟶ Y} [SuccOrder J] [WellFoundedLT J] (c : CategoryTheory.TransfiniteCompositionOfShape J f) (j : J) (i : ↑(Set.Iic j)) : (c.iic j).incl.app i = c.F.map (CategoryTheory.homOfLE ⋯) - CategoryTheory.MorphismProperty.TransfiniteCompositionOfShape.mem_map 📋 Mathlib.CategoryTheory.MorphismProperty.TransfiniteComposition
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} {J : Type w} [LinearOrder J] [SuccOrder J] [OrderBot J] [WellFoundedLT J] [W.IsStableUnderTransfiniteComposition] {X Y : C} {f : X ⟶ Y} (h : W.TransfiniteCompositionOfShape J f) {i j : J} (φ : i ⟶ j) : W (h.F.map φ) - CategoryTheory.MorphismProperty.TransfiniteCompositionOfShape.instIsIsoMapF 📋 Mathlib.CategoryTheory.MorphismProperty.TransfiniteComposition
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [SuccOrder J] [OrderBot J] [WellFoundedLT J] {X Y : C} {f : X ⟶ Y} (h : (CategoryTheory.MorphismProperty.isomorphisms C).TransfiniteCompositionOfShape J f) {i j : J} (f✝ : i ⟶ j) : CategoryTheory.IsIso (h.F.map f✝) - CategoryTheory.MorphismProperty.TransfiniteCompositionOfShape.mk 📋 Mathlib.CategoryTheory.MorphismProperty.TransfiniteComposition
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} {J : Type w} [LinearOrder J] [SuccOrder J] [OrderBot J] [WellFoundedLT J] {X Y : C} {f : X ⟶ Y} (toTransfiniteCompositionOfShape : CategoryTheory.TransfiniteCompositionOfShape J f) (map_mem : ∀ (j : J), ¬IsMax j → W (toTransfiniteCompositionOfShape.F.map (CategoryTheory.homOfLE ⋯))) : W.TransfiniteCompositionOfShape J f - CategoryTheory.MorphismProperty.TransfiniteCompositionOfShape.map_mem 📋 Mathlib.CategoryTheory.MorphismProperty.TransfiniteComposition
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} {J : Type w} [LinearOrder J] [SuccOrder J] [OrderBot J] [WellFoundedLT J] {X Y : C} {f : X ⟶ Y} (self : W.TransfiniteCompositionOfShape J f) (j : J) (hj : ¬IsMax j) : W (self.F.map (CategoryTheory.homOfLE ⋯)) - CategoryTheory.MorphismProperty.TransfiniteCompositionOfShape.mem_incl_app 📋 Mathlib.CategoryTheory.MorphismProperty.TransfiniteComposition
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} {J : Type w} [LinearOrder J] [SuccOrder J] [OrderBot J] [WellFoundedLT J] [W.IsStableUnderTransfiniteComposition] {X Y : C} {f : X ⟶ Y} (h : W.TransfiniteCompositionOfShape J f) (j : J) : W (h.incl.app j) - CategoryTheory.MorphismProperty.TransfiniteCompositionOfShape.instIsIsoAppIncl 📋 Mathlib.CategoryTheory.MorphismProperty.TransfiniteComposition
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [SuccOrder J] [OrderBot J] [WellFoundedLT J] {X Y : C} {f : X ⟶ Y} (h : (CategoryTheory.MorphismProperty.isomorphisms C).TransfiniteCompositionOfShape J f) (j : J) : CategoryTheory.IsIso (h.incl.app j) - CategoryTheory.MorphismProperty.IsStableUnderTransfiniteCompositionOfShape.of_isStableUnderColimitsOfShape.mem_map_bot_le 📋 Mathlib.CategoryTheory.MorphismProperty.TransfiniteComposition
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} {J : Type w} [LinearOrder J] [SuccOrder J] [OrderBot J] [WellFoundedLT J] {X Y : C} {f : X ⟶ Y} (hf : W.TransfiniteCompositionOfShape J f) [W.IsMultiplicative] (hJ : ∀ (J : Type w) [inst : LinearOrder J] [SuccOrder J] [OrderBot J] [WellFoundedLT J], W.IsStableUnderColimitsOfShape J) {j : J} (g : ⊥ ⟶ j) : W (hf.F.map g) - CategoryTheory.MorphismProperty.TransfiniteCompositionOfShape.iic 📋 Mathlib.CategoryTheory.MorphismProperty.TransfiniteComposition
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} {J : Type w} [LinearOrder J] [SuccOrder J] [OrderBot J] [WellFoundedLT J] {X Y : C} {f : X ⟶ Y} (h : W.TransfiniteCompositionOfShape J f) (j : J) : W.TransfiniteCompositionOfShape (↑(Set.Iic j)) (h.F.map (CategoryTheory.homOfLE ⋯)) - CategoryTheory.MorphismProperty.TransfiniteCompositionOfShape.ici 📋 Mathlib.CategoryTheory.MorphismProperty.TransfiniteComposition
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} {J : Type w} [LinearOrder J] [SuccOrder J] [OrderBot J] [WellFoundedLT J] {X Y : C} {f : X ⟶ Y} (h : W.TransfiniteCompositionOfShape J f) (j : J) : W.TransfiniteCompositionOfShape (↑(Set.Ici j)) (h.incl.app j) - CategoryTheory.MorphismProperty.TransfiniteCompositionOfShape.ofComposableArrows_F 📋 Mathlib.CategoryTheory.MorphismProperty.TransfiniteComposition
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) {n : ℕ} (F : CategoryTheory.ComposableArrows C n) (hF : ∀ (i : Fin n), W (F.map (CategoryTheory.homOfLE ⋯))) : (CategoryTheory.MorphismProperty.TransfiniteCompositionOfShape.ofComposableArrows W F hF).F = F - CategoryTheory.SmallObject.SuccStruct.transfiniteCompositionOfShapeιIteration_F 📋 Mathlib.CategoryTheory.SmallObject.TransfiniteIteration
{C : Type u} [CategoryTheory.Category.{v, u} C] (Φ : CategoryTheory.SmallObject.SuccStruct C) (J : Type w) [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] [CategoryTheory.Limits.HasIterationOfShape J C] : (Φ.transfiniteCompositionOfShapeιIteration J).F = Φ.iterationFunctor J - HomotopicalAlgebra.RelativeCellComplex.mk 📋 Mathlib.AlgebraicTopology.RelativeCellComplex.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w'} [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] {α : J → Type t} {A B : (j : J) → α j → C} {basicCell : (j : J) → (i : α j) → A j i ⟶ B j i} {X Y : C} {f : X ⟶ Y} (toTransfiniteCompositionOfShape : CategoryTheory.TransfiniteCompositionOfShape J f) (attachCells : (j : J) → ¬IsMax j → HomotopicalAlgebra.AttachCells (basicCell j) (toTransfiniteCompositionOfShape.F.map (CategoryTheory.homOfLE ⋯))) : HomotopicalAlgebra.RelativeCellComplex basicCell f - HomotopicalAlgebra.RelativeCellComplex.attachCells 📋 Mathlib.AlgebraicTopology.RelativeCellComplex.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w'} [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] {α : J → Type t} {A B : (j : J) → α j → C} {basicCell : (j : J) → (i : α j) → A j i ⟶ B j i} {X Y : C} {f : X ⟶ Y} (self : HomotopicalAlgebra.RelativeCellComplex basicCell f) (j : J) (hj : ¬IsMax j) : HomotopicalAlgebra.AttachCells (basicCell j) (self.F.map (CategoryTheory.homOfLE ⋯)) - HomotopicalAlgebra.RelativeCellComplex.Cells.mk 📋 Mathlib.AlgebraicTopology.RelativeCellComplex.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w'} [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] {α : J → Type t} {A B : (j : J) → α j → C} {basicCell : (j : J) → (i : α j) → A j i ⟶ B j i} {X Y : C} {f : X ⟶ Y} {c : HomotopicalAlgebra.RelativeCellComplex basicCell f} (j : J) (hj : ¬IsMax j) (k : (c.attachCells j hj).ι) : c.Cells - HomotopicalAlgebra.RelativeCellComplex.Cells.k 📋 Mathlib.AlgebraicTopology.RelativeCellComplex.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w'} [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] {α : J → Type t} {A B : (j : J) → α j → C} {basicCell : (j : J) → (i : α j) → A j i ⟶ B j i} {X Y : C} {f : X ⟶ Y} {c : HomotopicalAlgebra.RelativeCellComplex basicCell f} (self : c.Cells) : (c.attachCells self.j ⋯).ι - CategoryTheory.SmallObject.transfiniteCompositionOfShapeSuccStructPropιIteration_F 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : (CategoryTheory.SmallObject.transfiniteCompositionOfShapeSuccStructPropιIteration I κ).F = CategoryTheory.SmallObject.iterationFunctor I κ - CategoryTheory.SmallObject.preservesColimit 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {A B X Y : C} (i : A ⟶ B) (hi : I i) (f : X ⟶ Y) (hf : HomotopicalAlgebra.RelativeCellComplex (fun x => I.homFamily) f) : CategoryTheory.Limits.PreservesColimit hf.F (CategoryTheory.coyoneda.obj (Opposite.op A)) - CategoryTheory.MorphismProperty.IsCardinalForSmallObjectArgument.preservesColimit 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {I : CategoryTheory.MorphismProperty C} {κ : Cardinal.{w}} {inst✝¹ : Fact κ.IsRegular} {inst✝² : OrderBot κ.ord.ToType} [self : I.IsCardinalForSmallObjectArgument κ] {A B X Y : C} (i : A ⟶ B) : I i → ∀ (f : X ⟶ Y) (hf : HomotopicalAlgebra.RelativeCellComplex (fun x => I.homFamily) f), CategoryTheory.Limits.PreservesColimit hf.F (CategoryTheory.coyoneda.obj (Opposite.op A)) - CategoryTheory.MorphismProperty.IsCardinalForSmallObjectArgument.mk 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] {I : CategoryTheory.MorphismProperty C} {κ : Cardinal.{w}} [Fact κ.IsRegular] [OrderBot κ.ord.ToType] (isSmall : CategoryTheory.MorphismProperty.IsSmall.{w, v, u} I := by infer_instance) (locallySmall : CategoryTheory.LocallySmall.{w, v, u} C := by infer_instance) (hasPushouts : CategoryTheory.Limits.HasPushouts C := by infer_instance) (hasCoproducts : CategoryTheory.Limits.HasCoproducts C := by infer_instance) (hasIterationOfShape : CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C := by infer_instance) (preservesColimit : ∀ {A B X Y : C} (i : A ⟶ B), I i → ∀ (f : X ⟶ Y) (hf : HomotopicalAlgebra.RelativeCellComplex (fun x => I.homFamily) f), CategoryTheory.Limits.PreservesColimit hf.F (CategoryTheory.coyoneda.obj (Opposite.op A))) : I.IsCardinalForSmallObjectArgument κ - CategoryTheory.SmallObject.iterationFunctorObjObjRightIso_ιIteration_app_right_assoc 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) {Z : C} (h : ((CategoryTheory.SmallObject.iteration I κ).obj f).right ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.iterationFunctorObjObjRightIso I κ f j).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right ((CategoryTheory.SmallObject.ιIteration I κ).app f)) h) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.transfiniteCompositionOfShapeιIterationAppRight I κ f).incl.app j) h - CategoryTheory.SmallObject.iterationFunctorObjObjRightIso_ιIteration_app_right 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) : CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.iterationFunctorObjObjRightIso I κ f j).hom (CategoryTheory.Arrow.Hom.right ((CategoryTheory.SmallObject.ιIteration I κ).app f)) = (CategoryTheory.SmallObject.transfiniteCompositionOfShapeιIterationAppRight I κ f).incl.app j - CategoryTheory.SmallObject.relativeCellComplexιObjFObjSuccIso 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) (j : κ.ord.ToType) : (CategoryTheory.SmallObject.relativeCellComplexιObj I κ f).F.obj (Order.succ j) ≅ CategoryTheory.SmallObject.functorObj I.homFamily (((CategoryTheory.SmallObject.iterationFunctor I κ).obj j).obj (CategoryTheory.Arrow.mk f)).hom - CategoryTheory.SmallObject.ιFunctorObj_eq 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) (j : κ.ord.ToType) : CategoryTheory.SmallObject.ιFunctorObj I.homFamily (((CategoryTheory.SmallObject.iterationFunctor I κ).obj j).obj (CategoryTheory.Arrow.mk f)).hom = CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.relativeCellComplexιObj I κ f).F.map (CategoryTheory.homOfLE ⋯)) (CategoryTheory.SmallObject.relativeCellComplexιObjFObjSuccIso I κ f j).hom - CategoryTheory.SmallObject.πFunctorObj_eq 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) (j : κ.ord.ToType) : CategoryTheory.SmallObject.πFunctorObj I.homFamily (((CategoryTheory.SmallObject.iterationFunctor I κ).obj j).obj (CategoryTheory.Arrow.mk f)).hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.relativeCellComplexιObjFObjSuccIso I κ f j).inv (CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.relativeCellComplexιObj I κ f).incl.app (Order.succ j)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.πObj I κ f) (CategoryTheory.SmallObject.iterationFunctorObjObjRightIso I κ (CategoryTheory.Arrow.mk f) j).inv)) - SSet.relativeCellComplexOfMono_F 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) [CategoryTheory.Mono i] : (SSet.relativeCellComplexOfMono i).F = ⋯.functor.comp 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 69fae59