Loogle!
Result
Found 39 declarations mentioning CategoryTheory.TransfiniteCompositionOfShape.
- CategoryTheory.TransfiniteCompositionOfShape π 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] : Type (max (max u v) w) - 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.ofArrowIso π 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') : CategoryTheory.TransfiniteCompositionOfShape J f' - 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.map π 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] : CategoryTheory.TransfiniteCompositionOfShape J (F.map f) - 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.ofOrderIso π 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) : CategoryTheory.TransfiniteCompositionOfShape J' f - 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.ofComposableArrows π Mathlib.CategoryTheory.Limits.Shapes.Preorder.TransfiniteCompositionOfShape
{C : Type u} [CategoryTheory.Category.{v, u} C] {n : β} (G : CategoryTheory.ComposableArrows C n) : CategoryTheory.TransfiniteCompositionOfShape (Fin (n + 1)) G.hom - 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.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.mk π 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] (F : CategoryTheory.Functor J C) (isoBot : F.obj β₯ β X) (isWellOrderContinuous : F.IsWellOrderContinuous := by infer_instance) (incl : F βΆ (CategoryTheory.Functor.const J).obj Y) (isColimit : CategoryTheory.Limits.IsColimit { pt := Y, ΞΉ := incl }) (fac : CategoryTheory.CategoryStruct.comp isoBot.inv (incl.app β₯) = f := by cat_disch) : CategoryTheory.TransfiniteCompositionOfShape J f - 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.toTransfiniteCompositionOfShape π 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) : CategoryTheory.TransfiniteCompositionOfShape J f - CategoryTheory.MorphismProperty.TransfiniteCompositionOfShape.ofArrowIso_toTransfiniteCompositionOfShape π 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) {X' Y' : C} {f' : X' βΆ Y'} (e : CategoryTheory.Arrow.mk f β CategoryTheory.Arrow.mk f') : (h.ofArrowIso e).toTransfiniteCompositionOfShape = h.ofArrowIso e - CategoryTheory.MorphismProperty.TransfiniteCompositionOfShape.ofLE_toTransfiniteCompositionOfShape π 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) {W' : CategoryTheory.MorphismProperty C} (hW : W β€ W') : (h.ofLE hW).toTransfiniteCompositionOfShape = h.toTransfiniteCompositionOfShape - CategoryTheory.MorphismProperty.TransfiniteCompositionOfShape.map_toTransfiniteCompositionOfShape π Mathlib.CategoryTheory.MorphismProperty.TransfiniteComposition
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u'} [CategoryTheory.Category.{v', u'} D] {J : Type w} [LinearOrder J] [SuccOrder J] [OrderBot J] [WellFoundedLT J] {X Y : C} {f : X βΆ Y} {W : CategoryTheory.MorphismProperty D} {F : CategoryTheory.Functor C D} [CategoryTheory.Limits.PreservesWellOrderContinuousOfShape J F] [CategoryTheory.Limits.PreservesColimitsOfShape J F] (h : (W.inverseImage F).TransfiniteCompositionOfShape J f) : h.map.toTransfiniteCompositionOfShape = h.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 - HomotopicalAlgebra.RelativeCellComplex.toTransfiniteCompositionOfShape π 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) : CategoryTheory.TransfiniteCompositionOfShape J f - HomotopicalAlgebra.RelativeCellComplex.transfiniteCompositionOfShape_toTransfiniteCompositionOfShape π Mathlib.AlgebraicTopology.RelativeCellComplex.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w'} [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] {X Y : C} {f : X βΆ Y} {Ξ± : Type u_1} {A B : Ξ± β C} (g : (i : Ξ±) β A i βΆ B i) (c : HomotopicalAlgebra.RelativeCellComplex (fun x => g) f) : (HomotopicalAlgebra.RelativeCellComplex.transfiniteCompositionOfShape g c).toTransfiniteCompositionOfShape = c.toTransfiniteCompositionOfShape - HomotopicalAlgebra.RelativeCellComplex.transfiniteCompositionOfShape'_toTransfiniteCompositionOfShape π 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) {I : CategoryTheory.MorphismProperty C} (hc : β (s : c.Cells), I (basicCell s.j s.i)) : (c.transfiniteCompositionOfShape' hc).toTransfiniteCompositionOfShape = c.toTransfiniteCompositionOfShape - 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
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