Loogle!
Result
Found 139 declarations mentioning SSet.S.dim.
- SSet.S.dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (self : X.S) : ℕ - SSet.S.cast 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (s : X.S) {d : ℕ} (hd : s.dim = d) : X.S - SSet.S.dim_eq_of_eq 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} {s t : X.S} (h : s = t) : s.dim = t.dim - SSet.S.simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (self : X.S) : X.obj (Opposite.op { len := self.dim }) - SSet.S.cast_eq_self 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (s : X.S) {d : ℕ} (hd : s.dim = d) : s.cast hd = s - SSet.S.cast_dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (s : X.S) {d : ℕ} (hd : s.dim = d) : (s.cast hd).dim = d - SSet.S.subcomplex_cast 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (s : X.S) {d : ℕ} (hd : s.dim = d) : (s.cast hd).subcomplex = s.subcomplex - SSet.S.cast_simplex_rfl 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (s : X.S) : (s.cast ⋯).simplex = s.simplex - SSet.S.ext_iff' 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (s t : X.S) : s = t ↔ ∃ (h : s.dim = t.dim), (s.cast h).simplex = t.simplex - SSet.S.equivElements_apply_fst 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (s : X.S) : (SSet.S.equivElements s).fst = Opposite.op { len := s.dim } - 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 - SSet.S.equivElements_apply_snd 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (s : X.S) : (SSet.S.equivElements s).snd = s.simplex - SSet.S.equivOfIso_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X Y : SSet} (e : X ≅ Y) (s : X.S) : (SSet.S.equivOfIso e) s = { dim := s.dim, simplex := (CategoryTheory.ConcreteCategory.hom (e.hom.app (Opposite.op { len := s.dim }))) s.simplex } - SSet.S.equivOfIso_symm_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X Y : SSet} (e : X ≅ Y) (s : Y.S) : (SSet.S.equivOfIso e).symm s = { dim := s.dim, simplex := (CategoryTheory.ConcreteCategory.hom (e.inv.app (Opposite.op { len := s.dim }))) s.simplex } - SSet.S.opEquiv_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (x : X.op.S) : SSet.S.opEquiv x = { dim := x.dim, simplex := SSet.opObjEquiv x.simplex } - SSet.S.le_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} {s t : X.S} : s ≤ t ↔ ∃ f, (CategoryTheory.ConcreteCategory.hom (X.map f.op)) t.simplex = s.simplex - SSet.S.opEquiv_symm_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (y : X.S) : SSet.S.opEquiv.symm y = { dim := y.dim, simplex := SSet.opObjEquiv.symm y.simplex } - SSet.N.cast 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (s : X.N) {d : ℕ} (hd : s.dim = d) : X.N - SSet.S.dim_toN_le 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (x : X.S) : x.toN.dim ≤ x.dim - SSet.N.cast_eq_self 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (s : X.N) {d : ℕ} (hd : s.dim = d) : s.cast hd = s - SSet.S.instEpiSimplexCategoryToNπ 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (x : X.S) : CategoryTheory.Epi x.toNπ - SSet.S.toNπ 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (x : X.S) : { len := x.dim } ⟶ { len := x.toN.dim } - SSet.N.dim_le_of_le 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {x y : X.N} (h : x ≤ y) : x.dim ≤ y.dim - SSet.N.dim_lt_of_lt 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {x y : X.N} (h : x < y) : x.dim < y.dim - SSet.N.mk' 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (toS : X.S) (nonDegenerate : toS.simplex ∈ X.nonDegenerate toS.dim) : X.N - SSet.N.nonDegenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (self : X.N) : self.simplex ∈ X.nonDegenerate self.dim - SSet.N.mk_dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {n : ℕ} (x : X.obj (Opposite.op { len := n })) (hx : x ∈ X.nonDegenerate n) : (SSet.N.mk x hx).dim = n - SSet.N.mk'_surjective 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (s : X.N) : ∃ t, ∃ (ht : t.simplex ∈ X.nonDegenerate t.dim), s = { toS := t, nonDegenerate := ht } - SSet.S.map_toNπ_op_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (x : X.S) : (CategoryTheory.ConcreteCategory.hom (X.map x.toNπ.op)) x.toN.simplex = x.simplex - SSet.S.subcomplex_eq_of_epi 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (x y : X.S) (f : { len := x.dim } ⟶ { len := y.dim }) [CategoryTheory.Epi f] (hf : (CategoryTheory.ConcreteCategory.hom (X.map f.op)) y.simplex = x.simplex) : x.subcomplex = y.subcomplex - SSet.S.subcomplex_map_le 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (x y : X.S) (f : { len := x.dim } ⟶ { len := y.dim }) (hf : (CategoryTheory.ConcreteCategory.hom (X.map f.op)) y.simplex = x.simplex) : x.subcomplex ≤ y.subcomplex - SSet.S.existsUnique_toNπ 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {x : X.S} {y : X.N} (hy : x.toN = y) : ∃! f, CategoryTheory.Epi f ∧ (CategoryTheory.ConcreteCategory.hom (X.map f.op)) y.simplex = x.simplex - SSet.N.orderIsoOfIso_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X Y : SSet} (e : X ≅ Y) (x : X.N) : (SSet.N.orderIsoOfIso e) x = SSet.N.mk ((CategoryTheory.ConcreteCategory.hom (e.hom.app (Opposite.op { len := x.dim }))) x.simplex) ⋯ - SSet.N.le_iff_exists_mono 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {x y : X.N} : x ≤ y ↔ ∃ f, ∃ (_ : CategoryTheory.Mono f), (CategoryTheory.ConcreteCategory.hom (X.map f.op)) y.simplex = x.simplex - SSet.N.orderIsoOfIso_symm_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X Y : SSet} (e : X ≅ Y) (y : Y.N) : (RelIso.symm (SSet.N.orderIsoOfIso e)) y = SSet.N.mk ((CategoryTheory.ConcreteCategory.hom (e.inv.app (Opposite.op { len := y.dim }))) y.simplex) ⋯ - SSet.N.opEquiv_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (x : X.op.N) : SSet.N.opEquiv x = SSet.N.mk (SSet.opObjEquiv x.simplex) ⋯ - SSet.N.opEquiv_symm_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (y : X.N) : (RelIso.symm SSet.N.opEquiv) y = SSet.N.mk (SSet.opObjEquiv.symm y.simplex) ⋯ - SSet.relativeCellComplexCellsEquiv_symm_apply_j 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X : SSet} (s : X.N) : (SSet.relativeCellComplexCellsEquiv.symm s).j = s.dim - SSet.relativeCellComplexCellsEquiv_symm_apply_k_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X : SSet} (s : X.N) : (SSet.relativeCellComplexCellsEquiv.symm s).k.simplex = s.simplex - SSet.Subcomplex.N.cast 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (s : A.N) {d : ℕ} (hd : s.dim = d) : A.N - SSet.Subcomplex.N.cast_eq_self 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (s : A.N) {d : ℕ} (hd : s.dim = d) : s.cast hd = s - SSet.Subcomplex.N.eq_iff_sMk_eq 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (x y : A.N) : x = y ↔ { dim := x.dim, simplex := x.simplex } = { dim := y.dim, simplex := y.simplex } - SSet.Subcomplex.N.mk' 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (toN : X.N) (notMem : toN.simplex ∉ A.obj (Opposite.op { len := toN.dim })) : A.N - SSet.Subcomplex.N.notMem 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (self : A.N) : self.simplex ∉ A.obj (Opposite.op { len := self.dim }) - SSet.Subcomplex.N.mk_dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} {n : ℕ} (x : X.obj (Opposite.op { len := n })) (hx : x ∈ X.nonDegenerate n) (hx' : x ∉ A.obj (Opposite.op { len := n })) : (SSet.Subcomplex.N.mk x hx hx').dim = n - SSet.Subcomplex.N.mk'_surjective 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (s : A.N) : ∃ t, ∃ (ht : t.simplex ∉ A.obj (Opposite.op { len := t.dim })), s = { toN := t, notMem := ht } - SSet.Subcomplex.existsN 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {n : ℕ} (s : X.obj (Opposite.op { len := n })) {A : X.Subcomplex} (hs : s ∉ A.obj (Opposite.op { len := n })) : ∃ x f, CategoryTheory.Epi f ∧ (CategoryTheory.ConcreteCategory.hom (X.map f.op)) x.simplex = s - SSet.S.IsUniquelyCodimOneFace.dim_eq 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X : SSet} {x y : X.S} (hxy : x.IsUniquelyCodimOneFace y) : y.dim = x.dim + 1 - SSet.S.IsUniquelyCodimOneFace.index 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X : SSet} {x y : X.S} (hxy : x.IsUniquelyCodimOneFace y) {d : ℕ} (hd : x.dim = d) : Fin (d + 2) - SSet.S.IsUniquelyCodimOneFace.cast 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X : SSet} {x y : X.S} (hxy : x.IsUniquelyCodimOneFace y) {d : ℕ} (hd : x.dim = d) : (x.cast hd).IsUniquelyCodimOneFace (y.cast ⋯) - SSet.S.IsUniquelyCodimOneFace.δ_index 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X : SSet} {x y : X.S} (hxy : x.IsUniquelyCodimOneFace y) {d : ℕ} (hd : x.dim = d) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X (hxy.index hd))) (y.cast ⋯).simplex = (x.cast hd).simplex - SSet.S.IsUniquelyCodimOneFace.existsUnique_δ_cast_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X : SSet} {x y : X.S} (hxy : x.IsUniquelyCodimOneFace y) {d : ℕ} (hd : x.dim = d) : ∃! i, (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X i)) (y.cast ⋯).simplex = (x.cast hd).simplex - SSet.S.IsUniquelyCodimOneFace.δ_eq_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X : SSet} {x y : X.S} (hxy : x.IsUniquelyCodimOneFace y) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 2)) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X i)) (y.cast ⋯).simplex = (x.cast hd).simplex ↔ i = hxy.index hd - SSet.S.IsUniquelyCodimOneFace.unique 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X : SSet} {x y : X.S} (hxy : x.IsUniquelyCodimOneFace y) {d : ℕ} (hd : x.dim = d) (f : { len := d } ⟶ { len := d + 1 }) [CategoryTheory.Mono f] (hf : (CategoryTheory.ConcreteCategory.hom (X.map f.op)) (y.cast ⋯).simplex = (x.cast hd).simplex) : f = SimplexCategory.δ (hxy.index hd) - SSet.S.IsUniquelyCodimOneFace.of_iso 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X : SSet} {x y : X.S} (hxy : x.IsUniquelyCodimOneFace y) {Y : SSet} (e : X ≅ Y) : { dim := x.dim, simplex := (CategoryTheory.ConcreteCategory.hom (e.hom.app (Opposite.op { len := x.dim }))) x.simplex }.IsUniquelyCodimOneFace { dim := y.dim, simplex := (CategoryTheory.ConcreteCategory.hom (e.hom.app (Opposite.op { len := y.dim }))) y.simplex } - SSet.S.IsUniquelyCodimOneFace.iff_of_iso 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X Y : SSet} (e : X ≅ Y) (x y : X.S) : { dim := x.dim, simplex := (CategoryTheory.ConcreteCategory.hom (e.hom.app (Opposite.op { len := x.dim }))) x.simplex }.IsUniquelyCodimOneFace { dim := y.dim, simplex := (CategoryTheory.ConcreteCategory.hom (e.hom.app (Opposite.op { len := y.dim }))) y.simplex } ↔ x.IsUniquelyCodimOneFace y - SSet.S.IsUniquelyCodimOneFace.index_of_iso 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X : SSet} {x y : X.S} (hxy : x.IsUniquelyCodimOneFace y) {Y : SSet} (e : X ≅ Y) {d : ℕ} (hd : x.dim = d) : ⋯.index hd = hxy.index hd - SSet.Subcomplex.Pairing.AncestralRel.dim_le 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} [P.IsProper] {x y : ↑P.II} (hxy : P.AncestralRel x y) : (↑x).dim ≤ (↑y).dim - SSet.Subcomplex.Pairing.dim_p 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) [P.IsProper] (x : ↑P.II) : (↑(P.p x)).dim = (↑x).dim + 1 - SSet.Subcomplex.Pairing.IsInner.ne_last 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {inst✝ : P.IsProper} [self : P.IsInner] (x : ↑P.II) {d : ℕ} (hd : (↑x).dim = d) : ⋯.index hd ≠ Fin.last (d + 1) - SSet.Subcomplex.Pairing.IsInner.ne_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {inst✝ : P.IsProper} [self : P.IsInner] (x : ↑P.II) {d : ℕ} (hd : (↑x).dim = d) : ⋯.index hd ≠ 0 - SSet.Subcomplex.Pairing.IsInner.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} [P.IsProper] (ne_zero : ∀ (x : ↑P.II) {d : ℕ} (hd : (↑x).dim = d), ⋯.index hd ≠ 0) (ne_last : ∀ (x : ↑P.II) {d : ℕ} (hd : (↑x).dim = d), ⋯.index hd ≠ Fin.last (d + 1)) : P.IsInner - SSet.Subcomplex.Pairing.ofIso_index 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) {Y : SSet} {B : Y.Subcomplex} (e : Y ≅ X) (hA : A.preimage e.hom = B) (x : ↑P.II) {d : ℕ} (hd : (↑x).dim = d) [P.IsProper] : ⋯.index hd = ⋯.index hd - SSet.N.monoOfLE 📋 Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {x y : X.N} (h : x ≤ y) : { len := x.dim } ⟶ { len := y.dim } - SSet.N.instMonoSimplexCategoryMonoOfLE 📋 Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {x y : X.N} (h : x ≤ y) : CategoryTheory.Mono (SSet.N.monoOfLE h) - SSet.N.monoOfLE_refl 📋 Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] (x : X.N) : SSet.N.monoOfLE ⋯ = CategoryTheory.CategoryStruct.id { len := x.dim } - SSet.N.monoOfLE_comp 📋 Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {x y z : X.N} (h : x ≤ y) (h' : y ≤ z) : CategoryTheory.CategoryStruct.comp (SSet.N.monoOfLE h) (SSet.N.monoOfLE h') = SSet.N.monoOfLE ⋯ - SSet.N.monoOfLE_comp_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {x y z : X.N} (h : x ≤ y) (h' : y ≤ z) {Z : SimplexCategory} (h✝ : { len := z.dim } ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.N.monoOfLE h) (CategoryTheory.CategoryStruct.comp (SSet.N.monoOfLE h') h✝) = CategoryTheory.CategoryStruct.comp (SSet.N.monoOfLE ⋯) h✝ - SSet.N.map_monoOfLE 📋 Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {x y : X.N} (h : x ≤ y) : (CategoryTheory.ConcreteCategory.hom (X.map (SSet.N.monoOfLE h).op)) y.simplex = x.simplex - SSet.N.existsUnique_of_le 📋 Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {x y : X.N} (h : x ≤ y) : ∃! f, CategoryTheory.Mono f ∧ (CategoryTheory.ConcreteCategory.hom (X.map f.op)) y.simplex = x.simplex - SSet.N.monoOfLE_eq_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {x y : X.N} (h : x ≤ y) (g : { len := x.dim } ⟶ { len := y.dim }) [CategoryTheory.Mono g] : SSet.N.monoOfLE h = g ↔ (CategoryTheory.ConcreteCategory.hom (X.map g.op)) y.simplex = x.simplex - SSet.N.stdSimplex_map_monoOfLE_yonedaEquiv_symm_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {x y : X.N} (h : x ≤ y) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.map (SSet.N.monoOfLE h)) (SSet.yonedaEquiv.symm y.simplex) = SSet.yonedaEquiv.symm x.simplex - SSet.N.stdSimplex_map_monoOfLE_yonedaEquiv_symm_simplex_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {x y : X.N} (h : x ≤ y) {Z : SSet} (h✝ : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.map (SSet.N.monoOfLE h)) (CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm y.simplex) h✝) = CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm x.simplex) h✝ - SSet.Subcomplex.PairingCore.type₂_dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) (s : h.ι) : (h.type₂ s).dim = h.dim s - SSet.Subcomplex.PairingCore.type₁_dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) (s : h.ι) : (h.type₁ s).dim = h.dim s + 1 - SSet.Subcomplex.PairingCore.isUniquelyCodimOneFace_index 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) [h.IsProper] (s : h.ι) : ⋯.index ⋯ = h.index s - SSet.Subcomplex.Pairing.WeakRankFunction.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {α : Type v} [PartialOrder α] (rank : ↑P.II → α) (lt : ∀ {x y : ↑P.II}, P.AncestralRel x y → (↑x).dim = (↑y).dim → rank x < rank y) : P.WeakRankFunction α - SSet.Subcomplex.Pairing.WeakRankFunction.lt 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {α : Type v} [PartialOrder α] (self : P.WeakRankFunction α) {x y : ↑P.II} : P.AncestralRel x y → (↑x).dim = (↑y).dim → self.rank x < self.rank y - SSet.Subcomplex.Pairing.RankFunction.Cell.type₂_dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (c : f.Cell j) : (SSet.Subcomplex.Pairing.RankFunction.Cell.type₂ f c).dim = c.dim - SSet.Subcomplex.Pairing.RankFunction.Cell.type₁_dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (c : f.Cell j) : (SSet.Subcomplex.Pairing.RankFunction.Cell.type₁ f c).dim = c.dim + 1 - SSet.Subcomplex.Pairing.RankFunction.mapN_type₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] {j : ι} (c : f.Cell j) : f.mapN (SSet.Subcomplex.Pairing.RankFunction.Cell.type₂ f c) = { dim := (↑c.s).dim, simplex := (↑c.s).simplex } - SSet.Subcomplex.Pairing.RankFunction.mapN_type₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] {j : ι} (c : f.Cell j) : f.mapN (SSet.Subcomplex.Pairing.RankFunction.Cell.type₁ f c) = { dim := (↑(P.p c.s)).dim, simplex := (↑(P.p c.s)).simplex } - 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.prodStdSimplex.pairingCore.Type₁.hd 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (self : SSet.prodStdSimplex.pairingCore.Type₁ k n) : self.x.dim = self.d + 1 - SSet.prodStdSimplex.pairingCore.IsType₂.type₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : SSet.prodStdSimplex.pairingCore.Type₁ k n - SSet.prodStdSimplex.pairingCore.min 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : Fin (d + 1) - SSet.prodStdSimplex.pairingCore.IsIndex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : Fin (d + 1) → Prop - SSet.prodStdSimplex.pairingCore.finset 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : Finset (Fin (d + 1)) - SSet.prodStdSimplex.pairingCore.IsType₂.type₁_d 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : (hx.type₁ hd).d = d - SSet.prodStdSimplex.pairingCore.nonempty_finset 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : (SSet.prodStdSimplex.pairingCore.finset x hd).Nonempty - SSet.prodStdSimplex.pairingCore.IsIndex.unique 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d} {l : Fin d} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) {l' : Fin d} (hl' : SSet.prodStdSimplex.pairingCore.IsIndex x hd l'.succ) : l = l' - SSet.prodStdSimplex.pairingCore.IsIndex.min_eq 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d} {l : Fin d} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : SSet.prodStdSimplex.pairingCore.min x hd = l.succ - SSet.prodStdSimplex.pairingCore.IsType₂.type₁_index 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : (hx.type₁ hd).index = SSet.prodStdSimplex.pairingCore.min x hd - SSet.prodStdSimplex.pairingCore.IsType₂.φ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 2)) : Fin (m + 2) × Fin (n + 1) - SSet.prodStdSimplex.pairingCore.isIndex_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : SSet.prodStdSimplex.pairingCore.IsIndex x hd 0 ↔ False - SSet.prodStdSimplex.pairingCore.IsIndex.type₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {i : Fin (d + 1)} (h : SSet.prodStdSimplex.pairingCore.IsIndex x hd i.succ) : SSet.prodStdSimplex.pairingCore.Type₁ k n - SSet.prodStdSimplex.pairingCore.Type₁.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) (d : ℕ) (hd : x.dim = d + 1) (index : Fin (d + 1)) (isIndex : SSet.prodStdSimplex.pairingCore.IsIndex x hd index.succ) : SSet.prodStdSimplex.pairingCore.Type₁ k n - SSet.prodStdSimplex.pairingCore.IsIndex.isType₂_δ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} {hd : x.dim = d + 1} {l : Fin (d + 1)} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : SSet.prodStdSimplex.pairingCore.IsType₂ hl.δ - SSet.prodStdSimplex.pairingCore.IsIndex.type₁_d 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {i : Fin (d + 1)} (h : SSet.prodStdSimplex.pairingCore.IsIndex x hd i.succ) : h.type₁.d = d - SSet.prodStdSimplex.pairingCore.IsType₂.φ_succ_fst 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : (SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd (SSet.prodStdSimplex.pairingCore.min x hd).succ).1 = k.succ - SSet.prodStdSimplex.pairingCore.IsIndex.type₁_index 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {i : Fin (d + 1)} (h : SSet.prodStdSimplex.pairingCore.IsIndex x hd i.succ) : h.type₁.index = i - SSet.prodStdSimplex.pairingCore.IsType₂.simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : (CategoryTheory.MonoidalCategoryStruct.tensorObj (SSet.stdSimplex.obj { len := m + 1 }) (SSet.stdSimplex.obj { len := n })).obj (Opposite.op { len := d + 1 }) - SSet.prodStdSimplex.pairingCore.IsType₂.φ_succ_snd 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : (SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd (SSet.prodStdSimplex.pairingCore.min x hd).succ).2 = (SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd (SSet.prodStdSimplex.pairingCore.min x hd).castSucc).2 - SSet.prodStdSimplex.pairingCore.IsType₂.strictMono_φ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : StrictMono (SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd) - SSet.prodStdSimplex.pairingCore.IsType₂.type₁_eq_of_δ_eq 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {t : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (ht : SSet.prodStdSimplex.pairingCore.IsType₂ t) (s : SSet.prodStdSimplex.pairingCore.Type₁ k n) (hst : s.δ = t) {d : ℕ} (hd : t.dim = d) : ht.type₁ hd = s - SSet.prodStdSimplex.pairingCore.IsIndex.δ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {l : Fin (d + 1)} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N - SSet.prodStdSimplex.pairingCore.IsIndex.type₁_x 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {i : Fin (d + 1)} (h : SSet.prodStdSimplex.pairingCore.IsIndex x hd i.succ) : h.type₁.x = x - SSet.prodStdSimplex.pairingCore.IsType₂.simplex_snd_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 2)) : (hx.simplex hd).2 i = (SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd i).2 - SSet.prodStdSimplex.pairingCore.IsType₂.type₁_x 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : (hx.type₁ hd).x = SSet.Subcomplex.N.mk (hx.simplex hd) ⋯ ⋯ - SSet.prodStdSimplex.pairingCore.IsType₂.simplex_fst_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 2)) : (hx.simplex hd).1 i = (SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd i).1 - SSet.prodStdSimplex.pairingCore.IsIndex.δ_dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {l : Fin (d + 1)} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : hl.δ.dim = d - SSet.prodStdSimplex.pairingCore.IsType₂.simplex_mem_nonDegenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : hx.simplex hd ∈ (CategoryTheory.MonoidalCategoryStruct.tensorObj (SSet.stdSimplex.obj { len := m + 1 }) (SSet.stdSimplex.obj { len := n })).nonDegenerate (d + 1) - SSet.prodStdSimplex.pairingCore.IsIndex.min_δ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} {hd : x.dim = d + 1} {l : Fin (d + 1)} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : SSet.prodStdSimplex.pairingCore.min hl.δ ⋯ = l - SSet.prodStdSimplex.pairingCore.IsType₂.notMem_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : hx.simplex hd ∉ ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).obj (Opposite.op { len := d + 1 }) - SSet.prodStdSimplex.pairingCore_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} (k : Fin (m + 1)) (n : ℕ) (s : SSet.prodStdSimplex.pairingCore.Type₁ k n) : (SSet.prodStdSimplex.pairingCore k n).simplex s = (s.x.cast ⋯).simplex - SSet.prodStdSimplex.pairingCore.IsIndex.δ_injective 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {l : Fin (d + 1)} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) {y : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d' : ℕ} {hd' : y.dim = d' + 1} {l' : Fin (d' + 1)} (hl' : SSet.prodStdSimplex.pairingCore.IsIndex y hd' l'.succ) (h : hl.δ = hl'.δ) : x = y - SSet.prodStdSimplex.pairingCore.IsType₂.δ_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ (CategoryTheory.MonoidalCategoryStruct.tensorObj (SSet.stdSimplex.obj { len := m + 1 }) (SSet.stdSimplex.obj { len := n })) (SSet.prodStdSimplex.pairingCore.min x hd).castSucc)) (hx.simplex hd) = (x.cast hd).simplex - SSet.prodStdSimplex.pairingCore.IsIndex.δ_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {l : Fin (d + 1)} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : hl.δ.simplex = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ (CategoryTheory.MonoidalCategoryStruct.tensorObj (SSet.stdSimplex.obj { len := m + 1 }) (SSet.stdSimplex.obj { len := n })) l.castSucc)) (x.cast hd).simplex - SSet.prodStdSimplex.pairingCore.IsIndex.eq_of_isType₂_δ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {l : Fin (d + 1)} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) {u : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hu : SSet.prodStdSimplex.pairingCore.IsType₂ u) (i : Fin (d + 2)) (hu' : { dim := u.dim, simplex := u.simplex } = { dim := d, simplex := (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ (CategoryTheory.MonoidalCategoryStruct.tensorObj (SSet.stdSimplex.obj { len := m + 1 }) (SSet.stdSimplex.obj { len := n })) i)) (x.cast hd).simplex }) : i = l.castSucc ∨ i = l.succ - SSet.prodStdSimplex.pairingCore.IsIndex.simplex_fst_castSucc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d} {l : Fin d} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : (x.cast hd).simplex.1 l.castSucc = k.castSucc - SSet.prodStdSimplex.pairingCore.IsIndex.simplex_fst_succ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d} {l : Fin d} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : (x.cast hd).simplex.1 l.succ = k.succ - SSet.prodStdSimplex.pairingCore.simplex_fst_le_castSucc_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 1)) : (x.cast hd).simplex.1 i ≤ k.castSucc ↔ i < SSet.prodStdSimplex.pairingCore.min x hd - SSet.prodStdSimplex.pairingCore.IsIndex.simplex_fst_le_castSucc_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d} {l : Fin d} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) (i : Fin (d + 1)) : (x.cast hd).simplex.1 i ≤ k.castSucc ↔ i < l.succ - SSet.prodStdSimplex.pairingCore.IsIndex.succ_le_simplex_fst_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d} {l : Fin d} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) (i : Fin (d + 1)) : k.succ ≤ (x.cast hd).simplex.1 i ↔ l.succ ≤ i - SSet.prodStdSimplex.pairingCore.mem_finset_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (l : Fin (d + 1)) : l ∈ SSet.prodStdSimplex.pairingCore.finset x hd ↔ (x.cast hd).simplex.1 l = k.succ - SSet.prodStdSimplex.pairingCore.simplex_fst_min 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : (x.cast hd).simplex.1 (SSet.prodStdSimplex.pairingCore.min x hd) = k.succ - SSet.prodStdSimplex.pairingCore.mem_range_right 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (n + 1)) : i ∈ Set.range ⇑(x.cast hd).simplex.2 - SSet.prodStdSimplex.pairingCore.IsType₂.φ_castSucc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd (SSet.prodStdSimplex.pairingCore.min x hd).castSucc = (k.castSucc, (x.cast hd).simplex.2 (SSet.prodStdSimplex.pairingCore.min x hd)) - SSet.prodStdSimplex.pairingCore.mem_range_left 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (m + 2)) (hi : i ≠ k.castSucc) : i ∈ Set.range ⇑(x.cast hd).simplex.1 - SSet.prodStdSimplex.objEquiv_apply_snd' 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 1)) : (x.cast hd).simplex.2 i = (x.cast hd).simplex.2 i - SSet.prodStdSimplex.pairingCore.IsIndex.simplex_snd_succ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d} {l : Fin d} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : (x.cast hd).simplex.2 l.succ = (x.cast hd).simplex.2 l.castSucc - SSet.prodStdSimplex.objEquiv_apply_fst' 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 1)) : (x.cast hd).simplex.1 i = (x.cast hd).simplex.1 i - SSet.prodStdSimplex.pairingCore.isIndex_succ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (l : Fin d) : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ ↔ (x.cast hd).simplex.1 l.castSucc = k.castSucc ∧ (x.cast hd).simplex.1 l.succ = k.succ ∧ (x.cast hd).simplex.2 l.succ = (x.cast hd).simplex.2 l.castSucc - SSet.prodStdSimplex.pairingCore.IsType₂.φ_succAbove 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 1)) : SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd ((SSet.prodStdSimplex.pairingCore.min x hd).castSucc.succAbove i) = (SSet.prodStdSimplex.objEquiv (x.cast hd).simplex) i - SSet.prodStdSimplex.pairingCore.IsType₂.φ_of_ne 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 2)) (hi : i ≠ (SSet.prodStdSimplex.pairingCore.min x hd).castSucc) : SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd i = (SSet.prodStdSimplex.objEquiv (x.cast hd).simplex) ((SSet.prodStdSimplex.pairingCore.min x hd).predAbove i) - SSet.prodStdSimplex.pairingCore.IsType₂.φ_of_lt 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 2)) (hi : i < (SSet.prodStdSimplex.pairingCore.min x hd).castSucc) : SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd i = (SSet.prodStdSimplex.objEquiv (x.cast hd).simplex) (i.castPred ⋯) - SSet.prodStdSimplex.pairingCore.IsType₂.φ_of_gt 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 2)) (hi : (SSet.prodStdSimplex.pairingCore.min x hd).castSucc < i) : SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd i = (SSet.prodStdSimplex.objEquiv (x.cast hd).simplex) (i.pred ⋯) - SSet.N.toSemiSimplexCategory_obj 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonsingularColimit
(X : SSet) [X.Nonsingular] (s : X.N) : (SSet.N.toSemiSimplexCategory X).obj s = { len := s.dim } - SSet.N.toSemiSimplexCategory_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonsingularColimit
(X : SSet) [X.Nonsingular] {X✝ Y✝ : X.N} (f : X✝ ⟶ Y✝) : (SSet.N.toSemiSimplexCategory X).map f = SemiSimplexCategory.homOfMono (SSet.N.monoOfLE ⋯)
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