Loogle!
Result
Found 383 declarations mentioning SimplexCategory.Truncated. Of these, only the first 200 are shown.
- SimplexCategory.Truncated π Mathlib.AlgebraicTopology.SimplexCategory.Defs
(n : β) : Type - SimplexCategory.Truncated.instInhabited π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{n : β} : Inhabited (SimplexCategory.Truncated n) - SimplexCategory.Truncated.inclusion π Mathlib.AlgebraicTopology.SimplexCategory.Defs
(n : β) : CategoryTheory.Functor (SimplexCategory.Truncated n) SimplexCategory - SimplexCategory.Truncated.incl π Mathlib.AlgebraicTopology.SimplexCategory.Defs
(n m : β) (h : n β€ m := by lia) : CategoryTheory.Functor (SimplexCategory.Truncated n) (SimplexCategory.Truncated m) - SimplexCategory.Truncated.inclusion.fullyFaithful π Mathlib.AlgebraicTopology.SimplexCategory.Defs
(n : β) : (SimplexCategory.Truncated.inclusion n).op.FullyFaithful - SimplexCategory.Truncated.inclCompInclusion π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{n m : β} (h : n β€ m) : (SimplexCategory.Truncated.incl n m β―).comp (SimplexCategory.Truncated.inclusion m) β SimplexCategory.Truncated.inclusion n - SimplexCategory.Truncated.Hom.ext π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{n : β} {a b : SimplexCategory.Truncated n} (f g : a βΆ b) (h : SimplexCategory.Hom.toOrderHom f.hom = SimplexCategory.Hom.toOrderHom g.hom) : f = g - SimplexCategory.Truncated.Hom.ext_iff π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{n : β} {a b : SimplexCategory.Truncated n} {f g : a βΆ b} : f = g β SimplexCategory.Hom.toOrderHom f.hom = SimplexCategory.Hom.toOrderHom g.hom - CategoryTheory.SimplicialObject.truncation π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) : CategoryTheory.Functor (CategoryTheory.SimplicialObject C) (CategoryTheory.SimplicialObject.Truncated C n) - CategoryTheory.SimplicialObject.Truncated.trunc π Mathlib.AlgebraicTopology.SimplicialObject.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] (n m : β) (h : m β€ n := by lia) : CategoryTheory.Functor (CategoryTheory.SimplicialObject.Truncated C n) (CategoryTheory.SimplicialObject.Truncated C m) - CategoryTheory.SimplicialObject.cosk π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasRightKanExtension F] : CategoryTheory.Functor (CategoryTheory.SimplicialObject C) (CategoryTheory.SimplicialObject C) - CategoryTheory.SimplicialObject.sk π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasLeftKanExtension F] : CategoryTheory.Functor (CategoryTheory.SimplicialObject C) (CategoryTheory.SimplicialObject C) - CategoryTheory.SimplicialObject.Truncated.cosk π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasRightKanExtension F] : CategoryTheory.Functor (CategoryTheory.SimplicialObject.Truncated C n) (CategoryTheory.SimplicialObject C) - CategoryTheory.SimplicialObject.Truncated.sk π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasLeftKanExtension F] : CategoryTheory.Functor (CategoryTheory.SimplicialObject.Truncated C n) (CategoryTheory.SimplicialObject C) - CategoryTheory.SimplicialObject.coskAdj π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasRightKanExtension F] : CategoryTheory.SimplicialObject.truncation n β£ CategoryTheory.SimplicialObject.Truncated.cosk n - CategoryTheory.SimplicialObject.skAdj π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasLeftKanExtension F] : CategoryTheory.SimplicialObject.Truncated.sk n β£ CategoryTheory.SimplicialObject.truncation n - CategoryTheory.SimplicialObject.Truncated.whiskering π Mathlib.AlgebraicTopology.SimplicialObject.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] {n : β} (D : Type u_1) [CategoryTheory.Category.{v_1, u_1} D] : CategoryTheory.Functor (CategoryTheory.Functor C D) (CategoryTheory.Functor (CategoryTheory.SimplicialObject.Truncated C n) (CategoryTheory.SimplicialObject.Truncated D n)) - CategoryTheory.SimplicialObject.truncationCompTrunc π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {n m : β} (h : m β€ n) : (CategoryTheory.SimplicialObject.truncation n).comp (CategoryTheory.SimplicialObject.Truncated.trunc C n m β―) β CategoryTheory.SimplicialObject.truncation m - CategoryTheory.SimplicialObject.Truncated.cosk.faithful π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasRightKanExtension F] [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasPointwiseRightKanExtension F] : (CategoryTheory.SimplicialObject.Truncated.cosk n).Faithful - CategoryTheory.SimplicialObject.Truncated.cosk.full π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasRightKanExtension F] [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasPointwiseRightKanExtension F] : (CategoryTheory.SimplicialObject.Truncated.cosk n).Full - CategoryTheory.SimplicialObject.Truncated.cosk.fullyFaithful π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasRightKanExtension F] [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasPointwiseRightKanExtension F] : (CategoryTheory.SimplicialObject.Truncated.cosk n).FullyFaithful - CategoryTheory.SimplicialObject.Truncated.coskAdj.reflective π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasRightKanExtension F] [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasPointwiseRightKanExtension F] : CategoryTheory.Reflective (CategoryTheory.SimplicialObject.Truncated.cosk n) - CategoryTheory.SimplicialObject.Truncated.sk.faithful π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasLeftKanExtension F] [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasPointwiseLeftKanExtension F] : (CategoryTheory.SimplicialObject.Truncated.sk n).Faithful - CategoryTheory.SimplicialObject.Truncated.sk.full π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasLeftKanExtension F] [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasPointwiseLeftKanExtension F] : (CategoryTheory.SimplicialObject.Truncated.sk n).Full - CategoryTheory.SimplicialObject.Truncated.sk.fullyFaithful π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasLeftKanExtension F] [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasPointwiseLeftKanExtension F] : (CategoryTheory.SimplicialObject.Truncated.sk n).FullyFaithful - CategoryTheory.SimplicialObject.Truncated.skAdj.coreflective π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasLeftKanExtension F] [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasPointwiseLeftKanExtension F] : CategoryTheory.Coreflective (CategoryTheory.SimplicialObject.Truncated.sk n) - CategoryTheory.SimplicialObject.Truncated.trunc_obj_obj π Mathlib.AlgebraicTopology.SimplicialObject.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] (n m : β) (h : m β€ n := by lia) (G : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C) (X : (SimplexCategory.Truncated m)α΅α΅) : ((CategoryTheory.SimplicialObject.Truncated.trunc C n m h).obj G).obj X = G.obj (Opposite.op ((SimplexCategory.Truncated.incl m n β―).obj (Opposite.unop X))) - CategoryTheory.SimplicialObject.Truncated.cosk_reflective π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasRightKanExtension F] [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasPointwiseRightKanExtension F] : CategoryTheory.IsIso (CategoryTheory.SimplicialObject.coskAdj n).counit - CategoryTheory.SimplicialObject.Truncated.sk_coreflective π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasLeftKanExtension F] [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasPointwiseLeftKanExtension F] : CategoryTheory.IsIso (CategoryTheory.SimplicialObject.skAdj n).unit - CategoryTheory.SimplicialObject.instIsLeftKanExtensionOppositeTruncatedSimplexCategoryObjSkAppTruncatedUnitSkAdjTruncation π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.SimplicialObject C) (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasLeftKanExtension F] : CategoryTheory.Functor.IsLeftKanExtension ((CategoryTheory.SimplicialObject.sk n).obj X) ((CategoryTheory.SimplicialObject.skAdj n).unit.app ((CategoryTheory.SimplicialObject.truncation n).obj X)) - CategoryTheory.SimplicialObject.instIsRightKanExtensionOppositeTruncatedSimplexCategoryObjCoskAppTruncatedCounitCoskAdjTruncation π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.SimplicialObject C) (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasRightKanExtension F] : CategoryTheory.Functor.IsRightKanExtension ((CategoryTheory.SimplicialObject.cosk n).obj X) ((CategoryTheory.SimplicialObject.coskAdj n).counit.app ((CategoryTheory.SimplicialObject.truncation n).obj X)) - CategoryTheory.SimplicialObject.Truncated.trunc_map_app π Mathlib.AlgebraicTopology.SimplicialObject.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] (n m : β) (h : m β€ n := by lia) {Xβ Yβ : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C} (Ξ± : Xβ βΆ Yβ) (X : (SimplexCategory.Truncated m)α΅α΅) : ((CategoryTheory.SimplicialObject.Truncated.trunc C n m h).map Ξ±).app X = Ξ±.app (Opposite.op ((SimplexCategory.Truncated.incl m n β―).obj (Opposite.unop X))) - CategoryTheory.SimplicialObject.Truncated.trunc_obj_map π Mathlib.AlgebraicTopology.SimplicialObject.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] (n m : β) (h : m β€ n := by lia) (G : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C) {Xβ Yβ : (SimplexCategory.Truncated m)α΅α΅} (f : Xβ βΆ Yβ) : ((CategoryTheory.SimplicialObject.Truncated.trunc C n m h).obj G).map f = G.map (CategoryTheory.ObjectProperty.homMk f.unop.hom).op - SSet.truncation π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : β) : CategoryTheory.Functor SSet (SSet.Truncated n) - SSet.Truncated.cosk π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : β) : CategoryTheory.Functor (SSet.Truncated n) SSet - SSet.Truncated.sk π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : β) : CategoryTheory.Functor (SSet.Truncated n) SSet - SSet.Truncated.cosk.faithful π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : β) : (SSet.Truncated.cosk n).Faithful - SSet.Truncated.cosk.full π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : β) : (SSet.Truncated.cosk n).Full - SSet.Truncated.cosk.fullyFaithful π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : β) : (SSet.Truncated.cosk n).FullyFaithful - SSet.Truncated.coskAdj.reflective π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : β) : CategoryTheory.Reflective (SSet.Truncated.cosk n) - SSet.Truncated.sk.faithful π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : β) : (SSet.Truncated.sk n).Faithful - SSet.Truncated.sk.full π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : β) : (SSet.Truncated.sk n).Full - SSet.Truncated.sk.fullyFaithful π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : β) : (SSet.Truncated.sk n).FullyFaithful - SSet.Truncated.skAdj.coreflective π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : β) : CategoryTheory.Coreflective (SSet.Truncated.sk n) - SSet.coskAdj π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : β) : SSet.truncation n β£ SSet.Truncated.cosk n - SSet.skAdj π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : β) : SSet.Truncated.sk n β£ SSet.truncation n - SSet.Truncated.uliftFunctor π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(k : β) : CategoryTheory.Functor (SSet.Truncated k) (SSet.Truncated k) - SSet.Truncated.trunc π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n m : β) (h : m β€ n := by lia) : CategoryTheory.Functor (SSet.Truncated n) (SSet.Truncated m) - SSet.Truncated.id_app π Mathlib.AlgebraicTopology.SimplicialSet.Basic
{n : β} (X : SSet.Truncated n) (d : (SimplexCategory.Truncated n)α΅α΅) : (CategoryTheory.CategoryStruct.id X).app d = CategoryTheory.CategoryStruct.id (X.obj d) - SSet.truncationCompTrunc π Mathlib.AlgebraicTopology.SimplicialSet.Basic
{n m : β} (h : m β€ n) : (SSet.truncation n).comp (SSet.Truncated.trunc n m β―) β SSet.truncation m - SSet.Truncated.hom_ext π Mathlib.AlgebraicTopology.SimplicialSet.Basic
{n : β} {X Y : SSet.Truncated n} {f g : X βΆ Y} (w : β (n_1 : (SimplexCategory.Truncated n)α΅α΅), f.app n_1 = g.app n_1) : f = g - SSet.Truncated.hom_ext_iff π Mathlib.AlgebraicTopology.SimplicialSet.Basic
{n : β} {X Y : SSet.Truncated n} {f g : X βΆ Y} : f = g β β (n_1 : (SimplexCategory.Truncated n)α΅α΅), f.app n_1 = g.app n_1 - SSet.Truncated.cosk_reflective π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : β) : CategoryTheory.IsIso (SSet.coskAdj n).counit - SSet.Truncated.sk_coreflective π Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : β) : CategoryTheory.IsIso (SSet.skAdj n).unit - SSet.Truncated.comp_app π Mathlib.AlgebraicTopology.SimplicialSet.Basic
{n : β} {X Y Z : SSet.Truncated n} (f : X βΆ Y) (g : Y βΆ Z) (d : (SimplexCategory.Truncated n)α΅α΅) : (CategoryTheory.CategoryStruct.comp f g).app d = CategoryTheory.CategoryStruct.comp (f.app d) (g.app d) - SSet.Truncated.comp_app_assoc π Mathlib.AlgebraicTopology.SimplicialSet.Basic
{n : β} {X Y Z : SSet.Truncated n} (f : X βΆ Y) (g : Y βΆ Z) (d : (SimplexCategory.Truncated n)α΅α΅) {Zβ : Type u_1} (h : Z.obj d βΆ Zβ) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.CategoryStruct.comp f g).app d) h = CategoryTheory.CategoryStruct.comp (f.app d) (CategoryTheory.CategoryStruct.comp (g.app d) h) - SimplexCategory.Truncated.initial_inclusion π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
{n : β} [NeZero n] : (SimplexCategory.Truncated.inclusion n).Initial - SimplexCategory.Truncated.instDecidableEqHom π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
{d : β} {n m : SimplexCategory.Truncated d} : DecidableEq (n βΆ m) - SimplexCategory.Truncated.initial_incl π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
{n m : β} [NeZero n] (hm : n β€ m) : (SimplexCategory.Truncated.incl n m β―).Initial - SSet.Truncated.Edge.id π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} (x : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })) : SSet.Truncated.Edge x x - SSet.Truncated.Edge.CompStruct.idCompId π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} (x : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })) : (SSet.Truncated.Edge.id x).CompStruct (SSet.Truncated.Edge.id x) (SSet.Truncated.Edge.id x) - SSet.Truncated.Edge π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} (xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })) : Type u - SSet.Truncated.Edge.CompStruct.compId π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {x y : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} (e : SSet.Truncated.Edge x y) : e.CompStruct (SSet.Truncated.Edge.id y) e - SSet.Truncated.Edge.CompStruct.idComp π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {x y : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} (e : SSet.Truncated.Edge x y) : (SSet.Truncated.Edge.id x).CompStruct e e - SSet.Truncated.Edge.edge π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} (self : SSet.Truncated.Edge xβ xβ) : X.obj (Opposite.op { obj := { len := 1 }, property := SSet.Truncated.Edge._proof_2 }) - SSet.Truncated.Edge.instSubsingleton π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} [Subsingleton (X.obj (Opposite.op { obj := { len := 1 }, property := SSet.Truncated.Edge._proof_2 }))] {x y : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} : Subsingleton (SSet.Truncated.Edge x y) - SSet.Truncated.Edge.CompStruct π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {xβ xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} (eββ : SSet.Truncated.Edge xβ xβ) (eββ : SSet.Truncated.Edge xβ xβ) (eββ : SSet.Truncated.Edge xβ xβ) : Type u - SSet.Truncated.Edge.ext π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {x y : SSet.Truncated.Edge xβ xβ} (edge : x.edge = y.edge) : x = y - SSet.Truncated.Edge.ext_iff π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {x y : SSet.Truncated.Edge xβ xβ} : x = y β x.edge = y.edge - SSet.Truncated.Edge.CompStruct.simplex π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {xβ xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} (self : eββ.CompStruct eββ eββ) : X.obj (Opposite.op { obj := { len := 2 }, property := SSet.Truncated.Edge.CompStruct._proof_1 }) - SSet.Truncated.Edge.CompStruct.ext π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {xβ xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} {x y : eββ.CompStruct eββ eββ} (simplex : x.simplex = y.simplex) : x = y - SSet.Truncated.Edge.CompStruct.ext_iff π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {xβ xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} {x y : eββ.CompStruct eββ eββ} : x = y β x.simplex = y.simplex - SSet.Truncated.Edge.exists_of_simplex π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} (s : X.obj (Opposite.op { obj := { len := 1 }, property := SSet.Truncated.Edge._proof_2 })) : β xβ xβ e, e.edge = s - SSet.Truncated.Edge.CompStruct.exists_of_simplex π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} (s : X.obj (Opposite.op { obj := { len := 2 }, property := SSet.Truncated.Edge.CompStruct._proof_1 })) : β xβ xβ xβ eββ eββ eββ h, h.simplex = s - SSet.Truncated.Edge.id_edge π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} (x : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })) : (SSet.Truncated.Edge.id x).edge = (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Οβ 0 SSet.Truncated.Edge._proof_3 SSet.Truncated.Edge._proof_1).op)) x - SSet.Truncated.Edge.src_eq π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} (self : SSet.Truncated.Edge xβ xβ) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Ξ΄β 1 SSet.Truncated.Edge._proof_1 SSet.Truncated.Edge._proof_3).op)) self.edge = xβ - SSet.Truncated.Edge.tgt_eq π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} (self : SSet.Truncated.Edge xβ xβ) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Ξ΄β 0 SSet.Truncated.Edge._proof_1 SSet.Truncated.Edge._proof_3).op)) self.edge = xβ - SSet.Truncated.Edge.CompStruct.dβ π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {xβ xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} (self : eββ.CompStruct eββ eββ) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Ξ΄β 0 SSet.Truncated.Edge._proof_2 SSet.Truncated.Edge.CompStruct._proof_2).op)) self.simplex = eββ.edge - SSet.Truncated.Edge.CompStruct.dβ π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {xβ xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} (self : eββ.CompStruct eββ eββ) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Ξ΄β 1 SSet.Truncated.Edge._proof_2 SSet.Truncated.Edge.CompStruct._proof_2).op)) self.simplex = eββ.edge - SSet.Truncated.Edge.CompStruct.dβ π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {xβ xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} (self : eββ.CompStruct eββ eββ) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Ξ΄β 2 SSet.Truncated.Edge._proof_2 SSet.Truncated.Edge.CompStruct._proof_2).op)) self.simplex = eββ.edge - SSet.Truncated.Edge.map π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X Y : SSet.Truncated 2} {xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} (e : SSet.Truncated.Edge xβ xβ) (f : X βΆ Y) : SSet.Truncated.Edge ((CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 }))) xβ) ((CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 }))) xβ) - SSet.Truncated.Edge.map_id π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X Y : SSet.Truncated 2} (x : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })) (f : X βΆ Y) : (SSet.Truncated.Edge.id x).map f = SSet.Truncated.Edge.id ((CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 }))) x) - SSet.Truncated.Edge.mk' π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} (s : X.obj (Opposite.op { obj := { len := 1 }, property := SSet.Truncated.Edge._proof_2 })) : SSet.Truncated.Edge ((CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Ξ΄β 1 SSet.Truncated.Edge._proof_1 SSet.Truncated.Edge._proof_3).op)) s) ((CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Ξ΄β 0 SSet.Truncated.Edge._proof_1 SSet.Truncated.Edge._proof_3).op)) s) - SSet.Truncated.Edge.CompStruct.idCompId_simplex π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} (x : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })) : (SSet.Truncated.Edge.CompStruct.idCompId x).simplex = (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Οβ 0 SSet.Truncated.Edge.CompStruct._proof_2 SSet.Truncated.Edge._proof_2).op)) ((CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Οβ 0 SSet.Truncated.Edge._proof_3 SSet.Truncated.Edge._proof_1).op)) x) - SSet.Truncated.Edge.mk'_edge π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} (s : X.obj (Opposite.op { obj := { len := 1 }, property := SSet.Truncated.Edge._proof_2 })) : (SSet.Truncated.Edge.mk' s).edge = s - SSet.Truncated.Edge.map_edge π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X Y : SSet.Truncated 2} {xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} (e : SSet.Truncated.Edge xβ xβ) (f : X βΆ Y) : (e.map f).edge = (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { obj := { len := 1 }, property := SSet.Truncated.Edge._proof_2 }))) e.edge - SSet.Truncated.Edge.CompStruct.map π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X Y : SSet.Truncated 2} {xβ xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} (h : eββ.CompStruct eββ eββ) (f : X βΆ Y) : (eββ.map f).CompStruct (eββ.map f) (eββ.map f) - SSet.Truncated.Edge.mk π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} (edge : X.obj (Opposite.op { obj := { len := 1 }, property := SSet.Truncated.Edge._proof_2 })) (src_eq : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Ξ΄β 1 SSet.Truncated.Edge._proof_1 SSet.Truncated.Edge._proof_3).op)) edge = xβ := by cat_disch) (tgt_eq : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Ξ΄β 0 SSet.Truncated.Edge._proof_1 SSet.Truncated.Edge._proof_3).op)) edge = xβ := by cat_disch) : SSet.Truncated.Edge xβ xβ - SSet.Truncated.Edge.CompStruct.map_simplex π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X Y : SSet.Truncated 2} {xβ xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} (h : eββ.CompStruct eββ eββ) (f : X βΆ Y) : (h.map f).simplex = (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { obj := { len := 2 }, property := SSet.Truncated.Edge.CompStruct._proof_1 }))) h.simplex - SSet.Truncated.Edge.CompStruct.mk π Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {xβ xβ xβ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} {eββ : SSet.Truncated.Edge xβ xβ} (simplex : X.obj (Opposite.op { obj := { len := 2 }, property := SSet.Truncated.Edge.CompStruct._proof_1 })) (dβ : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Ξ΄β 2 SSet.Truncated.Edge._proof_2 SSet.Truncated.Edge.CompStruct._proof_2).op)) simplex = eββ.edge := by cat_disch) (dβ : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Ξ΄β 0 SSet.Truncated.Edge._proof_2 SSet.Truncated.Edge.CompStruct._proof_2).op)) simplex = eββ.edge := by cat_disch) (dβ : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Ξ΄β 1 SSet.Truncated.Edge._proof_2 SSet.Truncated.Edge.CompStruct._proof_2).op)) simplex = eββ.edge := by cat_disch) : eββ.CompStruct eββ eββ - SSet.Edge.ofTruncated π Mathlib.AlgebraicTopology.SimplicialSet.CompStruct
{X : SSet} {xβ xβ : X.obj (Opposite.op { len := 0 })} (e : SSet.Truncated.Edge xβ xβ) : SSet.Edge xβ xβ - SSet.Edge.toTruncated π Mathlib.AlgebraicTopology.SimplicialSet.CompStruct
{X : SSet} {xβ xβ : X.obj (Opposite.op { len := 0 })} (e : SSet.Edge xβ xβ) : SSet.Truncated.Edge xβ xβ - SSet.Edge.toTruncated_id π Mathlib.AlgebraicTopology.SimplicialSet.CompStruct
{X : SSet} (xβ : X.obj (Opposite.op { len := 0 })) : (SSet.Edge.id xβ).toTruncated = SSet.Truncated.Edge.id xβ - SSet.Edge.CompStruct.ofTruncated π Mathlib.AlgebraicTopology.SimplicialSet.CompStruct
{X : SSet} {xβ xβ xβ : X.obj (Opposite.op { len := 0 })} {eββ : SSet.Edge xβ xβ} {eββ : SSet.Edge xβ xβ} {eββ : SSet.Edge xβ xβ} (h : eββ.toTruncated.CompStruct eββ.toTruncated eββ.toTruncated) : eββ.CompStruct eββ eββ - SSet.Edge.CompStruct.toTruncated π Mathlib.AlgebraicTopology.SimplicialSet.CompStruct
{X : SSet} {xβ xβ xβ : X.obj (Opposite.op { len := 0 })} {eββ : SSet.Edge xβ xβ} {eββ : SSet.Edge xβ xβ} {eββ : SSet.Edge xβ xβ} (h : eββ.CompStruct eββ eββ) : eββ.toTruncated.CompStruct eββ.toTruncated eββ.toTruncated - SSet.Edge.ofTruncated_edge π Mathlib.AlgebraicTopology.SimplicialSet.CompStruct
{X : SSet} {xβ xβ : X.obj (Opposite.op { len := 0 })} (e : SSet.Truncated.Edge xβ xβ) : (SSet.Edge.ofTruncated e).edge = e.edge - SSet.Edge.ofEq_edge π Mathlib.AlgebraicTopology.SimplicialSet.CompStruct
{X : SSet} {xβ xβ yβ yβ : X.obj (Opposite.op { len := 0 })} (e : SSet.Edge xβ xβ) (hβ : xβ = yβ) (hβ : xβ = yβ) : (e.ofEq hβ hβ).edge = e.edge - SSet.Edge.toTruncated_edge π Mathlib.AlgebraicTopology.SimplicialSet.CompStruct
{X : SSet} {xβ xβ : X.obj (Opposite.op { len := 0 })} (e : SSet.Edge xβ xβ) : e.toTruncated.edge = e.edge - SSet.Edge.CompStruct.ofEq_simplex π Mathlib.AlgebraicTopology.SimplicialSet.CompStruct
{X : SSet} {xβ xβ xβ yβ yβ yβ : X.obj (Opposite.op { len := 0 })} {eββ : SSet.Edge xβ xβ} {fββ : SSet.Edge yβ yβ} {eββ : SSet.Edge xβ xβ} {fββ : SSet.Edge yβ yβ} {eββ : SSet.Edge xβ xβ} {fββ : SSet.Edge yβ yβ} (c : eββ.CompStruct eββ eββ) (hββ : eββ.edge = fββ.edge) (hββ : eββ.edge = fββ.edge) (hββ : eββ.edge = fββ.edge) : (c.ofEq hββ hββ hββ).simplex = c.simplex - SSet.Truncated.Pathβ.arrow π Mathlib.AlgebraicTopology.SimplicialSet.Path
{X : SSet.Truncated 1} {n : β} (self : X.Pathβ n) : Fin n β X.obj (Opposite.op { obj := { len := 1 }, property := SSet.Truncated.Pathβ._proof_2 }) - SSet.Truncated.Pathβ.vertex π Mathlib.AlgebraicTopology.SimplicialSet.Path
{X : SSet.Truncated 1} {n : β} (self : X.Pathβ n) : Fin (n + 1) β X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Pathβ._proof_1 }) - SSet.Truncated.Path.arrow π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} {X : SSet.Truncated (n + 1)} {m : β} (f : X.Path m) (i : Fin m) : X.obj (Opposite.op { obj := { len := 1 }, property := β― }) - SSet.Truncated.spine π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} (X : SSet.Truncated (n + 1)) (m : β) (h : m β€ n + 1 := by omega) (Ξ : X.obj (Opposite.op { obj := { len := m }, property := h })) : X.Path m - SSet.Truncated.Path.vertex π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} {X : SSet.Truncated (n + 1)} {m : β} (f : X.Path m) (i : Fin (m + 1)) : X.obj (Opposite.op { obj := { len := 0 }, property := β― }) - SSet.Truncated.Path.map π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} {X Y : SSet.Truncated (n + 1)} {m : β} (f : X.Path m) (Ο : X βΆ Y) : Y.Path m - SSet.Truncated.Pathβ.ext π Mathlib.AlgebraicTopology.SimplicialSet.Path
{X : SSet.Truncated 1} {n : β} {x y : X.Pathβ n} (vertex : x.vertex = y.vertex) (arrow : x.arrow = y.arrow) : x = y - SSet.Truncated.Pathβ.ext_iff π Mathlib.AlgebraicTopology.SimplicialSet.Path
{X : SSet.Truncated 1} {n : β} {x y : X.Pathβ n} : x = y β x.vertex = y.vertex β§ x.arrow = y.arrow - SSet.Truncated.Path.map_interval π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} {X Y : SSet.Truncated (n + 1)} {m : β} (f : X.Path m) (Ο : X βΆ Y) (j l : β) (h : j + l β€ m) : (f.map Ο).interval j l h = (f.interval j l h).map Ο - SSet.Truncated.Path.ext' π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} {X : SSet.Truncated (n + 1)} {m : β} {f g : X.Path (m + 1)} (h : β (i : Fin (m + 1)), f.arrow i = g.arrow i) : f = g - SSet.Truncated.Path.ext'_iff π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} {X : SSet.Truncated (n + 1)} {m : β} {f g : X.Path (m + 1)} : f = g β β (i : Fin (m + 1)), f.arrow i = g.arrow i - SSet.Truncated.Path.ext π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} {X : SSet.Truncated (n + 1)} {m : β} {f g : X.Path m} (hα΅₯ : f.vertex = g.vertex) (hβ : f.arrow = g.arrow) : f = g - SSet.Truncated.Path.mkβ π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} {X : SSet.Truncated (n + 1)} (p q : X.Path 1) (h : p.vertex 1 = q.vertex 0) : X.Path 2 - SSet.Truncated.Path.ext_iff π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} {X : SSet.Truncated (n + 1)} {m : β} {f g : X.Path m} : f = g β f.vertex = g.vertex β§ f.arrow = g.arrow - SSet.truncation_spine π Mathlib.AlgebraicTopology.SimplicialSet.Path
(X : SSet) (n m : β) (h : m β€ n + 1) : ((SSet.truncation (n + 1)).obj X).spine m h = X.spine m - SSet.Truncated.trunc_spine π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} (X : SSet.Truncated (n + 1)) (k m : β) (h : m β€ k + 1) (hβ : k β€ n) : ((SSet.Truncated.trunc (n + 1) (k + 1) β―).obj X).spine m h = X.spine m β― - SSet.Truncated.Pathβ.arrow_src π Mathlib.AlgebraicTopology.SimplicialSet.Path
{X : SSet.Truncated 1} {n : β} (self : X.Pathβ n) (i : Fin n) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.Ξ΄ 1) SSet.Truncated.Pathβ._proof_1 SSet.Truncated.Pathβ._proof_5).op)) (self.arrow i) = self.vertex i.castSucc - SSet.Truncated.Pathβ.arrow_tgt π Mathlib.AlgebraicTopology.SimplicialSet.Path
{X : SSet.Truncated 1} {n : β} (self : X.Pathβ n) (i : Fin n) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.Ξ΄ 0) SSet.Truncated.Pathβ._proof_1 SSet.Truncated.Pathβ._proof_5).op)) (self.arrow i) = self.vertex i.succ - SSet.Truncated.Path.map_arrow π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} {X Y : SSet.Truncated (n + 1)} {m : β} (f : X.Path m) (Ο : X βΆ Y) (i : Fin m) : (f.map Ο).arrow i = (CategoryTheory.ConcreteCategory.hom (Ο.app (Opposite.op { obj := { len := 1 }, property := β― }))) (f.arrow i) - SSet.Truncated.Path.mkβ_arrow π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} {X : SSet.Truncated (n + 1)} (p q : X.Path 1) (h : p.vertex 1 = q.vertex 0) (aβ : Fin (Nat.succ 1)) : (p.mkβ q h).arrow aβ = ![p.arrow 0, q.arrow 0] aβ - SSet.Truncated.Path.map_vertex π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} {X Y : SSet.Truncated (n + 1)} {m : β} (f : X.Path m) (Ο : X βΆ Y) (i : Fin (m + 1)) : (f.map Ο).vertex i = (CategoryTheory.ConcreteCategory.hom (Ο.app (Opposite.op { obj := { len := 0 }, property := β― }))) (f.vertex i) - SSet.Truncated.spine_map_subinterval π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} (X : SSet.Truncated (n + 1)) (m : β) (hβ : m β€ n + 1) (j l : β) (h : j + l β€ m) (Ξ : X.obj (Opposite.op { obj := { len := m }, property := hβ })) : X.spine l β― ((CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.subinterval j l h) β― hβ).op)) Ξ) = (X.spine m hβ Ξ).interval j l h - SSet.Truncated.spine_arrow π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} (X : SSet.Truncated (n + 1)) (m : β) (hβ : m β€ n + 1) (Ξ : X.obj (Opposite.op { obj := { len := m }, property := hβ })) (i : Fin m) : (X.spine m hβ Ξ).arrow i = (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.mkOfSucc i) β― hβ).op)) Ξ - SSet.Truncated.spine_vertex π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} (X : SSet.Truncated (n + 1)) (m : β) (hβ : m β€ n + 1) (Ξ : X.obj (Opposite.op { obj := { len := m }, property := hβ })) (i : Fin (m + 1)) : (X.spine m hβ Ξ).vertex i = (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr ({ len := 0 }.const { len := m } i) β― hβ).op)) Ξ - SSet.Truncated.Path.mkβ_vertex π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} {X : SSet.Truncated (n + 1)} (p q : X.Path 1) (h : p.vertex 1 = q.vertex 0) (aβ : Fin (Nat.succ 2)) : (p.mkβ q h).vertex aβ = ![p.vertex 0, p.vertex 1, q.vertex 1] aβ - SSet.Truncated.Path.arrow_src π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} {X : SSet.Truncated (n + 1)} {m : β} (f : X.Path m) (i : Fin m) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.Ξ΄ 1) β― β―).op)) (f.arrow i) = f.vertex i.castSucc - SSet.Truncated.Path.arrow_tgt π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} {X : SSet.Truncated (n + 1)} {m : β} (f : X.Path m) (i : Fin m) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.Ξ΄ 0) β― β―).op)) (f.arrow i) = f.vertex i.succ - SSet.Subcomplex.liftPath_arrow_coe π Mathlib.AlgebraicTopology.SimplicialSet.Path
{X : SSet} (A : X.Subcomplex) {n : β} (p : X.Path n) (hpβ : β (j : Fin (n + 1)), p.vertex j β A.obj (Opposite.op { len := 0 })) (hpβ : β (j : Fin n), p.arrow j β A.obj (Opposite.op { len := 1 })) (j : Fin n) : β((A.liftPath p hpβ hpβ).arrow j) = p.arrow j - SSet.Subcomplex.liftPath_vertex_coe π Mathlib.AlgebraicTopology.SimplicialSet.Path
{X : SSet} (A : X.Subcomplex) {n : β} (p : X.Path n) (hpβ : β (j : Fin (n + 1)), p.vertex j β A.obj (Opposite.op { len := 0 })) (hpβ : β (j : Fin n), p.arrow j β A.obj (Opposite.op { len := 1 })) (j : Fin (n + 1)) : β((A.liftPath p hpβ hpβ).vertex j) = p.vertex j - SSet.Truncated.Pathβ.mk π Mathlib.AlgebraicTopology.SimplicialSet.Path
{X : SSet.Truncated 1} {n : β} (vertex : Fin (n + 1) β X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Pathβ._proof_1 })) (arrow : Fin n β X.obj (Opposite.op { obj := { len := 1 }, property := SSet.Truncated.Pathβ._proof_2 })) (arrow_src : β (i : Fin n), (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.Ξ΄ 1) SSet.Truncated.Pathβ._proof_1 SSet.Truncated.Pathβ._proof_5).op)) (arrow i) = vertex i.castSucc) (arrow_tgt : β (i : Fin n), (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.Ξ΄ 0) SSet.Truncated.Pathβ._proof_1 SSet.Truncated.Pathβ._proof_5).op)) (arrow i) = vertex i.succ) : X.Pathβ n - SSet.horn.spineId_vertex_coe π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} (i : Fin (n + 3)) (hβ : 0 < i) (hβ : i < Fin.last (n + 2)) (j : Fin (n + 2 + 1)) : β((SSet.horn.spineId i hβ hβ).vertex j) = SSet.stdSimplex.const (n + 2) j (Opposite.op { len := 0 }) - SSet.horn.spineId_arrow_coe π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} (i : Fin (n + 3)) (hβ : 0 < i) (hβ : i < Fin.last (n + 2)) (j : Fin (n + 2)) : β((SSet.horn.spineId i hβ hβ).arrow j) = (SSet.stdSimplex.spineId (n + 2)).arrow j - SSet.Truncated.spine_map_vertex π Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : β} (X : SSet.Truncated (n + 1)) (m : β) (hβ : m β€ n + 1) (Ξ : X.obj (Opposite.op { obj := { len := m }, property := hβ })) (a : β) (hβ : a β€ n + 1) (Ο : { obj := { len := a }, property := hβ } βΆ { obj := { len := m }, property := hβ }) (i : Fin (a + 1)) : (X.spine a hβ ((CategoryTheory.ConcreteCategory.hom (X.map Ο.op)) Ξ)).vertex i = (X.spine m hβ Ξ).vertex ((SimplexCategory.Hom.toOrderHom Ο.hom) i) - SSet.StrictSegal.instIsStrictSegalObjTruncatedHAddNatOfNatTruncationOfIsStrictSegal π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{X : SSet} [X.IsStrictSegal] (n : β) : ((SSet.truncation (n + 1)).obj X).IsStrictSegal - SSet.StrictSegal.truncation π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{X : SSet} (sx : X.StrictSegal) (n : β) : ((SSet.truncation (n + 1)).obj X).StrictSegal - SSet.Truncated.StrictSegal.spineToSimplex π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (self : X.StrictSegal) (m : β) (h : m β€ n + 1 := by lia) : X.Path m β X.obj (Opposite.op { obj := { len := m }, property := h }) - SSet.Truncated.StrictSegal.spineEquiv π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (sx : X.StrictSegal) (m : β) (h : m β€ n + 1 := by lia) : X.obj (Opposite.op { obj := { len := m }, property := h }) β X.Path m - SSet.Truncated.spine_injective π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} (X : SSet.Truncated (n + 1)) [X.IsStrictSegal] {m : β} {h : m β€ n + 1} : Function.Injective (X.spine m h) - SSet.Truncated.IsStrictSegal.mk π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (spine_bijective : β (m : β) (h : autoParam (m β€ n + 1) SSet.Truncated.IsStrictSegal._auto_1), Function.Bijective (X.spine m h)) : X.IsStrictSegal - SSet.Truncated.IsStrictSegal.spine_bijective π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} (X : SSet.Truncated (n + 1)) [self : X.IsStrictSegal] (m : β) (h : m β€ n + 1 := by grind) : Function.Bijective (X.spine m h) - SSet.Truncated.StrictSegal.spineToDiagonal π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (sx : X.StrictSegal) (m : β) (h : m β€ n + 1 := by lia) : X.Path m β X.obj (Opposite.op { obj := { len := 1 }, property := β― }) - SSet.Truncated.StrictSegal.spine_spineToSimplex π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (self : X.StrictSegal) (m : β) (h : m β€ n + 1) : X.spine m h β self.spineToSimplex m β― = id - SSet.Truncated.StrictSegal.spineToSimplex_spine_apply π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (sx : X.StrictSegal) (m : β) (h : m β€ n + 1) (Ξ : X.obj (Opposite.op { obj := { len := m }, property := h })) : sx.spineToSimplex m h (X.spine m h Ξ) = Ξ - SSet.Truncated.spine_surjective π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} (X : SSet.Truncated (n + 1)) [X.IsStrictSegal] {m : β} (p : X.Path m) (h : m β€ n + 1 := by grind) : β x, X.spine m h x = p - SSet.Truncated.StrictSegal.spineToSimplex_spine π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (self : X.StrictSegal) (m : β) (h : m β€ n + 1) : self.spineToSimplex m β― β X.spine m h = id - SSet.Truncated.StrictSegal.spineInjective π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (sx : X.StrictSegal) (m : β) (h : m β€ n + 1 := by lia) : Function.Injective β(sx.spineEquiv m h) - SSet.Truncated.StrictSegal.mk π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (spineToSimplex : (m : β) β (h : autoParam (m β€ n + 1) SSet.Truncated.StrictSegal._auto_1) β X.Path m β X.obj (Opposite.op { obj := { len := m }, property := h })) (spine_spineToSimplex : β (m : β) (h : m β€ n + 1), X.spine m h β spineToSimplex m β― = id) (spineToSimplex_spine : β (m : β) (h : m β€ n + 1), spineToSimplex m β― β X.spine m h = id) : X.StrictSegal - SSet.Truncated.StrictSegal.spineToSimplex_map π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X Y : SSet.Truncated (n + 1)} (sx : X.StrictSegal) (sy : Y.StrictSegal) (m : β) (h : m β€ n) (f : X.Path (m + 1)) (Ο : X βΆ Y) : sy.spineToSimplex (m + 1) β― (f.map Ο) = (CategoryTheory.ConcreteCategory.hom (Ο.app (Opposite.op { obj := { len := m + 1 }, property := β― }))) (sx.spineToSimplex (m + 1) β― f) - SSet.Truncated.StrictSegal.spineToSimplex_arrow π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (sx : X.StrictSegal) (m : β) (h : m β€ n + 1) (i : Fin m) (f : X.Path m) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.mkOfSucc i) β― h).op)) (sx.spineToSimplex m h f) = f.arrow i - SSet.Truncated.StrictSegal.spineToSimplex_vertex π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (sx : X.StrictSegal) (m : β) (h : m β€ n + 1) (i : Fin (m + 1)) (f : X.Path m) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr ({ len := 0 }.const { len := m } i) β― h).op)) (sx.spineToSimplex m h f) = f.vertex i - SSet.Truncated.StrictSegal.spineToSimplex_edge π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (sx : X.StrictSegal) (m : β) (h : m β€ n + 1) (f : X.Path m) (j l : β) (hjl : j + l β€ m) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.intervalEdge j l hjl) β― h).op)) (sx.spineToSimplex m h f) = sx.spineToDiagonal l β― (f.interval j l hjl) - SSet.Truncated.StrictSegal.spineToSimplex_interval π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (sx : X.StrictSegal) (m : β) (h : m β€ n + 1) (f : X.Path m) (j l : β) (hjl : j + l β€ m) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.subinterval j l hjl) β― h).op)) (sx.spineToSimplex m h f) = sx.spineToSimplex l β― (f.interval j l hjl) - SSet.Truncated.StrictSegal.spine_Ξ΄_arrow_gt π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (sx : X.StrictSegal) (m : β) (h : m β€ n) (f : X.Path (m + 1)) {i : Fin m} {j : Fin (m + 2)} (hij : j < i.succ.castSucc) : (X.spine m β― ((CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.Ξ΄ j) β― β―).op)) (sx.spineToSimplex (m + 1) β― f))).arrow i = f.arrow i.succ - SSet.Truncated.StrictSegal.spine_Ξ΄_vertex_ge π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (sx : X.StrictSegal) (m : β) (h : m β€ n) (f : X.Path (m + 1)) {i : Fin (m + 1)} {j : Fin (m + 2)} (hij : j β€ i.castSucc) : (X.spine m β― ((CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.Ξ΄ j) β― β―).op)) (sx.spineToSimplex (m + 1) β― f))).vertex i = f.vertex i.succ - SSet.Truncated.StrictSegal.spine_Ξ΄_arrow_lt π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (sx : X.StrictSegal) (m : β) (h : m β€ n) (f : X.Path (m + 1)) {i : Fin m} {j : Fin (m + 2)} (hij : i.succ.castSucc < j) : (X.spine m β― ((CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.Ξ΄ j) β― β―).op)) (sx.spineToSimplex (m + 1) β― f))).arrow i = f.arrow i.castSucc - SSet.Truncated.StrictSegal.spine_Ξ΄_vertex_lt π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} (sx : X.StrictSegal) (m : β) (h : m β€ n) (f : X.Path (m + 1)) {i : Fin (m + 1)} {j : Fin (m + 2)} (hij : i.castSucc < j) : (X.spine m β― ((CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.Ξ΄ j) β― β―).op)) (sx.spineToSimplex (m + 1) β― f))).vertex i = f.vertex i.castSucc - SSet.Truncated.StrictSegal.spine_Ξ΄_arrow_eq π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 2)} (sx : X.StrictSegal) (m : β) (h : m β€ n + 1) (f : X.Path (m + 1)) {i : Fin m} {j : Fin (m + 2)} (hij : j = i.succ.castSucc) : (X.spine m β― ((CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.Ξ΄ j) β― β―).op)) (sx.spineToSimplex (m + 1) β― f))).arrow i = sx.spineToDiagonal 2 β― (f.interval (βi) 2 β―) - SSet.Truncated.IsStrictSegal.hom_ext π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X Y : SSet.Truncated (n + 1)} [Y.IsStrictSegal] {f g : X βΆ Y} (h : β (x : X.obj (Opposite.op { obj := { len := 1 }, property := β― })), (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { obj := { len := 1 }, property := β― }))) x = (CategoryTheory.ConcreteCategory.hom (g.app (Opposite.op { obj := { len := 1 }, property := β― }))) x) : f = g - SSet.Truncated.IsStrictSegal.ext π Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal
{n : β} {X : SSet.Truncated (n + 1)} [X.IsStrictSegal] {d : β} {hd : { len := d + 1 }.len β€ n + 1} {x y : X.obj (Opposite.op { obj := { len := d + 1 }, property := hd })} (h : β (i : Fin (d + 1)), (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.mkOfSucc i) β― hd).op)) x = (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.Hom.tr (SimplexCategory.mkOfSucc i) β― hd).op)) y) : x = y - SSet.Truncated.instMonoidalTruncation π Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
(n : β) : (SSet.truncation n).Monoidal - SSet.Truncated.tensor_map_apply_fst π Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{n : β} {X Y : SSet.Truncated n} {d e : (SimplexCategory.Truncated n)α΅α΅} (f : d βΆ e) (x : (CategoryTheory.MonoidalCategoryStruct.tensorObj X Y).obj d) : ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.MonoidalCategoryStruct.tensorHom (X.map f) (Y.map f))) x).1 = (CategoryTheory.ConcreteCategory.hom (X.map f)) x.1 - SSet.Truncated.tensor_map_apply_snd π Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{n : β} {X Y : SSet.Truncated n} {d e : (SimplexCategory.Truncated n)α΅α΅} (f : d βΆ e) (x : (CategoryTheory.MonoidalCategoryStruct.tensorObj X Y).obj d) : ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.MonoidalCategoryStruct.tensorHom (X.map f) (Y.map f))) x).2 = (CategoryTheory.ConcreteCategory.hom (Y.map f)) x.2 - CategoryTheory.SimplicialObject.Truncated.rightExtensionInclusion π Mathlib.AlgebraicTopology.SimplicialObject.Coskeletal
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.SimplicialObject C) (n : β) : (SimplexCategory.Truncated.inclusion n).op.RightExtension ((SimplexCategory.Truncated.inclusion n).op.comp X) - CategoryTheory.SimplicialObject.isoCoskOfIsCoskeletal π Mathlib.AlgebraicTopology.SimplicialObject.Coskeletal
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.SimplicialObject C) (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasRightKanExtension F] [X.IsCoskeletal n] : X β (CategoryTheory.SimplicialObject.cosk n).obj X - CategoryTheory.SimplicialObject.IsCoskeletal.isRightKanExtension π Mathlib.AlgebraicTopology.SimplicialObject.Coskeletal
{C : Type u} {instβ : CategoryTheory.Category.{v, u} C} {X : CategoryTheory.SimplicialObject C} {n : β} [self : X.IsCoskeletal n] : CategoryTheory.Functor.IsRightKanExtension X (CategoryTheory.CategoryStruct.id ((SimplexCategory.Truncated.inclusion n).op.comp X)) - CategoryTheory.SimplicialObject.IsCoskeletal.mk π Mathlib.AlgebraicTopology.SimplicialObject.Coskeletal
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : CategoryTheory.SimplicialObject C} {n : β} (isRightKanExtension : CategoryTheory.Functor.IsRightKanExtension X (CategoryTheory.CategoryStruct.id ((SimplexCategory.Truncated.inclusion n).op.comp X))) : X.IsCoskeletal n - CategoryTheory.SimplicialObject.isCoskeletal_iff π Mathlib.AlgebraicTopology.SimplicialObject.Coskeletal
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.SimplicialObject C) (n : β) : X.IsCoskeletal n β CategoryTheory.Functor.IsRightKanExtension X (CategoryTheory.CategoryStruct.id ((SimplexCategory.Truncated.inclusion n).op.comp X)) - CategoryTheory.SimplicialObject.IsCoskeletal.isUniversalOfIsRightKanExtension π Mathlib.AlgebraicTopology.SimplicialObject.Coskeletal
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.SimplicialObject C) (n : β) [X.IsCoskeletal n] : CategoryTheory.CostructuredArrow.IsUniversal (CategoryTheory.SimplicialObject.Truncated.rightExtensionInclusion X n) - CategoryTheory.SimplicialObject.instIsIsoAppUnitTruncatedCoskAdj π Mathlib.AlgebraicTopology.SimplicialObject.Coskeletal
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.SimplicialObject C) (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasRightKanExtension F] [X.IsCoskeletal n] : CategoryTheory.IsIso ((CategoryTheory.SimplicialObject.coskAdj n).unit.app X) - CategoryTheory.SimplicialObject.isCoskeletal_iff_isIso π Mathlib.AlgebraicTopology.SimplicialObject.Coskeletal
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.SimplicialObject C) (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasRightKanExtension F] : X.IsCoskeletal n β CategoryTheory.IsIso ((CategoryTheory.SimplicialObject.coskAdj n).unit.app X) - CategoryTheory.SimplicialObject.Truncated.rightExtensionInclusion_left π Mathlib.AlgebraicTopology.SimplicialObject.Coskeletal
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.SimplicialObject C) (n : β) : (CategoryTheory.SimplicialObject.Truncated.rightExtensionInclusion X n).left = X - CategoryTheory.SimplicialObject.Truncated.rightExtensionInclusion_right_as π Mathlib.AlgebraicTopology.SimplicialObject.Coskeletal
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.SimplicialObject C) (n : β) : (CategoryTheory.SimplicialObject.Truncated.rightExtensionInclusion X n).right.as = PUnit.unit - CategoryTheory.SimplicialObject.isoCoskOfIsCoskeletal_hom π Mathlib.AlgebraicTopology.SimplicialObject.Coskeletal
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.SimplicialObject C) (n : β) [β (F : CategoryTheory.Functor (SimplexCategory.Truncated n)α΅α΅ C), (SimplexCategory.Truncated.inclusion n).op.HasRightKanExtension F] [X.IsCoskeletal n] : (X.isoCoskOfIsCoskeletal n).hom = (CategoryTheory.SimplicialObject.coskAdj n).unit.app X - CategoryTheory.SimplicialObject.Truncated.rightExtensionInclusion_hom_app π Mathlib.AlgebraicTopology.SimplicialObject.Coskeletal
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.SimplicialObject C) (n : β) (Xβ : (SimplexCategory.Truncated n)α΅α΅) : (CategoryTheory.SimplicialObject.Truncated.rightExtensionInclusion X n).hom.app Xβ = CategoryTheory.CategoryStruct.id (X.obj (Opposite.op (Opposite.unop Xβ).obj)) - CategoryTheory.Nerve.nerveFunctorβ π Mathlib.AlgebraicTopology.SimplicialSet.Coskeletal
: CategoryTheory.Functor CategoryTheory.Cat (SSet.Truncated 2) - CategoryTheory.Nerve.instIsStrictSegalObjCatTruncatedOfNatNatNerveFunctorβ π Mathlib.AlgebraicTopology.SimplicialSet.Coskeletal
(X : CategoryTheory.Cat) : (CategoryTheory.Nerve.nerveFunctorβ.obj X).IsStrictSegal - CategoryTheory.Nerve.coskβIso π Mathlib.AlgebraicTopology.SimplicialSet.Coskeletal
: CategoryTheory.nerveFunctor β CategoryTheory.Nerve.nerveFunctorβ.comp (SSet.Truncated.cosk 2) - SSet.Truncated.rightExtensionInclusion π Mathlib.AlgebraicTopology.SimplicialSet.Coskeletal
(X : SSet) (n : β) : (SimplexCategory.Truncated.inclusion n).op.RightExtension ((SimplexCategory.Truncated.inclusion n).op.comp X) - SSet.StrictSegal.isPointwiseRightKanExtensionAt.strArrowMkβ π Mathlib.AlgebraicTopology.SimplicialSet.Coskeletal
{i n : β} (Ο : { len := i } βΆ { len := n }) (hi : i β€ 2 := by lia) : CategoryTheory.StructuredArrow (Opposite.op { len := n }) (SimplexCategory.Truncated.inclusion 2).op - SSet.StrictSegal.isPointwiseRightKanExtension π Mathlib.AlgebraicTopology.SimplicialSet.Coskeletal
{X : SSet} (sx : X.StrictSegal) : (SSet.Truncated.rightExtensionInclusion X 2).IsPointwiseRightKanExtension - SSet.StrictSegal.isPointwiseRightKanExtensionAt π Mathlib.AlgebraicTopology.SimplicialSet.Coskeletal
{X : SSet} (sx : X.StrictSegal) (n : β) : (SSet.Truncated.rightExtensionInclusion X 2).IsPointwiseRightKanExtensionAt (Opposite.op { len := n }) - SSet.StrictSegal.isRightKanExtension π Mathlib.AlgebraicTopology.SimplicialSet.Coskeletal
{X : SSet} (sx : X.StrictSegal) : CategoryTheory.Functor.IsRightKanExtension X (CategoryTheory.CategoryStruct.id ((SimplexCategory.Truncated.inclusion 2).op.comp X)) - SSet.Truncated.rightExtensionInclusion_left π Mathlib.AlgebraicTopology.SimplicialSet.Coskeletal
(X : SSet) (n : β) : (SSet.Truncated.rightExtensionInclusion X n).left = X - SSet.Truncated.rightExtensionInclusion_right_as π Mathlib.AlgebraicTopology.SimplicialSet.Coskeletal
(X : SSet) (n : β) : (SSet.Truncated.rightExtensionInclusion X n).right.as = PUnit.unit - SSet.Truncated.rightExtensionInclusion_hom_app π Mathlib.AlgebraicTopology.SimplicialSet.Coskeletal
(X : SSet) (n : β) (Xβ : (SimplexCategory.Truncated n)α΅α΅) : (SSet.Truncated.rightExtensionInclusion X n).hom.app Xβ = CategoryTheory.CategoryStruct.id (X.obj (Opposite.op (Opposite.unop Xβ).obj)) - SSet.StrictSegal.isPointwiseRightKanExtensionAt.lift π Mathlib.AlgebraicTopology.SimplicialSet.Coskeletal
{X : SSet} (sx : X.StrictSegal) {n : β} (s : CategoryTheory.Limits.Cone ((CategoryTheory.StructuredArrow.proj (Opposite.op { len := n }) (SimplexCategory.Truncated.inclusion 2).op).comp ((SimplexCategory.Truncated.inclusion 2).op.comp X))) (x : s.pt) : X.obj (Opposite.op { len := n }) - SSet.StrictSegal.isPointwiseRightKanExtensionAt.fac_auxβ π Mathlib.AlgebraicTopology.SimplicialSet.Coskeletal
{X : SSet} (sx : X.StrictSegal) {n : β} (s : CategoryTheory.Limits.Cone ((CategoryTheory.StructuredArrow.proj (Opposite.op { len := n }) (SimplexCategory.Truncated.inclusion 2).op).comp ((SimplexCategory.Truncated.inclusion 2).op.comp X))) (x : s.pt) (Ο : { len := 1 } βΆ { len := n }) : (CategoryTheory.ConcreteCategory.hom (X.map Ο.op)) (SSet.StrictSegal.isPointwiseRightKanExtensionAt.lift sx s x) = (CategoryTheory.ConcreteCategory.hom (s.Ο.app (SSet.StrictSegal.isPointwiseRightKanExtensionAt.strArrowMkβ Ο SSet.StrictSegal.isPointwiseRightKanExtensionAt.fac_auxβ._proof_1))) x - SSet.StrictSegal.isPointwiseRightKanExtensionAt.fac_auxβ π Mathlib.AlgebraicTopology.SimplicialSet.Coskeletal
{X : SSet} (sx : X.StrictSegal) {n : β} (s : CategoryTheory.Limits.Cone ((CategoryTheory.StructuredArrow.proj (Opposite.op { len := n }) (SimplexCategory.Truncated.inclusion 2).op).comp ((SimplexCategory.Truncated.inclusion 2).op.comp X))) (x : s.pt) (i : β) (hi : i < n) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.mkOfSucc β¨i, hiβ©).op)) (SSet.StrictSegal.isPointwiseRightKanExtensionAt.lift sx s x) = (CategoryTheory.ConcreteCategory.hom (s.Ο.app (SSet.StrictSegal.isPointwiseRightKanExtensionAt.strArrowMkβ (SimplexCategory.mkOfSucc β¨i, hiβ©) SSet.StrictSegal.isPointwiseRightKanExtensionAt.fac_auxβ._proof_1))) x - SSet.StrictSegal.isPointwiseRightKanExtensionAt.fac_auxβ π Mathlib.AlgebraicTopology.SimplicialSet.Coskeletal
{X : SSet} (sx : X.StrictSegal) {n : β} (s : CategoryTheory.Limits.Cone ((CategoryTheory.StructuredArrow.proj (Opposite.op { len := n }) (SimplexCategory.Truncated.inclusion 2).op).comp ((SimplexCategory.Truncated.inclusion 2).op.comp X))) (x : s.pt) (i j : β) (hij : i β€ j) (hj : j β€ n) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.mkOfLe β¨i, β―β© β¨j, β―β© hij).op)) (SSet.StrictSegal.isPointwiseRightKanExtensionAt.lift sx s x) = (CategoryTheory.ConcreteCategory.hom (s.Ο.app (SSet.StrictSegal.isPointwiseRightKanExtensionAt.strArrowMkβ (SimplexCategory.mkOfLe β¨i, β―β© β¨j, β―β© hij) SSet.StrictSegal.isPointwiseRightKanExtensionAt.fac_auxβ._proof_1))) x - SSet.oneTruncationβ π Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
: CategoryTheory.Functor (SSet.Truncated 2) CategoryTheory.ReflQuiv - SSet.Truncated.hoFunctorβ π Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
: CategoryTheory.Functor (SSet.Truncated 2) CategoryTheory.Cat - SSet.oneTruncationβ_obj π Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
(S : SSet.Truncated 2) : SSet.oneTruncationβ.obj S = CategoryTheory.ReflQuiv.of (SSet.OneTruncationβ S) - SSet.OneTruncationβ.ofNerveβ.natIso π Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
: CategoryTheory.Nerve.nerveFunctorβ.comp SSet.oneTruncationβ β CategoryTheory.ReflQuiv.forget - SSet.OneTruncationβ.nerveEquiv π Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
{C : Type u} [CategoryTheory.Category.{v, u} C] : SSet.OneTruncationβ ((SSet.truncation 2).obj (CategoryTheory.nerve C)) β C - SSet.Truncated.ev0β π Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
{V : SSet.Truncated 2} (Ο : V.obj (Opposite.op { obj := { len := 2 }, property := SSet.Truncated.ΞΉ0β._proof_3 })) : SSet.OneTruncationβ V - SSet.Truncated.ev1β π Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
{V : SSet.Truncated 2} (Ο : V.obj (Opposite.op { obj := { len := 2 }, property := SSet.Truncated.ΞΉ0β._proof_3 })) : SSet.OneTruncationβ V - SSet.Truncated.ev2β π Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
{V : SSet.Truncated 2} (Ο : V.obj (Opposite.op { obj := { len := 2 }, property := SSet.Truncated.ΞΉ0β._proof_3 })) : SSet.OneTruncationβ V - SSet.Truncated.HomotopyCategory.mk π Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
{V : SSet.Truncated 2} (x : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncationβ._proof_1 })) : V.HomotopyCategory - SSet.Truncated.HomotopyCategory.instSubsingletonOfObjOppositeTruncatedOfNatNatOpMkSimplexCategoryLeLenMk π Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
(X : SSet.Truncated 2) [Subsingleton (X.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncationβ._proof_1 }))] : Subsingleton X.HomotopyCategory - SSet.Truncated.HomotopyCategory.instUniqueOfObjOppositeTruncatedOfNatNatOpMkSimplexCategoryLeLenMk π Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
(X : SSet.Truncated 2) [Unique (X.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncationβ._proof_1 }))] : Unique X.HomotopyCategory - SSet.Truncated.HomotopyCategory.mk_surjective π Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
{V : SSet.Truncated 2} : Function.Surjective SSet.Truncated.HomotopyCategory.mk
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