Loogle!
Result
Found 648 declarations mentioning SimplexCategory.len. Of these, only the first 200 are shown.
- SimplexCategory.len π Mathlib.AlgebraicTopology.SimplexCategory.Defs
(self : SimplexCategory) : β - SimplexCategory.len_mk π Mathlib.AlgebraicTopology.SimplexCategory.Defs
(n : β) : { len := n }.len = n - SimplexCategory.mk_len π Mathlib.AlgebraicTopology.SimplexCategory.Defs
(n : SimplexCategory) : { len := n.len } = n - SimplexCategory.ext π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{x y : SimplexCategory} (len : x.len = y.len) : x = y - SimplexCategory.ext_iff π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{x y : SimplexCategory} : x = y β x.len = y.len - 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.tr π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{n : β} {a b : SimplexCategory} (f : a βΆ b) (ha : a.len β€ n := by trunc) (hb : b.len β€ n := by trunc) : { obj := a, property := ha } βΆ { obj := b, property := hb } - SimplexCategory.Hom.mk π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{a b : SimplexCategory} (f : Fin (a.len + 1) βo Fin (b.len + 1)) : a.Hom b - SimplexCategory.Hom.toOrderHom π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{a b : SimplexCategory} (f : a.Hom b) : Fin (a.len + 1) βo Fin (b.len + 1) - SimplexCategory.homEquivOrderHom π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{a b : SimplexCategory} : (a βΆ b) β (Fin (a.len + 1) βo Fin (b.len + 1)) - SimplexCategory.Hom.ext' π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{a b : SimplexCategory} (f g : a.Hom b) : f.toOrderHom = g.toOrderHom β f = g - SimplexCategory.Hom.ext π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{a b : SimplexCategory} (f g : a βΆ b) : SimplexCategory.Hom.toOrderHom f = SimplexCategory.Hom.toOrderHom g β f = g - SimplexCategory.Truncated.Hom.tr_id π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{n : β} (a : SimplexCategory) (ha : a.len β€ n := by trunc) : SimplexCategory.Truncated.Hom.tr (CategoryTheory.CategoryStruct.id a) ha ha = CategoryTheory.CategoryStruct.id { obj := a, property := ha } - SimplexCategory.Hom.ext_iff π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{a b : SimplexCategory} {f g : a βΆ b} : f = g β SimplexCategory.Hom.toOrderHom f = SimplexCategory.Hom.toOrderHom g - SimplexCategory.homEquivFunctor π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{a b : SimplexCategory} : (a βΆ b) β CategoryTheory.Functor (Fin (a.len + 1)) (Fin (b.len + 1)) - SimplexCategory.id_toOrderHom π Mathlib.AlgebraicTopology.SimplexCategory.Defs
(a : SimplexCategory) : SimplexCategory.Hom.toOrderHom (CategoryTheory.CategoryStruct.id a) = OrderHom.id - SimplexCategory.Hom.toOrderHom_mk π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{a b : SimplexCategory} (f : Fin (a.len + 1) βo Fin (b.len + 1)) : (SimplexCategory.Hom.mk f).toOrderHom = f - SimplexCategory.Truncated.Hom.tr_comp π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{n : β} {a b c : SimplexCategory} (f : a βΆ b) (g : b βΆ c) (ha : a.len β€ n := by trunc) (hb : b.len β€ n := by trunc) (hc : c.len β€ n := by trunc) : SimplexCategory.Truncated.Hom.tr (CategoryTheory.CategoryStruct.comp f g) ha hc = CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Hom.tr f ha hb) (SimplexCategory.Truncated.Hom.tr g hb hc) - SimplexCategory.comp_toOrderHom π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{a b c : SimplexCategory} (f : a βΆ b) (g : b βΆ c) : SimplexCategory.Hom.toOrderHom (CategoryTheory.CategoryStruct.comp f g) = (SimplexCategory.Hom.toOrderHom g).comp (SimplexCategory.Hom.toOrderHom f) - 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 - SimplexCategory.Truncated.Hom.tr_comp' π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{n : β} {a b c : SimplexCategory} (f : a βΆ b) {hb : b.len β€ n} {hc : c.len β€ n} (g : { obj := b, property := hb } βΆ { obj := c, property := hc }) (ha : a.len β€ n := by trunc) : SimplexCategory.Truncated.Hom.tr (CategoryTheory.CategoryStruct.comp f g.hom) ha hc = CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Hom.tr f ha hb) g - SimplexCategory.Truncated.Hom.tr_comp_assoc π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{n : β} {a b c : SimplexCategory} (f : a βΆ b) (g : b βΆ c) (ha : a.len β€ n := by trunc) (hb : b.len β€ n := by trunc) (hc : c.len β€ n := by trunc) {Z : CategoryTheory.ObjectProperty.FullSubcategory fun a => a.len β€ n} (h : { obj := c, property := hc } βΆ Z) : CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Hom.tr (CategoryTheory.CategoryStruct.comp f g) ha hc) h = CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Hom.tr f ha hb) (CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Hom.tr g hb hc) h) - SimplexCategory.Truncated.Hom.tr_comp'_assoc π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{n : β} {a b c : SimplexCategory} (f : a βΆ b) {hb : b.len β€ n} {hc : c.len β€ n} (g : { obj := b, property := hb } βΆ { obj := c, property := hc }) (ha : a.len β€ n := by trunc) {Z : CategoryTheory.ObjectProperty.FullSubcategory fun a => a.len β€ n} (h : { obj := c, property := hc } βΆ Z) : CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Hom.tr (CategoryTheory.CategoryStruct.comp f g.hom) ha hc) h = CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Hom.tr f ha hb) (CategoryTheory.CategoryStruct.comp g h) - SimplexCategory.Hom.mk_toOrderHom_apply π Mathlib.AlgebraicTopology.SimplexCategory.Defs
{a b : SimplexCategory} (f : Fin (a.len + 1) βo Fin (b.len + 1)) (i : Fin (a.len + 1)) : (SimplexCategory.Hom.mk f).toOrderHom i = f i - SimplexCategory.len_eq_of_isIso π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{x y : SimplexCategory} (f : x βΆ y) [CategoryTheory.IsIso f] : x.len = y.len - SimplexCategory.len_le_of_epi π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{x y : SimplexCategory} (f : x βΆ y) [CategoryTheory.Epi f] : y.len β€ x.len - SimplexCategory.len_le_of_mono π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{x y : SimplexCategory} (f : x βΆ y) [CategoryTheory.Mono f] : x.len β€ y.len - SimplexCategory.const π Mathlib.AlgebraicTopology.SimplexCategory.Basic
(x y : SimplexCategory) (i : Fin (y.len + 1)) : x βΆ y - SimplexCategory.len_lt_of_mono π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{Ξ' Ξ : SimplexCategory} (i : Ξ' βΆ Ξ) [CategoryTheory.Mono i] (hi' : Ξ β Ξ') : Ξ'.len < Ξ.len - SimplexCategory.isIso_iff_of_epi π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n m : SimplexCategory} (f : n βΆ m) [hf : CategoryTheory.Epi f] : CategoryTheory.IsIso f β n.len = m.len - SimplexCategory.isIso_iff_of_mono π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n m : SimplexCategory} (f : n βΆ m) [hf : CategoryTheory.Mono f] : CategoryTheory.IsIso f β n.len = m.len - SimplexCategory.skeletalFunctor_obj π Mathlib.AlgebraicTopology.SimplexCategory.Basic
(a : SimplexCategory) : SimplexCategory.skeletalFunctor.obj a = NonemptyFinLinOrd.of (Fin (a.len + 1)) - SimplexCategory.toPartOrd_obj π Mathlib.AlgebraicTopology.SimplexCategory.Basic
(n : SimplexCategory) : SimplexCategory.toPartOrd.obj n = { carrier := ULift.{u, 0} (Fin (n.len + 1)), str := ULift.instPartialOrder } - SimplexCategory.orderIsoOfIso π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{x y : SimplexCategory} (e : x β y) : Fin (x.len + 1) βo Fin (y.len + 1) - SimplexCategory.exists_eq_const_of_zero π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n : SimplexCategory} (f : { len := 0 } βΆ n) : β a, f = { len := 0 }.const n a - SimplexCategory.eq_const_to_zero π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n : SimplexCategory} (f : n βΆ { len := 0 }) : f = n.const { len := 0 } 0 - SimplexCategory.const_eq_id π Mathlib.AlgebraicTopology.SimplexCategory.Basic
: { len := 0 }.const { len := 0 } 0 = CategoryTheory.CategoryStruct.id { len := 0 } - SimplexCategory.const_fac_thru_zero π Mathlib.AlgebraicTopology.SimplexCategory.Basic
(n m : SimplexCategory) (i : Fin (m.len + 1)) : n.const m i = CategoryTheory.CategoryStruct.comp (n.const { len := 0 } 0) ({ len := 0 }.const m i) - SimplexCategory.eq_of_one_to_one π Mathlib.AlgebraicTopology.SimplexCategory.Basic
(f : { len := 1 } βΆ { len := 1 }) : (β a, f = { len := 1 }.const { len := 1 } a) β¨ f = CategoryTheory.CategoryStruct.id { len := 1 } - SimplexCategory.isIso_of_bijective π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{x y : SimplexCategory} {f : x βΆ y} (hf : Function.Bijective (SimplexCategory.Hom.toOrderHom f).toFun) : CategoryTheory.IsIso f - SimplexCategory.skeletalFunctor.coe_map π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{Ξβ Ξβ : SimplexCategory} (f : Ξβ βΆ Ξβ) : LinOrd.Hom.hom (SimplexCategory.skeletalFunctor.map f).hom = SimplexCategory.Hom.toOrderHom f - SimplexCategory.eq_of_one_to_two π Mathlib.AlgebraicTopology.SimplexCategory.Basic
(f : { len := 1 } βΆ { len := 2 }) : (β i, f = SimplexCategory.Ξ΄ i) β¨ β a, f = { len := 1 }.const { len := 2 } a - SimplexCategory.Ξ΄_one_eq_const π Mathlib.AlgebraicTopology.SimplexCategory.Basic
: SimplexCategory.Ξ΄ 1 = { len := 0 }.const { len := 0 + 1 } 0 - SimplexCategory.Ξ΄_zero_eq_const π Mathlib.AlgebraicTopology.SimplexCategory.Basic
: SimplexCategory.Ξ΄ 0 = { len := 0 }.const { len := 0 + 1 } 1 - SimplexCategory.instConcreteCategoryOrderHomFinHAddNatLenOfNat π Mathlib.AlgebraicTopology.SimplexCategory.Basic
: CategoryTheory.ConcreteCategory SimplexCategory fun i j => Fin (i.len + 1) βo Fin (j.len + 1) - SimplexCategory.const_subinterval_eq π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n : β} (j l : β) (hjl : j + l β€ n) (i : Fin (l + 1)) : CategoryTheory.CategoryStruct.comp ({ len := 0 }.const { len := l } i) (SimplexCategory.subinterval j l hjl) = { len := 0 }.const { len := n } β¨j + βi, β―β© - SimplexCategory.instReflectsIsomorphismsForgetOrderHomFinHAddNatLenOfNat π Mathlib.AlgebraicTopology.SimplexCategory.Basic
: (CategoryTheory.forget SimplexCategory).ReflectsIsomorphisms - SimplexCategory.skeletalFunctor_map π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{Xβ Yβ : SimplexCategory} (f : Xβ βΆ Yβ) : SimplexCategory.skeletalFunctor.map f = NonemptyFinLinOrd.ofHom (SimplexCategory.Hom.toOrderHom f) - SimplexCategory.toType_apply π Mathlib.AlgebraicTopology.SimplexCategory.Basic
(x : SimplexCategory) : CategoryTheory.ToType x = Fin (x.len + 1) - SimplexCategory.epi_iff_surjective π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n m : SimplexCategory} {f : n βΆ m} : CategoryTheory.Epi f β Function.Surjective β(SimplexCategory.Hom.toOrderHom f) - SimplexCategory.mono_iff_injective π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n m : SimplexCategory} {f : n βΆ m} : CategoryTheory.Mono f β Function.Injective β(SimplexCategory.Hom.toOrderHom f) - SimplexCategory.const_apply π Mathlib.AlgebraicTopology.SimplexCategory.Basic
(x y : SimplexCategory) (i : Fin (y.len + 1)) (a : Fin (x.len + 1)) : (SimplexCategory.Hom.toOrderHom (x.const y i)) a = i - SimplexCategory.const_comp π Mathlib.AlgebraicTopology.SimplexCategory.Basic
(x : SimplexCategory) {y z : SimplexCategory} (f : y βΆ z) (i : Fin (y.len + 1)) : CategoryTheory.CategoryStruct.comp (x.const y i) f = x.const z ((SimplexCategory.Hom.toOrderHom f) i) - SimplexCategory.eqToHom_toOrderHom π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{x y : SimplexCategory} (h : x = y) : SimplexCategory.Hom.toOrderHom (CategoryTheory.eqToHom h) = (Fin.castOrderIso β―).toOrderEmbedding.toOrderHom - SimplexCategory.eq_of_one_to_two' π Mathlib.AlgebraicTopology.SimplexCategory.Basic
(f : { len := 1 } βΆ { len := 2 }) : f = SimplexCategory.Ξ΄ 0 β¨ f = SimplexCategory.Ξ΄ 1 β¨ f = SimplexCategory.Ξ΄ 2 β¨ β a, f = { len := 1 }.const { len := 2 } a - SimplexCategory.concreteCategoryHom_id π Mathlib.AlgebraicTopology.SimplexCategory.Basic
(n : SimplexCategory) : CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.id n) = OrderHom.id - SimplexCategory.eq_const_of_zero π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n : SimplexCategory} (f : { len := 0 } βΆ n) : f = { len := 0 }.const n ((SimplexCategory.Hom.toOrderHom f) 0) - SimplexCategory.factor_Ξ΄_spec π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{m n : β} (f : { len := m } βΆ { len := n + 1 }) (j : Fin (n + 2)) (hj : β (k : Fin (m + 1)), (SimplexCategory.Hom.toOrderHom f) k β j) : CategoryTheory.CategoryStruct.comp (SimplexCategory.factor_Ξ΄ f j) (SimplexCategory.Ξ΄ j) = f - SimplexCategory.eq_comp_Ξ΄_of_not_surjective' π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n : β} {Ξ : SimplexCategory} (ΞΈ : Ξ βΆ { len := n + 1 }) (i : Fin (n + 2)) (hi : β (x : Fin (Ξ.len + 1)), (SimplexCategory.Hom.toOrderHom ΞΈ) x β i) : β ΞΈ', ΞΈ = CategoryTheory.CategoryStruct.comp ΞΈ' (SimplexCategory.Ξ΄ i) - SimplexCategory.eq_comp_Ξ΄_of_not_surjective π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n : β} {Ξ : SimplexCategory} (ΞΈ : Ξ βΆ { len := n + 1 }) (hΞΈ : Β¬Function.Surjective β(SimplexCategory.Hom.toOrderHom ΞΈ)) : β i ΞΈ', ΞΈ = CategoryTheory.CategoryStruct.comp ΞΈ' (SimplexCategory.Ξ΄ i) - SimplexCategory.eq_Ο_comp_of_not_injective π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n : β} {Ξ' : SimplexCategory} (ΞΈ : { len := n + 1 } βΆ Ξ') (hΞΈ : Β¬Function.Injective β(SimplexCategory.Hom.toOrderHom ΞΈ)) : β i ΞΈ', ΞΈ = CategoryTheory.CategoryStruct.comp (SimplexCategory.Ο i) ΞΈ' - SimplexCategory.congr_toOrderHom_apply π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{a b : SimplexCategory} {f g : a βΆ b} (h : f = g) (x : Fin (a.len + 1)) : (SimplexCategory.Hom.toOrderHom f) x = (SimplexCategory.Hom.toOrderHom g) x - SimplexCategory.coe_Ξ΄ π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n : β} (i : Fin (n + 2)) : β(CategoryTheory.ConcreteCategory.hom (SimplexCategory.Ξ΄ i)) = i.succAbove - SimplexCategory.coe_Ο π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n : β} (i : Fin (n + 1)) : β(CategoryTheory.ConcreteCategory.hom (SimplexCategory.Ο i)) = i.predAbove - SimplexCategory.Hom.ext_zero_left π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n : SimplexCategory} (f g : { len := 0 } βΆ n) (h0 : (SimplexCategory.Hom.toOrderHom f) 0 = (SimplexCategory.Hom.toOrderHom g) 0 := by rfl) : f = g - SimplexCategory.eq_Ο_comp_of_not_injective' π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n : β} {Ξ' : SimplexCategory} (ΞΈ : { len := n + 1 } βΆ Ξ') (i : Fin (n + 1)) (hi : (SimplexCategory.Hom.toOrderHom ΞΈ) i.castSucc = (SimplexCategory.Hom.toOrderHom ΞΈ) i.succ) : β ΞΈ', ΞΈ = CategoryTheory.CategoryStruct.comp (SimplexCategory.Ο i) ΞΈ' - SimplexCategory.toPartOrd_map_apply π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n m : SimplexCategory} (f : n βΆ m) (i : Fin (n.len + 1)) : (CategoryTheory.ConcreteCategory.hom (SimplexCategory.toPartOrd.map f)) { down := i } = { down := (CategoryTheory.ConcreteCategory.hom f) i } - SimplexCategory.Hom.ext_one_left π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{n : SimplexCategory} (f g : { len := 1 } βΆ n) (h0 : (SimplexCategory.Hom.toOrderHom f) 0 = (SimplexCategory.Hom.toOrderHom g) 0 := by rfl) (h1 : (SimplexCategory.Hom.toOrderHom f) 1 = (SimplexCategory.Hom.toOrderHom g) 1 := by rfl) : f = g - SimplexCategory.toCat_obj π Mathlib.AlgebraicTopology.SimplexCategory.Basic
(X : SimplexCategory) : SimplexCategory.toCat.obj X = CategoryTheory.Cat.of β((CategoryTheory.forgetβ PartOrd Preord).obj ((CategoryTheory.forgetβ Lat PartOrd).obj ((CategoryTheory.forgetβ LinOrd Lat).obj ((CategoryTheory.forgetβ NonemptyFinLinOrd LinOrd).obj (NonemptyFinLinOrd.of (Fin (X.len + 1))))))) - SimplexCategory.toCat_map π Mathlib.AlgebraicTopology.SimplexCategory.Basic
{Xβ Yβ : SimplexCategory} (f : Xβ βΆ Yβ) : SimplexCategory.toCat.map f = β―.functor.toCatHom - 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.CosimplicialObject.augment_hom_app π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.CosimplicialObject C) (Xβ : C) (f : Xβ βΆ X.obj { len := 0 }) (w : β (i : SimplexCategory) (gβ gβ : { len := 0 } βΆ i), CategoryTheory.CategoryStruct.comp f (X.map gβ) = CategoryTheory.CategoryStruct.comp f (X.map gβ)) (xβ : SimplexCategory) : (X.augment Xβ f w).hom.app xβ = CategoryTheory.CategoryStruct.comp f (X.map ({ len := 0 }.const xβ 0)) - 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.augment_hom_app π Mathlib.AlgebraicTopology.SimplicialObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.SimplicialObject C) (Xβ : C) (f : X.obj (Opposite.op { len := 0 }) βΆ Xβ) (w : β (i : SimplexCategory) (gβ gβ : { len := 0 } βΆ i), CategoryTheory.CategoryStruct.comp (X.map gβ.op) f = CategoryTheory.CategoryStruct.comp (X.map gβ.op) f) (xβ : SimplexCategoryα΅α΅) : (X.augment Xβ f w).hom.app xβ = CategoryTheory.CategoryStruct.comp (X.map ({ len := 0 }.const (Opposite.unop xβ) 0).op) f - 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 - CategoryTheory.Arrow.cechConerve_obj π Mathlib.AlgebraicTopology.CechNerve
{C : Type u} [CategoryTheory.Category.{v, u} C] (f : CategoryTheory.Arrow C) [β (n : β), CategoryTheory.Limits.HasWidePushout f.left (fun x => f.right) fun x => f.hom] (n : SimplexCategory) : f.cechConerve.obj n = CategoryTheory.Limits.widePushout f.left (fun x => f.right) fun x => f.hom - CategoryTheory.Arrow.cechNerve_obj π Mathlib.AlgebraicTopology.CechNerve
{C : Type u} [CategoryTheory.Category.{v, u} C] (f : CategoryTheory.Arrow C) [β (n : β), CategoryTheory.Limits.HasWidePullback f.right (fun x => f.left) fun x => f.hom] (n : SimplexCategoryα΅α΅) : f.cechNerve.obj n = CategoryTheory.Limits.widePullback f.right (fun x => f.left) fun x => f.hom - CategoryTheory.SimplicialObject.augmentedCechNerve_obj_left_obj π Mathlib.AlgebraicTopology.CechNerve
{C : Type u} [CategoryTheory.Category.{v, u} C] [β (n : β) (f : CategoryTheory.Arrow C), CategoryTheory.Limits.HasWidePullback f.right (fun x => f.left) fun x => f.hom] (f : CategoryTheory.Arrow C) (n : SimplexCategoryα΅α΅) : (CategoryTheory.SimplicialObject.augmentedCechNerve.obj f).left.obj n = CategoryTheory.Limits.widePullback f.right (fun x => f.left) fun x => f.hom - CategoryTheory.Arrow.augmentedCechConerve_hom_app π Mathlib.AlgebraicTopology.CechNerve
{C : Type u} [CategoryTheory.Category.{v, u} C] (f : CategoryTheory.Arrow C) [β (n : β), CategoryTheory.Limits.HasWidePushout f.left (fun x => f.right) fun x => f.hom] (xβ : SimplexCategory) : f.augmentedCechConerve.hom.app xβ = CategoryTheory.Limits.WidePushout.head fun x => f.hom - CategoryTheory.Arrow.augmentedCechNerve_hom_app π Mathlib.AlgebraicTopology.CechNerve
{C : Type u} [CategoryTheory.Category.{v, u} C] (f : CategoryTheory.Arrow C) [β (n : β), CategoryTheory.Limits.HasWidePullback f.right (fun x => f.left) fun x => f.hom] (xβ : SimplexCategoryα΅α΅) : f.augmentedCechNerve.hom.app xβ = CategoryTheory.Limits.WidePullback.base fun x => f.hom - CategoryTheory.SimplicialObject.augmentedCechNerve_obj_hom_app π Mathlib.AlgebraicTopology.CechNerve
{C : Type u} [CategoryTheory.Category.{v, u} C] [β (n : β) (f : CategoryTheory.Arrow C), CategoryTheory.Limits.HasWidePullback f.right (fun x => f.left) fun x => f.hom] (f : CategoryTheory.Arrow C) (xβ : SimplexCategoryα΅α΅) : (CategoryTheory.SimplicialObject.augmentedCechNerve.obj f).hom.app xβ = CategoryTheory.Limits.WidePullback.base fun x => f.hom - CategoryTheory.CosimplicialObject.equivalenceLeftToRight_right π Mathlib.AlgebraicTopology.CechNerve
{C : Type u} [CategoryTheory.Category.{v, u} C] [β (n : β) (f : CategoryTheory.Arrow C), CategoryTheory.Limits.HasWidePushout f.left (fun x => f.right) fun x => f.hom] (F : CategoryTheory.Arrow C) (X : CategoryTheory.CosimplicialObject.Augmented C) (G : F.augmentedCechConerve βΆ X) : (CategoryTheory.CosimplicialObject.equivalenceLeftToRight F X G).right = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.WidePushout.ΞΉ (fun x => F.hom) 0) (G.right.app { len := 0 }) - CategoryTheory.Arrow.mapCechConerve_app π Mathlib.AlgebraicTopology.CechNerve
{C : Type u} [CategoryTheory.Category.{v, u} C] {f g : CategoryTheory.Arrow C} [β (n : β), CategoryTheory.Limits.HasWidePushout f.left (fun x => f.right) fun x => f.hom] [β (n : β), CategoryTheory.Limits.HasWidePushout g.left (fun x => g.right) fun x => g.hom] (F : f βΆ g) (n : SimplexCategory) : (CategoryTheory.Arrow.mapCechConerve F).app n = CategoryTheory.Limits.WidePushout.desc (CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.left F) (CategoryTheory.Limits.WidePushout.head fun x => g.hom)) (fun i => CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right F) (CategoryTheory.Limits.WidePushout.ΞΉ (fun x => g.hom) i)) β― - CategoryTheory.SimplicialObject.equivalenceRightToLeft_left π Mathlib.AlgebraicTopology.CechNerve
{C : Type u} [CategoryTheory.Category.{v, u} C] [β (n : β) (f : CategoryTheory.Arrow C), CategoryTheory.Limits.HasWidePullback f.right (fun x => f.left) fun x => f.hom] (X : CategoryTheory.SimplicialObject.Augmented C) (F : CategoryTheory.Arrow C) (G : X βΆ F.augmentedCechNerve) : (CategoryTheory.SimplicialObject.equivalenceRightToLeft X F G).left = CategoryTheory.CategoryStruct.comp (G.left.app (Opposite.op { len := 0 })) (CategoryTheory.Limits.WidePullback.Ο (fun x => F.hom) 0) - CategoryTheory.Arrow.mapCechNerve_app π Mathlib.AlgebraicTopology.CechNerve
{C : Type u} [CategoryTheory.Category.{v, u} C] {f g : CategoryTheory.Arrow C} [β (n : β), CategoryTheory.Limits.HasWidePullback f.right (fun x => f.left) fun x => f.hom] [β (n : β), CategoryTheory.Limits.HasWidePullback g.right (fun x => g.left) fun x => g.hom] (F : f βΆ g) (n : SimplexCategoryα΅α΅) : (CategoryTheory.Arrow.mapCechNerve F).app n = CategoryTheory.Limits.WidePullback.lift (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.WidePullback.base fun x => f.hom) (CategoryTheory.Arrow.Hom.right F)) (fun i => CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.WidePullback.Ο (fun x => f.hom) i) (CategoryTheory.Arrow.Hom.left F)) β― - CategoryTheory.Arrow.cechConerve_map π Mathlib.AlgebraicTopology.CechNerve
{C : Type u} [CategoryTheory.Category.{v, u} C] (f : CategoryTheory.Arrow C) [β (n : β), CategoryTheory.Limits.HasWidePushout f.left (fun x => f.right) fun x => f.hom] {x y : SimplexCategory} (g : x βΆ y) : f.cechConerve.map g = CategoryTheory.Limits.WidePushout.desc (CategoryTheory.Limits.WidePushout.head fun x => f.hom) (fun i => CategoryTheory.Limits.WidePushout.ΞΉ (fun x => f.hom) ((SimplexCategory.Hom.toOrderHom g) i)) β― - CategoryTheory.SimplicialObject.augmentedCechNerve_map_left_app π Mathlib.AlgebraicTopology.CechNerve
{C : Type u} [CategoryTheory.Category.{v, u} C] [β (n : β) (f : CategoryTheory.Arrow C), CategoryTheory.Limits.HasWidePullback f.right (fun x => f.left) fun x => f.hom] {Xβ Yβ : CategoryTheory.Arrow C} (F : Xβ βΆ Yβ) (n : SimplexCategoryα΅α΅) : (CategoryTheory.SimplicialObject.augmentedCechNerve.map F).left.app n = CategoryTheory.Limits.WidePullback.lift (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.WidePullback.base fun x => Xβ.hom) (CategoryTheory.Arrow.Hom.right F)) (fun i => CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.WidePullback.Ο (fun x => Xβ.hom) i) (CategoryTheory.Arrow.Hom.left F)) β― - CategoryTheory.CosimplicialObject.equivalenceRightToLeft_right_app π Mathlib.AlgebraicTopology.CechNerve
{C : Type u} [CategoryTheory.Category.{v, u} C] [β (n : β) (f : CategoryTheory.Arrow C), CategoryTheory.Limits.HasWidePushout f.left (fun x => f.right) fun x => f.hom] (F : CategoryTheory.Arrow C) (X : CategoryTheory.CosimplicialObject.Augmented C) (G : F βΆ CategoryTheory.CosimplicialObject.Augmented.toArrow.obj X) (x : SimplexCategory) : (CategoryTheory.CosimplicialObject.equivalenceRightToLeft F X G).right.app x = CategoryTheory.Limits.WidePushout.desc (CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.left G) (X.hom.app x)) (fun i => CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right G) (X.right.map ({ len := 0 }.const x i))) β― - CategoryTheory.Arrow.cechNerve_map π Mathlib.AlgebraicTopology.CechNerve
{C : Type u} [CategoryTheory.Category.{v, u} C] (f : CategoryTheory.Arrow C) [β (n : β), CategoryTheory.Limits.HasWidePullback f.right (fun x => f.left) fun x => f.hom] {Xβ Yβ : SimplexCategoryα΅α΅} (g : Xβ βΆ Yβ) : f.cechNerve.map g = CategoryTheory.Limits.WidePullback.lift (CategoryTheory.Limits.WidePullback.base fun x => f.hom) (fun i => CategoryTheory.Limits.WidePullback.Ο (fun x => f.hom) ((SimplexCategory.Hom.toOrderHom g.unop) i)) β― - CategoryTheory.SimplicialObject.augmentedCechNerve_obj_left_map π Mathlib.AlgebraicTopology.CechNerve
{C : Type u} [CategoryTheory.Category.{v, u} C] [β (n : β) (f : CategoryTheory.Arrow C), CategoryTheory.Limits.HasWidePullback f.right (fun x => f.left) fun x => f.hom] (f : CategoryTheory.Arrow C) {Xβ Yβ : SimplexCategoryα΅α΅} (g : Xβ βΆ Yβ) : (CategoryTheory.SimplicialObject.augmentedCechNerve.obj f).left.map g = CategoryTheory.Limits.WidePullback.lift (CategoryTheory.Limits.WidePullback.base fun x => f.hom) (fun i => CategoryTheory.Limits.WidePullback.Ο (fun x => f.hom) ((SimplexCategory.Hom.toOrderHom g.unop) i)) β― - CategoryTheory.SimplicialObject.equivalenceLeftToRight_left_app π Mathlib.AlgebraicTopology.CechNerve
{C : Type u} [CategoryTheory.Category.{v, u} C] [β (n : β) (f : CategoryTheory.Arrow C), CategoryTheory.Limits.HasWidePullback f.right (fun x => f.left) fun x => f.hom] (X : CategoryTheory.SimplicialObject.Augmented C) (F : CategoryTheory.Arrow C) (G : CategoryTheory.SimplicialObject.Augmented.toArrow.obj X βΆ F) (x : SimplexCategoryα΅α΅) : (CategoryTheory.SimplicialObject.equivalenceLeftToRight X F G).left.app x = CategoryTheory.Limits.WidePullback.lift (CategoryTheory.CategoryStruct.comp (X.hom.app x) (CategoryTheory.Arrow.Hom.right G)) (fun i => CategoryTheory.CategoryStruct.comp (X.left.map ({ len := 0 }.const (Opposite.unop x) i).op) (CategoryTheory.Arrow.Hom.left G)) β― - SimplexCategory.ΟβIter_coe_eq_of_le π Mathlib.AlgebraicTopology.SimplexCategory.DeltaZeroIter
(i : β) {n m : β} (j : Fin (m + 1)) (hi : n + i = m := by lia) (hj : βj β€ i := by grind) : β((CategoryTheory.ConcreteCategory.hom (SimplexCategory.ΟβIter i hi)) j) = 0 - SimplexCategory.ΟβIter_coe_eq_of_lt π Mathlib.AlgebraicTopology.SimplexCategory.DeltaZeroIter
(i : β) {n m : β} (j : Fin (m + 1)) (hi : n + i = m := by lia) (hj : βj < i := by grind) : β((CategoryTheory.ConcreteCategory.hom (SimplexCategory.ΟβIter i hi)) j) = 0 - SimplexCategory.Ξ΄βIter_apply π Mathlib.AlgebraicTopology.SimplexCategory.DeltaZeroIter
(i : β) {n m : β} (j : Fin (n + 1)) (hi : n + i = m := by lia) : (CategoryTheory.ConcreteCategory.hom (SimplexCategory.Ξ΄βIter i hi)) j = β¨βj + i, β―β© - SimplexCategory.ΟβIter_coe_eq_of_ge π Mathlib.AlgebraicTopology.SimplexCategory.DeltaZeroIter
(i : β) {n m : β} (j : Fin (m + 1)) (hi : n + i = m := by lia) (hj : i β€ βj := by grind) : β((CategoryTheory.ConcreteCategory.hom (SimplexCategory.ΟβIter i hi)) j) = βj - i - SimplexCategory.rev_map_apply π Mathlib.AlgebraicTopology.SimplexCategory.Rev
{n m : SimplexCategory} (f : n βΆ m) (i : Fin (n.len + 1)) : (SimplexCategory.Hom.toOrderHom (SimplexCategory.rev.map f)) i = ((SimplexCategory.Hom.toOrderHom f) i.rev).rev - SimplexCategory.rev_map π Mathlib.AlgebraicTopology.SimplexCategory.Rev
{n m : SimplexCategory} (f : n βΆ m) : SimplexCategory.rev.map f = SimplexCategory.Hom.mk { toFun := fun i => Fin.rev ((CategoryTheory.ConcreteCategory.hom f) i.rev), monotone' := β― } - 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.const_app π Mathlib.AlgebraicTopology.SimplicialSet.Basic
{X Y : SSet} (y : Y.obj (Opposite.op { len := 0 })) (n : SimplexCategoryα΅α΅) : (SSet.const y).app n = TypeCat.ofHom fun x => (CategoryTheory.ConcreteCategory.hom (Y.map ((Opposite.unop n).const { len := 0 } 0).op)) y - 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) - SSet.S.equivElements_symm_apply_dim π Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (aβ : CategoryTheory.Functor.Elements X) : (SSet.S.equivElements.symm aβ).dim = aβ.1.1.len - 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 - SimplexCategory.Truncated.Ξ΄ π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
(m : β) {n : β} (i : Fin (n + 2)) (hn : { len := n }.len β€ m := by decide) (hn' : { len := n + 1 }.len β€ m := by decide) : { obj := { len := n }, property := hn } βΆ { obj := { len := n + 1 }, property := hn' } - SimplexCategory.Truncated.Ο π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
(m : β) {n : β} (i : Fin (n + 1)) (hn : { len := n + 1 }.len β€ m := by decide) (hn' : { len := n }.len β€ m := by decide) : { obj := { len := n + 1 }, property := hn } βΆ { obj := { len := n }, property := hn' } - SimplexCategory.Truncated.Ξ΄β π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
{n : β} (i : Fin (n + 2)) (hn : { len := n }.len β€ 2 := by decide) (hn' : { len := n + 1 }.len β€ 2 := by decide) : { obj := { len := n }, property := hn } βΆ { obj := { len := n + 1 }, property := hn' } - SimplexCategory.Truncated.Οβ π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
{n : β} (i : Fin (n + 1)) (hn : { len := n + 1 }.len β€ 2 := by decide) (hn' : { len := n }.len β€ 2 := by decide) : { obj := { len := n + 1 }, property := hn } βΆ { obj := { len := n }, property := hn' } - SimplexCategory.Truncated.Ξ΄β_one_eq_const π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
: SimplexCategory.Truncated.Ξ΄β 1 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_4 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3 = SimplexCategory.Truncated.Hom.tr ({ len := 0 }.const { len := 0 + 1 } 0) SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_4 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3 - SimplexCategory.Truncated.Ξ΄β_zero_eq_const π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
: SimplexCategory.Truncated.Ξ΄β 0 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_4 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3 = SimplexCategory.Truncated.Hom.tr ({ len := 0 }.const { len := 0 + 1 } 1) SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_4 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3 - SimplexCategory.Truncated.Ξ΄β_two_comp_Οβ_one π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
: CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 2 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_1 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_2) (SimplexCategory.Truncated.Οβ 1 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_2 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_1) = CategoryTheory.CategoryStruct.id { obj := { len := 1 }, property := SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_1 } - SimplexCategory.Truncated.Ξ΄β_one_comp_Οβ_zero π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
{n : β} (hn : { len := n }.len β€ 2 := by decide) (hn' : { len := n + 1 }.len β€ 2 := by decide) : CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 1 hn hn') (SimplexCategory.Truncated.Οβ 0 hn' hn) = CategoryTheory.CategoryStruct.id { obj := { len := n }, property := hn } - SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_zero π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
{n : β} (hn : { len := n }.len β€ 2 := by decide) (hn' : { len := n + 1 }.len β€ 2 := by decide) : CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 0 hn hn') (SimplexCategory.Truncated.Οβ 0 hn' hn) = CategoryTheory.CategoryStruct.id { obj := { len := n }, property := hn } - SimplexCategory.Truncated.Ξ΄β_two_comp_Οβ_one_assoc π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
{Z : CategoryTheory.ObjectProperty.FullSubcategory fun a => a.len β€ 2} (h : { obj := { len := 1 }, property := SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_1 } βΆ Z) : CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 2 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_1 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_2) (CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Οβ 1 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_2 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_1) h) = h - SimplexCategory.Truncated.Ξ΄β_one_comp_Οβ_zero_assoc π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
{n : β} (hn : { len := n }.len β€ 2 := by decide) (hn' : { len := n + 1 }.len β€ 2 := by decide) {Z : CategoryTheory.ObjectProperty.FullSubcategory fun a => a.len β€ 2} (h : { obj := { len := n }, property := hn } βΆ Z) : CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 1 hn hn') (CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Οβ 0 hn' hn) h) = h - SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_zero_assoc π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
{n : β} (hn : { len := n }.len β€ 2 := by decide) (hn' : { len := n + 1 }.len β€ 2 := by decide) {Z : CategoryTheory.ObjectProperty.FullSubcategory fun a => a.len β€ 2} (h : { obj := { len := n }, property := hn } βΆ Z) : CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 0 hn hn') (CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Οβ 0 hn' hn) h) = h - SimplexCategory.Truncated.Ξ΄β_two_comp_Οβ_zero π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
: CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 2 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_1 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_2) (SimplexCategory.Truncated.Οβ 0 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_2 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_1) = CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Οβ 0 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_4) (SimplexCategory.Truncated.Ξ΄β 1 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_4 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3) - SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
: CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 0 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_1 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_2) (SimplexCategory.Truncated.Οβ 1 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_2 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_1) = CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Οβ 0 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_4) (SimplexCategory.Truncated.Ξ΄β 0 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_4 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3) - SimplexCategory.Truncated.Ξ΄β_one_comp_Οβ_one π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
{n : β} (hn : { len := n + 1 }.len β€ 2 := by decide) (hn' : { len := n + 1 + 1 }.len β€ 2 := by decide) : CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 1 hn hn') (SimplexCategory.Truncated.Οβ 1 hn' hn) = CategoryTheory.CategoryStruct.id { obj := { len := n + 1 }, property := hn } - SimplexCategory.Truncated.Ξ΄β_one_comp_Οβ_one_assoc π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
{n : β} (hn : { len := n + 1 }.len β€ 2 := by decide) (hn' : { len := n + 1 + 1 }.len β€ 2 := by decide) {Z : CategoryTheory.ObjectProperty.FullSubcategory fun a => a.len β€ 2} (h : { obj := { len := n + 1 }, property := hn } βΆ Z) : CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 1 hn hn') (CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Οβ 1 hn' hn) h) = h - SimplexCategory.Truncated.Ξ΄β_zero_comp_Ξ΄β_two π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
: CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 0 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_4 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3) (SimplexCategory.Truncated.Ξ΄β 2 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3 SimplexCategory.Truncated.Ξ΄β_zero_comp_Ξ΄β_two._proof_1) = CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 1 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_4 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3) (SimplexCategory.Truncated.Ξ΄β 0 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3 SimplexCategory.Truncated.Ξ΄β_zero_comp_Ξ΄β_two._proof_1) - SimplexCategory.Truncated.Ξ΄β_two_comp_Οβ_zero_assoc π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
{Z : CategoryTheory.ObjectProperty.FullSubcategory fun a => a.len β€ 2} (h : { obj := { len := 1 }, property := SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_1 } βΆ Z) : CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 2 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_1 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_2) (CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Οβ 0 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_2 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_1) h) = CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Οβ 0 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_4) (CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 1 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_4 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3) h) - SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one_assoc π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
{Z : CategoryTheory.ObjectProperty.FullSubcategory fun a => a.len β€ 2} (h : { obj := { len := 1 }, property := SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_1 } βΆ Z) : CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 0 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_1 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_2) (CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Οβ 1 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_2 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_1) h) = CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Οβ 0 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_4) (CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 0 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_4 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3) h) - SimplexCategory.Truncated.Ξ΄β_zero_comp_Ξ΄β_two_assoc π Mathlib.AlgebraicTopology.SimplexCategory.Truncated
{Z : CategoryTheory.ObjectProperty.FullSubcategory fun a => a.len β€ 2} (h : { obj := { len := 0 + 1 + 1 }, property := SimplexCategory.Truncated.Ξ΄β_zero_comp_Ξ΄β_two._proof_1 } βΆ Z) : CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 0 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_4 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3) (CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 2 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3 SimplexCategory.Truncated.Ξ΄β_zero_comp_Ξ΄β_two._proof_1) h) = CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 1 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_4 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3) (CategoryTheory.CategoryStruct.comp (SimplexCategory.Truncated.Ξ΄β 0 SimplexCategory.Truncated.Ξ΄β_zero_comp_Οβ_one._proof_3 SimplexCategory.Truncated.Ξ΄β_zero_comp_Ξ΄β_two._proof_1) h) - 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β
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