Loogle!
Result
Found 615 declarations mentioning SSet.stdSimplex. Of these, only the first 200 are shown.
- SSet.stdSimplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
: CategoryTheory.CosimplicialObject SSet - SSet.stdSimplex.fullyFaithful 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
: CategoryTheory.Functor.FullyFaithful SSet.stdSimplex - SSet.stdSimplex.instFaithfulSimplexCategory 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
: CategoryTheory.Functor.Faithful SSet.stdSimplex - SSet.stdSimplex.instFullSimplexCategory 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
: CategoryTheory.Functor.Full SSet.stdSimplex - SSet.stdSimplex.instFiniteObjSimplexCategory 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : SimplexCategory) : (SSet.stdSimplex.obj n).Finite - SSet.stdSimplex.instHasDimensionLEObjSimplexCategoryMk 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : ℕ) : (SSet.stdSimplex.obj { len := n }).HasDimensionLE n - SSet.stdSimplex.not_hasDimensionLT 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : ℕ) : autoParam ((SSet.stdSimplex.obj { len := n }).HasDimensionLT n) SSet.stdSimplex.not_hasDimensionLT._auto_1 → False - SSet.stdSimplex.instDecidableEqObjOppositeSimplexCategory 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : SimplexCategory) (m : SimplexCategoryᵒᵖ) : DecidableEq ((SSet.stdSimplex.obj n).obj m) - SSet.stdSimplex.instFiniteObjOppositeSimplexCategory 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : SimplexCategory) (d : SimplexCategoryᵒᵖ) : Finite ((SSet.stdSimplex.obj n).obj d) - SSet.stdSimplex.face 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (S : Finset (Fin (n + 1))) : (SSet.stdSimplex.obj { len := n }).Subcomplex - SSet.stdSimplex.isoOfRepresentableBy 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {m : ℕ} (h : CategoryTheory.Functor.RepresentableBy X { len := m }) : SSet.stdSimplex.obj { len := m } ≅ X - SSet.stdSimplex.objEquiv 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : SimplexCategory} {m : SimplexCategoryᵒᵖ} : (SSet.stdSimplex.obj n).obj m ≃ (Opposite.unop m ⟶ n) - SSet.stdSimplex.opIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : SimplexCategory) : (SSet.stdSimplex.obj n).op ≅ SSet.stdSimplex.obj n - SSet.stdSimplex.const 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : ℕ) (k : Fin (n + 1)) (m : SimplexCategoryᵒᵖ) : (SSet.stdSimplex.obj { len := n }).obj m - SSet.yonedaEquiv 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : SimplexCategory} : (SSet.stdSimplex.obj n ⟶ X) ≃ X.obj (Opposite.op n) - SSet.instDecidableEqHomObjSimplexCategoryStdSimplexOfOppositeOp 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(X : SSet) (n : SimplexCategory) [DecidableEq (X.obj (Opposite.op n))] : DecidableEq (SSet.stdSimplex.obj n ⟶ X) - SSet.stdSimplex.obj₀Equiv 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := 0 }) ≃ Fin (n + 1) - 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.stdSimplex.opObjEquiv 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : SimplexCategory} {d : SimplexCategoryᵒᵖ} : (SSet.stdSimplex.obj n).op.obj d ≃ (SSet.stdSimplex.obj n).obj d - SSet.stdSimplex.hasDimensionLT_face 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (S : Finset (Fin (n + 1))) (d : ℕ) (hd : S.card ≤ d) : (SSet.stdSimplex.face S).toSSet.HasDimensionLT d - SSet.stdSimplex.instFunLikeObjOppositeSimplexCategoryMkOpFinHAddNatOfNat 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n i : ℕ) : FunLike ((SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := i })) (Fin (i + 1)) (Fin (n + 1)) - SSet.Augmented.stdSimplex_obj_left 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(Δ : SimplexCategory) : (SSet.Augmented.stdSimplex.obj Δ).left = SSet.stdSimplex.obj Δ - SSet.stdSimplex.edge 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : ℕ) (a b : Fin (n + 1)) (hab : a ≤ b) : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := 1 }) - SSet.stdSimplex.isoNerve 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : ℕ) : SSet.stdSimplex.obj { len := n } ≅ CategoryTheory.nerve (ULift.{u, 0} (Fin (n + 1))) - SSet.stdSimplex.nonDegenerateEquiv 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} : ↑((SSet.stdSimplex.obj { len := n }).nonDegenerate d) ≃ (Fin (d + 1) ↪o Fin (n + 1)) - SSet.stdSimplex.faceSingletonIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i : Fin (n + 1)) : SSet.stdSimplex.obj { len := 0 } ≅ (SSet.stdSimplex.face {i}).toSSet - SSet.stdSimplex.asOrderHom 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} {m : SimplexCategoryᵒᵖ} (α : (SSet.stdSimplex.obj { len := n }).obj m) : Fin ((Opposite.unop m).len + 1) →o Fin (n + 1) - SSet.stdSimplex.objMk 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : SimplexCategory} {m : SimplexCategoryᵒᵖ} (f : Fin ((Opposite.unop m).len + 1) →o Fin (n.len + 1)) : (SSet.stdSimplex.obj n).obj m - SSet.stdSimplex.nonDegenerateEquiv' 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} : ↑((SSet.stdSimplex.obj { len := n }).nonDegenerate d) ≃ ↑{S | S.card = d + 1} - SSet.stdSimplex.objMk_bijective 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : SimplexCategory} {m : SimplexCategoryᵒᵖ} : Function.Bijective SSet.stdSimplex.objMk - SSet.stdSimplex.map_id 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : SimplexCategory) : SSet.stdSimplex.map (SimplexCategory.Hom.mk OrderHom.id) = CategoryTheory.CategoryStruct.id (SSet.stdSimplex.obj n) - SSet.stdSimplex.triangle 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (a b c : Fin (n + 1)) (hab : a ≤ b) (hbc : b ≤ c) : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := 2 }) - SSet.stdSimplex.face_le_face_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (S₁ S₂ : Finset (Fin (n + 1))) : SSet.stdSimplex.face S₁ ≤ SSet.stdSimplex.face S₂ ↔ S₁ ⊆ S₂ - SSet.stdSimplex.monotone_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n i : ℕ} (x : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := i })) : Monotone fun j => x j - SSet.stdSimplex.facePairIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i j : Fin (n + 1)) (hij : i < j) : SSet.stdSimplex.obj { len := 1 } ≅ (SSet.stdSimplex.face {i, j}).toSSet - SSet.stdSimplex.face_inter_face 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (S₁ S₂ : Finset (Fin (n + 1))) : SSet.stdSimplex.face S₁ ⊓ SSet.stdSimplex.face S₂ = SSet.stdSimplex.face (S₁ ⊓ S₂) - SSet.Augmented.stdSimplex_obj_hom_app 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(Δ : SimplexCategory) (x✝ : SimplexCategoryᵒᵖ) : (SSet.Augmented.stdSimplex.obj Δ).hom.app x✝ = CategoryTheory.Limits.terminal.from (((CategoryTheory.Functor.id (CategoryTheory.SimplicialObject (Type u))).obj (SSet.stdSimplex.obj Δ)).obj x✝) - SSet.stdSimplex.ext 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} (x y : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := d })) (h : ∀ (i : Fin (d + 1)), x i = y i) : x = y - SSet.stdSimplex.ext_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} {x y : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := d })} : x = y ↔ ∀ (i : Fin (d + 1)), x i = y i - SSet.stdSimplex.faceSingletonComplIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i : Fin (n + 2)) : SSet.stdSimplex.obj { len := n } ≅ (SSet.stdSimplex.face {i}ᶜ).toSSet - SSet.stdSimplex.mem_nonDegenerate_iff_strictMono 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} (s : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := d })) : s ∈ (SSet.stdSimplex.obj { len := n }).nonDegenerate d ↔ StrictMono ⇑s - SSet.stdSimplex.faceRepresentableBy 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (S : Finset (Fin (n + 1))) (m : ℕ) (e : Fin (m + 1) ≃o ↥S) : CategoryTheory.Functor.RepresentableBy (SSet.stdSimplex.face S).toSSet { len := m } - 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.stdSimplex.range_δ 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i : Fin (n + 2)) : SSet.Subcomplex.range (SSet.stdSimplex.δ i) = SSet.stdSimplex.face {i}ᶜ - SSet.stdSimplex.mem_face_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (S : Finset (Fin (n + 1))) {d : ℕ} (x : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := d })) : x ∈ (SSet.stdSimplex.face S).obj (Opposite.op { len := d }) ↔ ∀ (i : Fin (d + 1)), x i ∈ S - SSet.stdSimplex.face_univ 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : ℕ) : SSet.stdSimplex.face Finset.univ = ⊤ - SSet.stdSimplex.obj₀Equiv_symm_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i : Fin (n + 1)) : SSet.stdSimplex.obj₀Equiv.symm i = SSet.stdSimplex.const n i (Opposite.op { len := 0 }) - SSet.stdSimplex.face_empty 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : ℕ) : SSet.stdSimplex.face ∅ = ⊥ - 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.yonedaEquiv_const 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} (x : X.obj (Opposite.op { len := 0 })) : SSet.yonedaEquiv (SSet.const x) = 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.stdSimplex.mem_nonDegenerate_iff_mono 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} (s : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := d })) : s ∈ (SSet.stdSimplex.obj { len := n }).nonDegenerate d ↔ CategoryTheory.Mono (SSet.stdSimplex.objEquiv s) - SSet.stdSimplex.objEquiv_symm_mem_nonDegenerate_iff_mono 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} (f : { len := d } ⟶ { len := n }) : SSet.stdSimplex.objEquiv.symm f ∈ (SSet.stdSimplex.obj { len := n }).nonDegenerate d ↔ CategoryTheory.Mono f - SSet.yonedaEquiv_symm_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} (x : X.obj (Opposite.op { len := 0 })) : SSet.yonedaEquiv.symm x = SSet.const x - SSet.stdSimplex.objMk_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n m : ℕ} (f : Fin (m + 1) →o Fin (n + 1)) (i : Fin (m + 1)) : (SSet.stdSimplex.objMk f) i = f i - SSet.stdSimplex.facePairComplIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i j : Fin (n + 3)) (h : i < j) : SSet.stdSimplex.obj { len := n } ≅ (SSet.stdSimplex.face {i, j}ᶜ).toSSet - 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.stdSimplex.obj₀Equiv_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (x : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := 0 })) : SSet.stdSimplex.obj₀Equiv x = x 0 - 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.objEquiv_symm_id_mem_nonDegenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : ℕ) : SSet.stdSimplex.objEquiv.symm (CategoryTheory.CategoryStruct.id (Opposite.unop (Opposite.op { len := n }))) ∈ (SSet.stdSimplex.obj { len := n }).nonDegenerate n - SSet.stdSimplex.nonDegenerate_top_dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : ℕ) : (SSet.stdSimplex.obj { len := n }).nonDegenerate n = {SSet.stdSimplex.objEquiv.symm (CategoryTheory.CategoryStruct.id (Opposite.unop (Opposite.op { len := n })))} - SSet.Augmented.stdSimplex_map_left 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X✝ Y✝ : SimplexCategory} (θ : X✝ ⟶ Y✝) : (SSet.Augmented.stdSimplex.map θ).left = SSet.stdSimplex.map θ - SSet.stdSimplex.obj₀Equiv_symm_mem_face_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (S : Finset (Fin (n + 1))) (i : Fin (n + 1)) : SSet.stdSimplex.obj₀Equiv.symm i ∈ (SSet.stdSimplex.face S).obj (Opposite.op { len := 0 }) ↔ i ∈ S - SSet.stdSimplex.faceSingletonIso_one_hom_comp_ι_eq_δ 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
: CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonIso 1).hom (SSet.stdSimplex.face {1}).ι = SSet.stdSimplex.δ 0 - SSet.stdSimplex.faceSingletonIso_zero_hom_comp_ι_eq_δ 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
: CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonIso 0).hom (SSet.stdSimplex.face {0}).ι = SSet.stdSimplex.δ 1 - SSet.stdSimplex.objEquiv_toOrderHom_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n i : ℕ} (x : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := i })) (j : Fin (i + 1)) : (SimplexCategory.Hom.toOrderHom (SSet.stdSimplex.objEquiv x)) j = x j - SSet.stdSimplex.σ_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} (x : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := d })) (i : Fin (d + 1)) (j : Fin (d + 2)) : ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ (SSet.stdSimplex.obj { len := n }) i)) x) j = x (i.predAbove j) - SSet.stdSimplex.opIso_hom_app_hom_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : SimplexCategory) (X : SimplexCategoryᵒᵖ) (x : (SSet.stdSimplex.obj n).op.obj X) : (CategoryTheory.ConcreteCategory.hom ((SSet.stdSimplex.opIso n).hom.app X)) x = SSet.stdSimplex.opObjEquiv 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.δ_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} (x : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := d + 1 })) (i : Fin (d + 2)) (j : Fin (d + 1)) : ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ (SSet.stdSimplex.obj { len := n }) i)) x) j = x (i.succAbove j) - SSet.stdSimplex.objEquiv_symm_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n m : ℕ} (f : { len := m } ⟶ { len := n }) (i : Fin (m + 1)) : (SSet.stdSimplex.objEquiv.symm f) i = (SimplexCategory.Hom.toOrderHom f) i - SSet.Subcomplex.yonedaEquiv_coe 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {A : X.Subcomplex} {n : SimplexCategory} (f : SSet.stdSimplex.obj n ⟶ A.toSSet) : ↑(SSet.yonedaEquiv f) = SSet.yonedaEquiv (CategoryTheory.CategoryStruct.comp f A.ι) - SSet.stdSimplex.opIso_inv_app_hom_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : SimplexCategory) (X : SimplexCategoryᵒᵖ) (x : (SSet.stdSimplex.obj n).obj X) : (CategoryTheory.ConcreteCategory.hom ((SSet.stdSimplex.opIso n).inv.app X)) x = SSet.stdSimplex.opObjEquiv.symm x - 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.yonedaEquiv_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n m : SimplexCategory} (f : n ⟶ m) : SSet.yonedaEquiv (SSet.stdSimplex.map f) = SSet.stdSimplex.objEquiv.symm f - SSet.stdSimplex.yonedaEquiv_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n m : SimplexCategory} (f : n ⟶ m) : SSet.yonedaEquiv (SSet.stdSimplex.map f) = SSet.stdSimplex.objEquiv.symm f - SSet.stdSimplex.objEquiv_yonedaEquiv_id 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : ℕ) : SSet.stdSimplex.objEquiv (SSet.yonedaEquiv (CategoryTheory.CategoryStruct.id (SSet.stdSimplex.obj { len := n }))) = CategoryTheory.CategoryStruct.id { len := n } - SSet.yonedaEquiv_comp 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X Y : SSet} {n : SimplexCategory} (f : SSet.stdSimplex.obj n ⟶ X) (g : X ⟶ Y) : SSet.yonedaEquiv (CategoryTheory.CategoryStruct.comp f g) = (CategoryTheory.ConcreteCategory.hom (g.app (Opposite.op n))) (SSet.yonedaEquiv f) - SSet.stdSimplex.faceSingletonIso_one_hom_comp_ι_eq_δ_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{Z : SSet} (h : SSet.stdSimplex.obj { len := 1 } ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonIso 1).hom (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.face {1}).ι h) = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) h - SSet.stdSimplex.faceSingletonIso_zero_hom_comp_ι_eq_δ_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{Z : SSet} (h : SSet.stdSimplex.obj { len := 1 } ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonIso 0).hom (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.face {0}).ι h) = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) h - 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.yonedaEquiv_naturality 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {m n : SimplexCategory} (f : m ⟶ n) (g : SSet.stdSimplex.obj n ⟶ X) : (CategoryTheory.ConcreteCategory.hom (X.map f.op)) (SSet.yonedaEquiv g) = SSet.yonedaEquiv (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.map f) g) - SSet.yonedaEquiv_symm_stdSimplex_id 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : SimplexCategory) : SSet.yonedaEquiv.symm (SSet.stdSimplex.objEquiv.symm (CategoryTheory.CategoryStruct.id n)) = CategoryTheory.CategoryStruct.id (SSet.stdSimplex.obj n) - SSet.stdSimplex.δ_one_eq_const 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
: SSet.stdSimplex.δ 1 = SSet.const (SSet.stdSimplex.obj₀Equiv.symm 0) - SSet.stdSimplex.δ_zero_eq_const 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
: SSet.stdSimplex.δ 0 = SSet.const (SSet.stdSimplex.obj₀Equiv.symm 1) - SSet.stdSimplex.map_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{m₁ m₂ : SimplexCategoryᵒᵖ} (f : m₁ ⟶ m₂) {n : SimplexCategory} (x : (SSet.stdSimplex.obj n).obj m₁) : (CategoryTheory.ConcreteCategory.hom ((SSet.stdSimplex.obj n).map f)) x = SSet.stdSimplex.objEquiv.symm (CategoryTheory.CategoryStruct.comp f.unop (SSet.stdSimplex.objEquiv x)) - SSet.yonedaEquiv_symm_comp 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X Y : SSet} {n : SimplexCategory} (x : X.obj (Opposite.op n)) (f : X ⟶ Y) : CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm x) f = SSet.yonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op n))) x) - SSet.stdSimplex.map_objEquiv_symm 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : SimplexCategory} {m m' : SimplexCategoryᵒᵖ} (f : Opposite.unop m ⟶ n) (g : m ⟶ m') : (CategoryTheory.ConcreteCategory.hom ((SSet.stdSimplex.obj n).map g)) (SSet.stdSimplex.objEquiv.symm f) = SSet.stdSimplex.objEquiv.symm (CategoryTheory.CategoryStruct.comp g.unop f) - SSet.stdSimplex.objEquiv_symm_comp 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n n' : SimplexCategory} {m : SimplexCategoryᵒᵖ} (f : Opposite.unop m ⟶ n) (g : n ⟶ n') : SSet.stdSimplex.objEquiv.symm (CategoryTheory.CategoryStruct.comp f g) = (CategoryTheory.ConcreteCategory.hom ((SSet.stdSimplex.map g).app m)) (SSet.stdSimplex.objEquiv.symm f) - SSet.yonedaEquiv_symm_naturality_left 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {m n : SimplexCategory} (f : m ⟶ n) (g : X.obj (Opposite.op n)) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.map f) (SSet.yonedaEquiv.symm g) = SSet.yonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (X.map f.op)) g) - SSet.stdSimplex.face_obj 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (S : Finset (Fin (n + 1))) (U : SimplexCategoryᵒᵖ) : (SSet.stdSimplex.face S).obj U = {f | Finset.image ⇑(SimplexCategory.Hom.toOrderHom (SSet.stdSimplex.objEquiv f)) ⊤ ⊆ S} - SSet.stdSimplex.map_objEquiv_op_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : SimplexCategory} (x : X.obj (Opposite.op n)) {m : SimplexCategoryᵒᵖ} (y : (SSet.stdSimplex.obj n).obj m) : (CategoryTheory.ConcreteCategory.hom (X.map (SSet.stdSimplex.objEquiv y).op)) x = (CategoryTheory.ConcreteCategory.hom ((SSet.yonedaEquiv.symm x).app m)) y - SSet.yonedaEquiv_symm_app_objEquiv_symm 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : SimplexCategory} (x : X.obj (Opposite.op n)) {m : SimplexCategoryᵒᵖ} (f : Opposite.unop m ⟶ n) : (CategoryTheory.ConcreteCategory.hom ((SSet.yonedaEquiv.symm x).app m)) (SSet.stdSimplex.objEquiv.symm f) = (CategoryTheory.ConcreteCategory.hom (X.map f.op)) x - SSet.yonedaEquiv_symm_naturality_left_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {m n : SimplexCategory} (f : m ⟶ n) (g : X.obj (Opposite.op n)) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.map f) (CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm g) h) = CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (X.map f.op)) g)) h - 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.opObjEquiv_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{d n : ℕ} (f : (SSet.stdSimplex.obj { len := n }).op.obj (Opposite.op { len := d })) (i : Fin (d + 1)) : (SSet.stdSimplex.opObjEquiv f) i = ((SSet.opObjEquiv f) i.rev).rev - SSet.yonedaEquiv_symm_app 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{S : SSet} {n m : SimplexCategory} (x : S.obj (Opposite.op n)) (α : (SSet.stdSimplex.obj n).obj (Opposite.op m)) : (CategoryTheory.ConcreteCategory.hom ((SSet.yonedaEquiv.symm x).app (Opposite.op m))) α = (CategoryTheory.ConcreteCategory.hom (S.map (SSet.stdSimplex.objEquiv α).op)) x - SSet.stdSimplex.faceSingletonComplIso_hom_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i : Fin (n + 2)) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso i).hom (SSet.stdSimplex.face {i}ᶜ).ι = SSet.stdSimplex.δ i - SSet.opObjEquiv_yonedaEquiv_const 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : SimplexCategory} (x : X.op.obj (Opposite.op { len := 0 })) : SSet.opObjEquiv (SSet.yonedaEquiv (SSet.const x)) = SSet.yonedaEquiv (SSet.const (SSet.opObjEquiv x)) - SSet.stdSimplex.opObjEquiv_opObjEquiv_symm_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{d n : ℕ} (f : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := d })) (i : Fin (d + 1)) : (SSet.opObjEquiv (SSet.stdSimplex.opObjEquiv.symm f)) i = (f i.rev).rev - SSet.Augmented.stdSimplex_map_right 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X✝ Y✝ : SimplexCategory} (θ : X✝ ⟶ Y✝) : (SSet.Augmented.stdSimplex.map θ).right = CategoryTheory.Limits.terminal.from { left := SSet.stdSimplex.obj X✝, right := ⊤_ Type u, hom := { app := fun x => CategoryTheory.Limits.terminal.from (((CategoryTheory.Functor.id (CategoryTheory.SimplicialObject (Type u))).obj (SSet.stdSimplex.obj X✝)).obj x), naturality := ⋯ } }.right - SSet.opObjEquiv_symm_yonedaEquiv_const 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : SimplexCategory} (x : X.obj (Opposite.op { len := 0 })) : SSet.opObjEquiv.symm (SSet.yonedaEquiv (SSet.const x)) = SSet.yonedaEquiv (SSet.const (SSet.opObjEquiv.symm x)) - SSet.stdSimplex.yonedaEquiv_σ_comp 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : ℕ} (g : SSet.stdSimplex.obj { len := n } ⟶ X) (i : Fin (n + 1)) : SSet.yonedaEquiv (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.σ i) g) = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ X i)) (SSet.yonedaEquiv g) - SSet.stdSimplex.yonedaEquiv_δ_comp 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : ℕ} (g : SSet.stdSimplex.obj { len := n + 1 } ⟶ X) (i : Fin (n + 2)) : SSet.yonedaEquiv (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i) g) = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X i)) (SSet.yonedaEquiv g) - SSet.yonedaEquiv_symm_app_id 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : ℕ} (x : X.obj (Opposite.op { len := n })) : (CategoryTheory.ConcreteCategory.hom ((SSet.yonedaEquiv.symm x).app (Opposite.op { len := n }))) (SSet.yonedaEquiv (CategoryTheory.CategoryStruct.id (SSet.stdSimplex.obj { len := n }))) = x - SSet.stdSimplex.isoNerve_hom_app_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} (s : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := d })) (i : Fin (d + 1)) : ((CategoryTheory.ConcreteCategory.hom ((SSet.stdSimplex.isoNerve.{u} n).hom.app (Opposite.op { len := d }))) s).obj i = { down := s i } - SSet.stdSimplex.map_rev_map_op_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d d' : ℕ} (f : { len := d } ⟶ { len := d' }) (g : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := d' })) (i : Fin (d + 1)) : ((CategoryTheory.ConcreteCategory.hom ((SSet.stdSimplex.obj { len := n }).map (SimplexCategory.rev.map f).op)) g) i = g ((CategoryTheory.ConcreteCategory.hom f) i.rev).rev - 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.Edge.δ_one_yonedaEquiv_symm 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {x₀ x₁ : X.obj (Opposite.op { len := 0 })} (e : SSet.Edge x₀ x₁) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) (SSet.yonedaEquiv.symm e.edge) = SSet.yonedaEquiv.symm x₀ - SSet.Edge.δ_zero_yonedaEquiv_symm 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {x₀ x₁ : X.obj (Opposite.op { len := 0 })} (e : SSet.Edge x₀ x₁) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) (SSet.yonedaEquiv.symm e.edge) = SSet.yonedaEquiv.symm x₁ - SSet.stdSimplex.σ_comp_yonedaEquiv_symm 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : ℕ} (x : X.obj (Opposite.op { len := n })) (i : Fin (n + 1)) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.σ i) (SSet.yonedaEquiv.symm x) = SSet.yonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ X i)) x) - SSet.stdSimplex.coe_asOrderHom_objEquiv_symm 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n m : ℕ} (α : { len := n } ⟶ { len := m }) : ⇑(SSet.stdSimplex.asOrderHom (SSet.stdSimplex.objEquiv.symm α)) = ⇑(CategoryTheory.ConcreteCategory.hom α) - SSet.stdSimplex.δ_comp_yonedaEquiv_symm 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {n : ℕ} (x : X.obj (Opposite.op { len := n + 1 })) (i : Fin (n + 2)) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i) (SSet.yonedaEquiv.symm x) = SSet.yonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X i)) x) - SSet.stdSimplex.σ_objEquiv_symm_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} {m : SimplexCategory} (f : { len := n } ⟶ m) (i : Fin (n + 1)) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ (SSet.stdSimplex.obj m) i)) (SSet.stdSimplex.objEquiv.symm f) = SSet.stdSimplex.objEquiv.symm (CategoryTheory.CategoryStruct.comp (SimplexCategory.σ i) f) - SSet.stdSimplex.δ_objEquiv_symm_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} {m : SimplexCategory} (f : { len := n + 1 } ⟶ m) (i : Fin (n + 2)) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ (SSet.stdSimplex.obj m) i)) (SSet.stdSimplex.objEquiv.symm f) = SSet.stdSimplex.objEquiv.symm (CategoryTheory.CategoryStruct.comp (SimplexCategory.δ i) f) - SSet.Edge.CompStruct.δ_one_yonedaEquiv_symm 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {x₀ x₁ x₂ : X.obj (Opposite.op { len := 0 })} {e₀₁ : SSet.Edge x₀ x₁} {e₁₂ : SSet.Edge x₁ x₂} {e₀₂ : SSet.Edge x₀ x₂} (h : e₀₁.CompStruct e₁₂ e₀₂) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) (SSet.yonedaEquiv.symm h.simplex) = SSet.yonedaEquiv.symm e₀₂.edge - SSet.Edge.CompStruct.δ_two_yonedaEquiv_symm 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {x₀ x₁ x₂ : X.obj (Opposite.op { len := 0 })} {e₀₁ : SSet.Edge x₀ x₁} {e₁₂ : SSet.Edge x₁ x₂} {e₀₂ : SSet.Edge x₀ x₂} (h : e₀₁.CompStruct e₁₂ e₀₂) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) (SSet.yonedaEquiv.symm h.simplex) = SSet.yonedaEquiv.symm e₀₁.edge - SSet.Edge.CompStruct.δ_zero_yonedaEquiv_symm 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {x₀ x₁ x₂ : X.obj (Opposite.op { len := 0 })} {e₀₁ : SSet.Edge x₀ x₁} {e₁₂ : SSet.Edge x₁ x₂} {e₀₂ : SSet.Edge x₀ x₂} (h : e₀₁.CompStruct e₁₂ e₀₂) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) (SSet.yonedaEquiv.symm h.simplex) = SSet.yonedaEquiv.symm e₁₂.edge - SSet.stdSimplex.isoNerve_inv_app_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} (F : (CategoryTheory.nerve (ULift.{u, 0} (Fin (n + 1)))).obj (Opposite.op { len := d })) (i : Fin (d + 1)) : ((CategoryTheory.ConcreteCategory.hom ((SSet.stdSimplex.isoNerve.{u} n).inv.app (Opposite.op { len := d }))) F) i = (F.obj i).down - SSet.Edge.δ_one_yonedaEquiv_symm_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {x₀ x₁ : X.obj (Opposite.op { len := 0 })} (e : SSet.Edge x₀ x₁) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) (CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm e.edge) h) = CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm x₀) h - SSet.Edge.δ_zero_yonedaEquiv_symm_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {x₀ x₁ : X.obj (Opposite.op { len := 0 })} (e : SSet.Edge x₀ x₁) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) (CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm e.edge) h) = CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm x₁) h - SSet.Edge.CompStruct.δ_one_yonedaEquiv_symm_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {x₀ x₁ x₂ : X.obj (Opposite.op { len := 0 })} {e₀₁ : SSet.Edge x₀ x₁} {e₁₂ : SSet.Edge x₁ x₂} {e₀₂ : SSet.Edge x₀ x₂} (h : e₀₁.CompStruct e₁₂ e₀₂) {Z : SSet} (h✝ : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) (CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm h.simplex) h✝) = CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm e₀₂.edge) h✝ - SSet.Edge.CompStruct.δ_two_yonedaEquiv_symm_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {x₀ x₁ x₂ : X.obj (Opposite.op { len := 0 })} {e₀₁ : SSet.Edge x₀ x₁} {e₁₂ : SSet.Edge x₁ x₂} {e₀₂ : SSet.Edge x₀ x₂} (h : e₀₁.CompStruct e₁₂ e₀₂) {Z : SSet} (h✝ : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) (CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm h.simplex) h✝) = CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm e₀₁.edge) h✝ - SSet.Edge.CompStruct.δ_zero_yonedaEquiv_symm_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{X : SSet} {x₀ x₁ x₂ : X.obj (Opposite.op { len := 0 })} {e₀₁ : SSet.Edge x₀ x₁} {e₁₂ : SSet.Edge x₁ x₂} {e₀₂ : SSet.Edge x₀ x₂} (h : e₀₁.CompStruct e₁₂ e₀₂) {Z : SSet} (h✝ : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) (CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm h.simplex) h✝) = CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm e₁₂.edge) h✝ - SSet.stdSimplex.nonDegenerateEquiv'_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} (x : ↑((SSet.stdSimplex.obj { len := n }).nonDegenerate d)) (j : Fin (n + 1)) : j ∈ ↑(SSet.stdSimplex.nonDegenerateEquiv' x) ↔ ∃ i, ↑x i = j - SSet.stdSimplex.faceSingletonComplIso_hom_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i : Fin (n + 2)) {Z : SSet} (h : SSet.stdSimplex.obj { len := n + 1 } ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso i).hom (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.face {i}ᶜ).ι h) = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i) h - SSet.stdSimplex.nonDegenerateEquiv_symm_apply_coe 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} (s : Fin (d + 1) ↪o Fin (n + 1)) : ↑(SSet.stdSimplex.nonDegenerateEquiv.symm s) = SSet.stdSimplex.objEquiv.symm (SimplexCategory.Hom.mk s.toOrderHom) - 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.stdSimplex.nonDegenerateEquiv'_symm_apply_mem 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} (S : ↑{S | S.card = d + 1}) (i : Fin (d + 1)) : ↑(SSet.stdSimplex.nonDegenerateEquiv'.symm S) i ∈ ↑S - SSet.stdSimplex.facePairComplIso_hom_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i j : Fin (n + 3)) (h : i < j) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.facePairComplIso i j h).hom (SSet.stdSimplex.face {i, j}ᶜ).ι = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ (i.castPred ⋯)) (SSet.stdSimplex.δ j) - SSet.stdSimplex.facePairComplIso_hom_ι' 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i j : Fin (n + 3)) (h : i < j) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.facePairComplIso i j h).hom (SSet.stdSimplex.face {i, j}ᶜ).ι = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ (j.pred ⋯)) (SSet.stdSimplex.δ i) - SSet.stdSimplex.nonDegenerateEquiv'_symm_mem_iff_face_le 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} (S : ↑{S | S.card = d + 1}) (A : (SSet.stdSimplex.obj { len := n }).Subcomplex) : ↑(SSet.stdSimplex.nonDegenerateEquiv'.symm S) ∈ A.obj (Opposite.op { len := d }) ↔ SSet.stdSimplex.face ↑S ≤ A - SSet.stdSimplex.nonDegenerateEquiv_apply_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} (s : ↑((SSet.stdSimplex.obj { len := n }).nonDegenerate d)) (a : Fin (d + 1)) : (SSet.stdSimplex.nonDegenerateEquiv s) a = ↑s a - SSet.stdSimplex.facePairComplIso_hom_ι'_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i j : Fin (n + 3)) (h : i < j) {Z : SSet} (h✝ : SSet.stdSimplex.obj { len := n + 2 } ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.facePairComplIso i j h).hom (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.face {i, j}ᶜ).ι h✝) = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ (j.pred ⋯)) (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i) h✝) - SSet.stdSimplex.facePairComplIso_hom_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i j : Fin (n + 3)) (h : i < j) {Z : SSet} (h✝ : SSet.stdSimplex.obj { len := n + 2 } ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.facePairComplIso i j h).hom (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.face {i, j}ᶜ).ι h✝) = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ (i.castPred ⋯)) (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ j) h✝) - SSet.stdSimplex.orderIsoOfNonDegenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} (x : ↑((SSet.stdSimplex.obj { len := n }).nonDegenerate d)) : Fin (d + 1) ≃o ↥↑(SSet.stdSimplex.nonDegenerateEquiv' x) - SSet.stdSimplex.homOfLE_faceSingletonComplIso_inv_eq_facePairComplIso_inv_δ_castPred 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i j : Fin (n + 3)) (h : i < j) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.homOfLE ⋯) (SSet.stdSimplex.faceSingletonComplIso j).inv = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.facePairComplIso i j h).inv (SSet.stdSimplex.δ (i.castPred ⋯)) - SSet.stdSimplex.homOfLE_faceSingletonComplIso_inv_eq_facePairComplIso_inv_δ_pred 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i j : Fin (n + 3)) (h : i < j) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.homOfLE ⋯) (SSet.stdSimplex.faceSingletonComplIso i).inv = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.facePairComplIso i j h).inv (SSet.stdSimplex.δ (j.pred ⋯)) - SSet.stdSimplex.homOfLE_faceSingletonComplIso_inv_eq_facePairComplIso_inv_δ_castPred_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i j : Fin (n + 3)) (h : i < j) {Z : SSet} (h✝ : SSet.stdSimplex.obj { len := n + 1 } ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.homOfLE ⋯) (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso j).inv h✝) = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.facePairComplIso i j h).inv (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ (i.castPred ⋯)) h✝) - SSet.stdSimplex.homOfLE_faceSingletonComplIso_inv_eq_facePairComplIso_inv_δ_pred_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i j : Fin (n + 3)) (h : i < j) {Z : SSet} (h✝ : SSet.stdSimplex.obj { len := n + 1 } ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.homOfLE ⋯) (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso i).inv h✝) = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.facePairComplIso i j h).inv (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ (j.pred ⋯)) h✝) - SSet.horn 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i : Fin (n + 1)) : (SSet.stdSimplex.obj { len := n }).Subcomplex - SSet.instHasDimensionLTToSSetHorn 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i : Fin (n + 1)) : (SSet.horn n i).toSSet.HasDimensionLT n - SSet.horn.face 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) (h : j ≠ i) : (SSet.horn (n + 1) i).toSSet.obj (Opposite.op { len := n }) - SSet.horn.const 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i k : Fin (n + 3)) (m : SimplexCategoryᵒᵖ) : ↑((SSet.horn (n + 2) i).obj m) - SSet.horn.edge₃ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i a b : Fin (n + 1)) (hab : a ≤ b) (H : 3 ≤ n) : (SSet.horn n i).toSSet.obj (Opposite.op { len := 1 }) - SSet.horn.ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) (hij : j ≠ i) : SSet.stdSimplex.obj { len := n } ⟶ (SSet.horn (n + 1) i).toSSet - SSet.horn_obj_eq_univ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i : Fin (n + 1)) (m : ℕ) (h : m + 1 < n := by lia) : (SSet.horn n i).obj (Opposite.op { len := m }) = Set.univ - SSet.op_horn 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i : Fin (n + 1)) : (SSet.horn n i).op.preimage (SSet.stdSimplex.opIso { len := n }).inv = SSet.horn n i.rev - SSet.horn.primitiveEdge 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} {i : Fin (n + 1)} (h₀ : 0 < i) (hₙ : i < Fin.last n) (j : Fin n) : (SSet.horn n i).toSSet.obj (Opposite.op { len := 1 }) - SSet.horn.primitiveTriangle 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i : Fin (n + 4)) (h₀ : 0 < i) (hₙ : i < Fin.last (n + 3)) (k : ℕ) (h : k < n + 2) : (SSet.horn (n + 3) i).toSSet.obj (Opposite.op { len := 2 }) - SSet.horn.faceι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 1)) (hij : j ≠ i) : (SSet.stdSimplex.face {j}ᶜ).toSSet ⟶ (SSet.horn n i).toSSet - SSet.face_le_horn 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 1)) (h : i ≠ j) : SSet.stdSimplex.face {i}ᶜ ≤ SSet.horn n j - SSet.horn_obj_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i : Fin (n + 3)) : (SSet.horn (n + 2) i).obj (Opposite.op { len := 0 }) = ⊤ - SSet.horn.ι_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) (hij : j ≠ i) : CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hij) (SSet.horn (n + 1) i).ι = SSet.stdSimplex.δ j - SSet.horn.edge 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i a b : Fin (n + 1)) (hab : a ≤ b) (H : {i, a, b}.card ≤ n) : (SSet.horn n i).toSSet.obj (Opposite.op { len := 1 }) - SSet.face_le_horn_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (S : Finset (Fin (n + 2))) (j : Fin (n + 2)) : SSet.stdSimplex.face S ≤ SSet.horn (n + 1) j ↔ S ≠ Finset.univ ∧ S ≠ {j}ᶜ - SSet.mem_horn_iff_notMem_range 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n d : ℕ} (s : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := d })) (i : Fin (n + 1)) : s ∈ (SSet.horn n i).obj (Opposite.op { len := d }) ↔ ∃ j, ∃ (_ : j ≠ i), j ∉ Set.range ⇑s - SSet.horn.ι_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) (hij : j ≠ i) {Z : SSet} (h : SSet.stdSimplex.obj { len := n + 1 } ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hij) (CategoryTheory.CategoryStruct.comp (SSet.horn (n + 1) i).ι h) = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ j) h - SSet.objEquiv_symm_notMem_horn_of_isIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i : Fin (n + 1)) {d : SimplexCategory} (f : d ⟶ { len := n }) [CategoryTheory.IsIso f] : SSet.stdSimplex.objEquiv.symm f ∉ (SSet.horn n i).obj (Opposite.op d) - SSet.horn.const_val_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i k : Fin (n + 3)) {m : ℕ} (a : Fin (m + 1)) : ↑(SSet.horn.const n i k (Opposite.op { len := m })) a = k - SSet.horn.edge_coe 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i a b : Fin (n + 1)) (hab : a ≤ b) (H : {i, a, b}.card ≤ n) : ↑(SSet.horn.edge n i a b hab H) = SSet.stdSimplex.edge n a b hab - SSet.horn_obj 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i : Fin (n + 1)) (x✝ : SimplexCategoryᵒᵖ) : (SSet.horn n i).obj x✝ = {s | Set.range ⇑(SSet.stdSimplex.asOrderHom s) ∪ {i} ≠ Set.univ} - SSet.horn.edge₃_coe_down 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i a b : Fin (n + 1)) (hab : a ≤ b) (H : 3 ≤ n) : (↑(SSet.horn.edge₃ n i a b hab H)).down = SimplexCategory.Hom.mk { toFun := ![a, b], monotone' := ⋯ } - SSet.subcomplex_le_horn_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (A : (SSet.stdSimplex.obj { len := n + 1 }).Subcomplex) (i : Fin (n + 2)) : A ≤ SSet.horn (n + 1) i ↔ ¬SSet.stdSimplex.face {i}ᶜ ≤ A - SSet.mem_horn_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i : Fin (n + 1)) {m : SimplexCategoryᵒᵖ} (x : (SSet.stdSimplex.obj { len := n }).obj m) : x ∈ (SSet.horn n i).obj m ↔ Set.range ⇑(SSet.stdSimplex.asOrderHom x) ∪ {i} ≠ Set.univ - SSet.horn.faceι_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 1)) (hij : j ≠ i) : CategoryTheory.CategoryStruct.comp (SSet.horn.faceι i j hij) (SSet.horn n i).ι = (SSet.stdSimplex.face {j}ᶜ).ι - SSet.horn.primitiveEdge_coe_down 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} {i : Fin (n + 1)} (h₀ : 0 < i) (hₙ : i < Fin.last n) (j : Fin n) : (↑(SSet.horn.primitiveEdge h₀ hₙ j)).down = SimplexCategory.Hom.mk { toFun := ![j.castSucc, j.succ], monotone' := ⋯ } - SSet.horn_eq_iSup 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i : Fin (n + 1)) : SSet.horn n i = ⨆ j, SSet.stdSimplex.face {↑j}ᶜ - SSet.horn.primitiveTriangle_coe 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i : Fin (n + 4)) (h₀ : 0 < i) (hₙ : i < Fin.last (n + 3)) (k : ℕ) (h : k < n + 2) : ↑(SSet.horn.primitiveTriangle i h₀ hₙ k h) = SSet.stdSimplex.triangle ⟨k, ⋯⟩ ⟨k + 1, ⋯⟩ ⟨k + 2, ⋯⟩ ⋯ ⋯ - SSet.objEquiv_symm_δ_mem_horn_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) : SSet.stdSimplex.objEquiv.symm (SimplexCategory.δ i) ∈ (SSet.horn (n + 1) j).obj (Opposite.op { len := n }) ↔ i ≠ j - SSet.objEquiv_symm_δ_notMem_horn_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) : SSet.stdSimplex.objEquiv.symm (SimplexCategory.δ i) ∉ (SSet.horn (n + 1) j).obj (Opposite.op { len := n }) ↔ i = j - SSet.horn.faceι_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 1)) (hij : j ≠ i) {Z : SSet} (h : SSet.stdSimplex.obj { len := n } ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.horn.faceι i j hij) (CategoryTheory.CategoryStruct.comp (SSet.horn n i).ι h) = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.face {j}ᶜ).ι h - SSet.horn.yonedaEquiv_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) (hij : j ≠ i) : SSet.yonedaEquiv (SSet.horn.ι i j hij) = SSet.horn.face i j hij - SSet.horn.faceSingletonComplIso_inv_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) (hij : j ≠ i) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso j).inv (SSet.horn.ι i j hij) = SSet.horn.faceι i j hij - SSet.horn.hom_ext 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} {i : Fin (n + 2)} {S : SSet} (σ₁ σ₂ : (SSet.horn (n + 1) i).toSSet ⟶ S) (h : ∀ (j : Fin (n + 2)) (h : j ≠ i), (CategoryTheory.ConcreteCategory.hom (σ₁.app (Opposite.op { len := n }))) (SSet.horn.face i j h) = (CategoryTheory.ConcreteCategory.hom (σ₂.app (Opposite.op { len := n }))) (SSet.horn.face i j h)) : σ₁ = σ₂ - SSet.horn.faceSingletonComplIso_inv_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) (hij : j ≠ i) {Z : SSet} (h : (SSet.horn (n + 1) i).toSSet ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso j).inv (CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hij) h) = CategoryTheory.CategoryStruct.comp (SSet.horn.faceι i j hij) h - SSet.horn.isCompatible_zero_iff_true 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} {i : Fin 2} (f : (j : Fin 2) → j ≠ i → (SSet.stdSimplex.obj { len := 0 } ⟶ X)) : SSet.horn.IsCompatible f ↔ True - SSet.horn.IsCompatible 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} {X : SSet} {i : Fin (n + 2)} (f : (j : Fin (n + 2)) → j ≠ i → (SSet.stdSimplex.obj { len := n } ⟶ X)) : Prop - SSet.horn₂₀.ι₀₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 1 } ⟶ (SSet.horn 2 0).toSSet - SSet.horn₂₀.ι₀₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 1 } ⟶ (SSet.horn 2 0).toSSet - SSet.horn₂₁.ι₀₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 1 } ⟶ (SSet.horn 2 1).toSSet - SSet.horn₂₁.ι₁₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 1 } ⟶ (SSet.horn 2 1).toSSet - SSet.horn₂₂.ι₀₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 1 } ⟶ (SSet.horn 2 2).toSSet - SSet.horn₂₂.ι₁₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 1 } ⟶ (SSet.horn 2 2).toSSet - SSet.horn₃₁.ι₀ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 2 } ⟶ (SSet.horn 3 1).toSSet - SSet.horn₃₁.ι₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 2 } ⟶ (SSet.horn 3 1).toSSet - SSet.horn₃₁.ι₃ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 2 } ⟶ (SSet.horn 3 1).toSSet - SSet.horn₃₂.ι₀ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 2 } ⟶ (SSet.horn 3 2).toSSet - SSet.horn₃₂.ι₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 2 } ⟶ (SSet.horn 3 2).toSSet - SSet.horn₃₂.ι₃ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 2 } ⟶ (SSet.horn 3 2).toSSet - SSet.horn.IsCompatible.desc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} {X : SSet} {i : Fin (n + 2)} {f : (j : Fin (n + 2)) → j ≠ i → (SSet.stdSimplex.obj { len := n } ⟶ X)} (hf : SSet.horn.IsCompatible f) : (SSet.horn (n + 1) i).toSSet ⟶ X - SSet.horn.IsCompatible.of_hom 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} {X : SSet} {i : Fin (n + 2)} (g : (SSet.horn (n + 1) i).toSSet ⟶ X) : SSet.horn.IsCompatible fun j hj => CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hj) g - SSet.horn.IsCompatible.ι_desc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} {X : SSet} {i : Fin (n + 2)} {f : (j : Fin (n + 2)) → j ≠ i → (SSet.stdSimplex.obj { len := n } ⟶ X)} (hf : SSet.horn.IsCompatible f) (j : Fin (n + 2)) (hj : j ≠ i) : CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hj) hf.desc = f j hj - SSet.horn₂₀.isPushout 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: CategoryTheory.IsPushout (SSet.stdSimplex.δ 1) (SSet.stdSimplex.δ 1) SSet.horn₂₀.ι₀₁ SSet.horn₂₀.ι₀₂ - SSet.horn₂₁.isPushout 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: CategoryTheory.IsPushout (SSet.stdSimplex.δ 0) (SSet.stdSimplex.δ 1) SSet.horn₂₁.ι₀₁ SSet.horn₂₁.ι₁₂ - SSet.horn₂₂.isPushout 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: CategoryTheory.IsPushout (SSet.stdSimplex.δ 0) (SSet.stdSimplex.δ 0) SSet.horn₂₂.ι₀₂ SSet.horn₂₂.ι₁₂ - SSet.horn.IsCompatible.ι_desc_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} {X : SSet} {i : Fin (n + 2)} {f : (j : Fin (n + 2)) → j ≠ i → (SSet.stdSimplex.obj { len := n } ⟶ X)} (hf : SSet.horn.IsCompatible f) (j : Fin (n + 2)) (hj : j ≠ i) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hj) (CategoryTheory.CategoryStruct.comp hf.desc h) = CategoryTheory.CategoryStruct.comp (f j hj) h - SSet.horn.IsCompatible.exists_desc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} {X : SSet} {i : Fin (n + 2)} {f : (j : Fin (n + 2)) → j ≠ i → (SSet.stdSimplex.obj { len := n } ⟶ X)} (hf : SSet.horn.IsCompatible f) : ∃ φ, ∀ (j : Fin (n + 2)) (hj : j ≠ i), CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hj) φ = f j hj - SSet.horn.hom_ext' 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} {X : SSet} {i : Fin (n + 2)} {f g : (SSet.horn (n + 1) i).toSSet ⟶ X} (h : ∀ (j : Fin (n + 2)) (hj : j ≠ i), CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hj) f = CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hj) g) : f = g
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59