Loogle!
Result
Found 70 declarations mentioning SSet.Subcomplex.ofSimplex.
- SSet.Subcomplex.ofSimplex π Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {n : β} (x : X.obj (Opposite.op { len := n })) : X.Subcomplex - SSet.Subcomplex.ofSimplex_ΞΉ π Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} (x : X.obj (Opposite.op { len := 0 })) : (SSet.Subcomplex.ofSimplex x).ΞΉ = SSet.const x - SSet.Subcomplex.mem_ofSimplex_obj π Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {n : β} (x : X.obj (Opposite.op { len := n })) : x β (SSet.Subcomplex.ofSimplex x).obj (Opposite.op { len := n }) - SSet.Subcomplex.ofSimplex_le_iff π Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {n : β} (x : X.obj (Opposite.op { len := n })) (A : X.Subcomplex) : SSet.Subcomplex.ofSimplex x β€ A β x β A.obj (Opposite.op { len := n }) - SSet.Subcomplex.image_ofSimplex π Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} {n : β} (x : X.obj (Opposite.op { len := n })) (f : X βΆ Y) : (SSet.Subcomplex.ofSimplex x).image f = SSet.Subcomplex.ofSimplex ((CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { len := n }))) x) - SSet.Subcomplex.ofSimplex_map_of_epi π Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {n m : β} (f : { len := n } βΆ { len := m }) [CategoryTheory.Epi f] (x : X.obj (Opposite.op { len := m })) : SSet.Subcomplex.ofSimplex ((CategoryTheory.ConcreteCategory.hom (X.map f.op)) x) = SSet.Subcomplex.ofSimplex x - SSet.Subcomplex.ofSimplex_map_le π Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {n m : β} (f : { len := n } βΆ { len := m }) (x : X.obj (Opposite.op { len := m })) : SSet.Subcomplex.ofSimplex ((CategoryTheory.ConcreteCategory.hom (X.map f.op)) x) β€ SSet.Subcomplex.ofSimplex x - SSet.Subcomplex.mem_ofSimplex_obj_iff π Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {n : β} (x : X.obj (Opposite.op { len := n })) {m : SimplexCategoryα΅α΅} (y : X.obj m) : y β (SSet.Subcomplex.ofSimplex x).obj m β β f, (CategoryTheory.ConcreteCategory.hom (X.map f.op)) x = y - SSet.Subcomplex.iSup_ofSimplex_nonDegenerate_eq_top π Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) : β¨ x, SSet.Subcomplex.ofSimplex βx.snd = β€ - SSet.S.ofSimplex_eq_subcomplex_mk π Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} {n : β} (x : X.obj (Opposite.op { len := n })) : SSet.Subcomplex.ofSimplex x = { dim := n, simplex := x }.subcomplex - SSet.S.eq_iff_ofSimplex_eq π Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {n m : β} (x : X.obj (Opposite.op { len := n })) (y : X.obj (Opposite.op { len := m })) (hx : x β X.nonDegenerate n) (hy : y β X.nonDegenerate m) : { dim := n, simplex := x } = { dim := m, simplex := y } β SSet.Subcomplex.ofSimplex x = SSet.Subcomplex.ofSimplex y - PartialOrder.nerve_ofSimplex_le_ofSimplex_iff π Mathlib.AlgebraicTopology.SimplicialSet.NerveNondegenerate
{X : Type u_1} [PartialOrder X] {n m : β} (s : (CategoryTheory.nerve X).obj (Opposite.op { len := n })) (t : (CategoryTheory.nerve X).obj (Opposite.op { len := m })) : SSet.Subcomplex.ofSimplex s β€ SSet.Subcomplex.ofSimplex t β Set.range s.obj β Set.range t.obj - SSet.stdSimplex.instFiniteToSSetOfSimplex π Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : β} (x : X.obj (Opposite.op { len := n })) : (SSet.Subcomplex.ofSimplex x).toSSet.Finite - SSet.Subcomplex.instEpiToOfSimplex π Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : β} (x : X.obj (Opposite.op { len := n })) : CategoryTheory.Epi (SSet.Subcomplex.toOfSimplex x) - SSet.Subcomplex.toOfSimplex π Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : β} (x : X.obj (Opposite.op { len := n })) : SSet.stdSimplex.obj { len := n } βΆ (SSet.Subcomplex.ofSimplex x).toSSet - SSet.Subcomplex.range_eq_ofSimplex π Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : β} (f : SSet.stdSimplex.obj { len := n } βΆ X) : SSet.Subcomplex.range f = SSet.Subcomplex.ofSimplex (SSet.yonedaEquiv f) - SSet.Subcomplex.isIso_toOfSimplex_iff π Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : β} (x : X.obj (Opposite.op { len := n })) : CategoryTheory.IsIso (SSet.Subcomplex.toOfSimplex x) β CategoryTheory.Mono (SSet.yonedaEquiv.symm x) - SSet.Subcomplex.toOfSimplex_ΞΉ π Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : β} (x : X.obj (Opposite.op { len := n })) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.toOfSimplex x) (SSet.Subcomplex.ofSimplex x).ΞΉ = SSet.yonedaEquiv.symm x - SSet.Subcomplex.toOfSimplex_ΞΉ_assoc π Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : β} (x : X.obj (Opposite.op { len := n })) {Z : SSet} (h : X βΆ Z) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.toOfSimplex x) (CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.ofSimplex x).ΞΉ h) = CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm x) h - SSet.Subcomplex.yonedaEquiv_toOfSimplex π Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : β} (x : X.obj (Opposite.op { len := n })) : SSet.yonedaEquiv (SSet.Subcomplex.toOfSimplex x) = β¨x, β―β© - SSet.stdSimplex.ofSimplex_objEquiv_symm_id π Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : β) : SSet.Subcomplex.ofSimplex (SSet.stdSimplex.objEquiv.symm (CategoryTheory.CategoryStruct.id { len := n })) = β€ - SSet.stdSimplex.mem_ofSimplex_obj_iff π Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n m : β} (x : X.obj (Opposite.op { len := n })) (y : X.obj (Opposite.op { len := m })) : y β (SSet.Subcomplex.ofSimplex x).obj (Opposite.op { len := m }) β β z, y = (CategoryTheory.ConcreteCategory.hom ((SSet.yonedaEquiv.symm x).app (Opposite.op { len := m }))) z - SSet.stdSimplex.face_singleton_compl π Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : β} (i : Fin (n + 2)) : SSet.stdSimplex.face {i}αΆ = SSet.Subcomplex.ofSimplex (SSet.stdSimplex.objEquiv.symm (SimplexCategory.Ξ΄ i)) - SSet.stdSimplex.ofSimplex_yonedaEquiv_Ξ΄ π Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : β} (i : Fin (n + 2)) : SSet.Subcomplex.ofSimplex (SSet.yonedaEquiv (SSet.stdSimplex.Ξ΄ i)) = SSet.stdSimplex.face {i}αΆ - SSet.stdSimplex.face_nonDegenerateEquiv' π Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : β} (x : β((SSet.stdSimplex.obj { len := n }).nonDegenerate d)) : SSet.stdSimplex.face β(SSet.stdSimplex.nonDegenerateEquiv' x) = SSet.Subcomplex.ofSimplex βx - SSet.stdSimplex.face_eq_ofSimplex π Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : β} (S : Finset (Fin (n + 1))) (m : β) (e : Fin (m + 1) βo β₯S) : SSet.stdSimplex.face S = SSet.Subcomplex.ofSimplex (SSet.stdSimplex.objMk ((OrderHom.Subtype.val fun x => x β S).comp e.toOrderEmbedding.toOrderHom)) - SSet.ofSimplex_le_skeleton π Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
(X : SSet) {i : β} (x : X.obj (Opposite.op { len := i })) {n : β} (hi : i < n) : SSet.Subcomplex.ofSimplex x β€ X.skeleton n - SSet.skeleton_succ π Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
(X : SSet) (n : β) : X.skeleton (n + 1) = X.skeleton n β β¨ x, SSet.Subcomplex.ofSimplex βx - SSet.skeletonOfMono_succ π Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X βΆ Y) (n : β) : (SSet.skeletonOfMono i) (n + 1) = (SSet.skeletonOfMono i) n β β¨ x, β¨ (_ : βx β (SSet.Subcomplex.range i).obj (Opposite.op { len := n })), SSet.Subcomplex.ofSimplex βx - SSet.prodStdSimplex.exists_nonDegenerate_max_dim π Mathlib.AlgebraicTopology.SimplicialSet.ProdStdSimplex
{p q d : β} (x : β((CategoryTheory.MonoidalCategoryStruct.tensorObj (SSet.stdSimplex.obj { len := p }) (SSet.stdSimplex.obj { len := q })).nonDegenerate d)) {n : β} (hn : p + q = n) : β y, βx β (SSet.Subcomplex.ofSimplex βy).obj (Opposite.op { len := d }) - SSet.prodStdSimplex.ofSimplex_le_ofSimplex_iff π Mathlib.AlgebraicTopology.SimplicialSet.ProdStdSimplex
{p q n m : β} (s : (CategoryTheory.MonoidalCategoryStruct.tensorObj (SSet.stdSimplex.obj { len := p }) (SSet.stdSimplex.obj { len := q })).obj (Opposite.op { len := n })) (t : (CategoryTheory.MonoidalCategoryStruct.tensorObj (SSet.stdSimplex.obj { len := p }) (SSet.stdSimplex.obj { len := q })).obj (Opposite.op { len := m })) : SSet.Subcomplex.ofSimplex s β€ SSet.Subcomplex.ofSimplex t β Set.range β(SSet.prodStdSimplex.objEquiv s) β Set.range β(SSet.prodStdSimplex.objEquiv t) - SSet.Nonsingular.iso π Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {n : β} (x : X.obj (Opposite.op { len := n })) (hx : x β X.nonDegenerate n) : SSet.stdSimplex.obj { len := n } β (SSet.Subcomplex.ofSimplex x).toSSet - SSet.Nonsingular.isIso_toOfSimplex π Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {n : β} (x : X.obj (Opposite.op { len := n })) (hx : x β X.nonDegenerate n) : CategoryTheory.IsIso (SSet.Subcomplex.toOfSimplex x) - SSet.Nonsingular.iso_hom π Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {n : β} (x : X.obj (Opposite.op { len := n })) (hx : x β X.nonDegenerate n) : (SSet.Nonsingular.iso x hx).hom = SSet.Subcomplex.toOfSimplex x - SSet.Subcomplex.ofSimplexProd_eq_range π Mathlib.AlgebraicTopology.SimplicialSet.FiniteProd
{Xβ Xβ : SSet} {p q : β} (xβ : Xβ.obj (Opposite.op { len := p })) (xβ : Xβ.obj (Opposite.op { len := q })) : (SSet.Subcomplex.ofSimplex xβ).prod (SSet.Subcomplex.ofSimplex xβ) = SSet.Subcomplex.range (CategoryTheory.MonoidalCategoryStruct.tensorHom (SSet.yonedaEquiv.symm xβ) (SSet.yonedaEquiv.symm xβ)) - SSet.iSup_subcomplexOfSimplex_prod_eq_top π Mathlib.AlgebraicTopology.SimplicialSet.FiniteProd
(Xβ Xβ : SSet) : β¨ xβ, β¨ xβ, (SSet.Subcomplex.ofSimplex xβ.simplex).prod (SSet.Subcomplex.ofSimplex xβ.simplex) = β€ - SSet.RelativeMorphism.const π Mathlib.AlgebraicTopology.SimplicialSet.RelativeMorphism
{X Y : SSet} {A : X.Subcomplex} {y : Y.obj (Opposite.op { len := 0 })} {Ο : A.toSSet βΆ (SSet.Subcomplex.ofSimplex y).toSSet} : SSet.RelativeMorphism A (SSet.Subcomplex.ofSimplex y) Ο - SSet.RelativeMorphism.const_map π Mathlib.AlgebraicTopology.SimplicialSet.RelativeMorphism
{X Y : SSet} {A : X.Subcomplex} {y : Y.obj (Opposite.op { len := 0 })} {Ο : A.toSSet βΆ (SSet.Subcomplex.ofSimplex y).toSSet} : SSet.RelativeMorphism.const.map = SSet.const y - SSet.RelativeMorphism.ofSimplexβ π Mathlib.AlgebraicTopology.SimplicialSet.RelativeMorphism
{X Y : SSet} (f : X βΆ Y) (x : X.obj (Opposite.op { len := 0 })) (y : Y.obj (Opposite.op { len := 0 })) (h : (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { len := 0 }))) x = y) : SSet.RelativeMorphism (SSet.Subcomplex.ofSimplex x) (SSet.Subcomplex.ofSimplex y) (SSet.const β¨y, β―β©) - SSet.RelativeMorphism.ofSimplexβ_map π Mathlib.AlgebraicTopology.SimplicialSet.RelativeMorphism
{X Y : SSet} (f : X βΆ Y) (x : X.obj (Opposite.op { len := 0 })) (y : Y.obj (Opposite.op { len := 0 })) (h : (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { len := 0 }))) x = y) : (SSet.RelativeMorphism.ofSimplexβ f x y h).map = f - SSet.PtSimplex.MulStruct.mulOne π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} (f : X.PtSimplex n x) (i : Fin n) : f.MulStruct SSet.RelativeMorphism.const f i - SSet.PtSimplex.MulStruct.oneMul π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} (f : X.PtSimplex n x) (i : Fin n) : SSet.PtSimplex.MulStruct SSet.RelativeMorphism.const f f i - SSet.PtSimplex.relStructCastSuccEquivMulStruct π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin n} : f.RelStruct g i.castSucc β SSet.PtSimplex.MulStruct SSet.RelativeMorphism.const f g i - SSet.PtSimplex.relStructSuccEquivMulStruct π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin n} : f.RelStruct g i.succ β g.MulStruct SSet.RelativeMorphism.const f i - SSet.PtSimplex.comp_map_eq_const π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} (s : X.PtSimplex n x) {Y : SSet} (Ο : Y βΆ SSet.stdSimplex.obj { len := n }) [Y.HasDimensionLT n] : CategoryTheory.CategoryStruct.comp Ο s.map = SSet.const x - SSet.PtSimplex.RelStruct.refl_map π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} (f : X.PtSimplex n x) (i : Fin (n + 1)) : (SSet.PtSimplex.RelStruct.refl f i).map = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ο i) f.map - SSet.PtSimplex.MulStruct.Ξ΄_castSucc_castSucc_map π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g fg : X.PtSimplex n x} {i : Fin n} (self : f.MulStruct g fg i) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i.castSucc.castSucc) self.map = g.map - SSet.PtSimplex.MulStruct.Ξ΄_succ_castSucc_map π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g fg : X.PtSimplex n x} {i : Fin n} (self : f.MulStruct g fg i) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i.castSucc.succ) self.map = fg.map - SSet.PtSimplex.MulStruct.Ξ΄_succ_succ_map π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g fg : X.PtSimplex n x} {i : Fin n} (self : f.MulStruct g fg i) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i.succ.succ) self.map = f.map - SSet.PtSimplex.RelStruct.Ξ΄_castSucc_map π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin (n + 1)} (self : f.RelStruct g i) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i.castSucc) self.map = f.map - SSet.PtSimplex.RelStruct.Ξ΄_succ_map π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin (n + 1)} (self : f.RelStruct g i) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i.succ) self.map = g.map - SSet.PtSimplex.comp_map_eq_const_assoc π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} (s : X.PtSimplex n x) {Y : SSet} (Ο : Y βΆ SSet.stdSimplex.obj { len := n }) [Y.HasDimensionLT n] {Z : SSet} (h : X βΆ Z) : CategoryTheory.CategoryStruct.comp Ο (CategoryTheory.CategoryStruct.comp s.map h) = CategoryTheory.CategoryStruct.comp (SSet.const x) h - SSet.PtSimplex.RelStruct.ofEq_map π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} (h : f = g) (i : Fin (n + 1)) : (SSet.PtSimplex.RelStruct.ofEq h i).map = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ο i) f.map - SSet.PtSimplex.Ξ΄_map π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} (f : X.PtSimplex (n + 1) x) (i : Fin (n + 2)) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i) f.map = SSet.const x - SSet.PtSimplex.MulStruct.Ξ΄_castSucc_castSucc_map_assoc π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g fg : X.PtSimplex n x} {i : Fin n} (self : f.MulStruct g fg i) {Z : SSet} (h : X βΆ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i.castSucc.castSucc) (CategoryTheory.CategoryStruct.comp self.map h) = CategoryTheory.CategoryStruct.comp g.map h - SSet.PtSimplex.MulStruct.Ξ΄_succ_castSucc_map_assoc π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g fg : X.PtSimplex n x} {i : Fin n} (self : f.MulStruct g fg i) {Z : SSet} (h : X βΆ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i.castSucc.succ) (CategoryTheory.CategoryStruct.comp self.map h) = CategoryTheory.CategoryStruct.comp fg.map h - SSet.PtSimplex.MulStruct.Ξ΄_succ_succ_map_assoc π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g fg : X.PtSimplex n x} {i : Fin n} (self : f.MulStruct g fg i) {Z : SSet} (h : X βΆ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i.succ.succ) (CategoryTheory.CategoryStruct.comp self.map h) = CategoryTheory.CategoryStruct.comp f.map h - SSet.PtSimplex.RelStruct.Ξ΄_castSucc_map_assoc π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin (n + 1)} (self : f.RelStruct g i) {Z : SSet} (h : X βΆ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i.castSucc) (CategoryTheory.CategoryStruct.comp self.map h) = CategoryTheory.CategoryStruct.comp f.map h - SSet.PtSimplex.RelStruct.Ξ΄_succ_map_assoc π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin (n + 1)} (self : f.RelStruct g i) {Z : SSet} (h : X βΆ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i.succ) (CategoryTheory.CategoryStruct.comp self.map h) = CategoryTheory.CategoryStruct.comp g.map h - SSet.PtSimplex.Ξ΄_map_assoc π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} (f : X.PtSimplex (n + 1) x) (i : Fin (n + 2)) {Z : SSet} (h : X βΆ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i) (CategoryTheory.CategoryStruct.comp f.map h) = CategoryTheory.CategoryStruct.comp (SSet.const x) h - SSet.PtSimplex.MulStruct.mulOne_map π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} (f : X.PtSimplex n x) (i : Fin n) : (SSet.PtSimplex.MulStruct.mulOne f i).map = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ο i.succ) f.map - SSet.PtSimplex.MulStruct.oneMul_map π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} (f : X.PtSimplex n x) (i : Fin n) : (SSet.PtSimplex.MulStruct.oneMul f i).map = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ο i.castSucc) f.map - SSet.PtSimplex.RelStruct.mk π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin (n + 1)} (map : SSet.stdSimplex.obj { len := n + 1 } βΆ X) (Ξ΄_castSucc_map : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i.castSucc) map = f.map := by cat_disch) (Ξ΄_succ_map : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i.succ) map = g.map := by cat_disch) (Ξ΄_map_of_lt : β j < i.castSucc, CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ j) map = SSet.const x := by cat_disch) (Ξ΄_map_of_gt : β (j : Fin (n + 2)), i.succ < j β CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ j) map = SSet.const x := by cat_disch) : f.RelStruct g i - SSet.PtSimplex.relStructCastSuccEquivMulStruct_apply_map π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin n} (h : f.RelStruct g i.castSucc) : (SSet.PtSimplex.relStructCastSuccEquivMulStruct h).map = h.map - SSet.PtSimplex.relStructSuccEquivMulStruct_apply_map π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin n} (h : f.RelStruct g i.succ) : (SSet.PtSimplex.relStructSuccEquivMulStruct h).map = h.map - SSet.PtSimplex.MulStruct.mk π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g fg : X.PtSimplex n x} {i : Fin n} (map : SSet.stdSimplex.obj { len := n + 1 } βΆ X) (Ξ΄_castSucc_castSucc_map : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i.castSucc.castSucc) map = g.map := by cat_disch) (Ξ΄_succ_castSucc_map : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i.castSucc.succ) map = fg.map := by cat_disch) (Ξ΄_succ_succ_map : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ i.succ.succ) map = f.map := by cat_disch) (Ξ΄_map_of_lt : β j < i.castSucc.castSucc, CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ j) map = SSet.const x := by cat_disch) (Ξ΄_map_of_gt : β (j : Fin (n + 2)), i.succ.succ < j β CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.Ξ΄ j) map = SSet.const x := by cat_disch) : f.MulStruct g fg i - SSet.PtSimplex.relStructCastSuccEquivMulStruct_symm_apply_map π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin n} (h : SSet.PtSimplex.MulStruct SSet.RelativeMorphism.const f g i) : (SSet.PtSimplex.relStructCastSuccEquivMulStruct.symm h).map = h.map - SSet.PtSimplex.relStructSuccEquivMulStruct_symm_apply_map π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin n} (h : g.MulStruct SSet.RelativeMorphism.const f i) : (SSet.PtSimplex.relStructSuccEquivMulStruct.symm h).map = h.map - SSet.PtSimplex.opEquiv_symm_apply_map π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} (g : X.PtSimplex n x) : (SSet.PtSimplex.opEquiv.symm g).map = SSet.yonedaEquiv.symm (SSet.opObjEquiv.symm (SSet.yonedaEquiv g.map)) - SSet.PtSimplex.opEquiv_apply_map π Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : β} {x : X.obj (Opposite.op { len := 0 })} (f : X.op.PtSimplex n (SSet.opObjEquiv.symm x)) : (SSet.PtSimplex.opEquiv f).map = SSet.yonedaEquiv.symm (SSet.opObjEquiv (SSet.yonedaEquiv f.map))
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