Loogle!
Result
Found 579 declarations mentioning SSet.Subcomplex. Of these, only the first 200 are shown.
- SSet.Subcomplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
(X : SSet) : Type u - SSet.Subcomplex.toSSet 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} (A : X.Subcomplex) : SSet - SSet.Subcomplex.instCoeOut 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} : CoeOut X.Subcomplex SSet - SSet.Subcomplex.ofSimplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {n : ℕ} (x : X.obj (Opposite.op { len := n })) : X.Subcomplex - SSet.Subcomplex.instMonoι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} (A : X.Subcomplex) : CategoryTheory.Mono A.ι - SSet.Subcomplex.range 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) : Y.Subcomplex - SSet.Subcomplex.ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} (A : X.Subcomplex) : A.toSSet ⟶ X - SSet.Subcomplex.image 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (f : X ⟶ Y) : Y.Subcomplex - SSet.Subcomplex.preimage 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (p : Y ⟶ X) : Y.Subcomplex - SSet.Subcomplex.image_id 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} (A : X.Subcomplex) : A.image (CategoryTheory.CategoryStruct.id X) = A - SSet.Subcomplex.preimage_id 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} (A : X.Subcomplex) : A.preimage (CategoryTheory.CategoryStruct.id X) = A - SSet.Subcomplex.eqToIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {S₁ S₂ : X.Subcomplex} (h : S₁ = S₂) : S₁.toSSet ≅ S₂.toSSet - SSet.Subcomplex.toSSetFunctor 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} : CategoryTheory.Functor X.Subcomplex SSet - SSet.Subcomplex.instDecidableEqObjOppositeSimplexCategoryToSSet 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} (n : SimplexCategoryᵒᵖ) (A : X.Subcomplex) [DecidableEq (X.obj n)] : DecidableEq (A.toSSet.obj n) - SSet.Subcomplex.toSSetFunctor_obj 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} (A : X.Subcomplex) : SSet.Subcomplex.toSSetFunctor.obj A = A.toSSet - SSet.Subcomplex.homOfLE 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {S₁ S₂ : X.Subcomplex} (h : S₁ ≤ S₂) : S₁.toSSet ⟶ S₂.toSSet - SSet.Subcomplex.fromPreimage 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (p : Y ⟶ X) : (A.preimage p).toSSet ⟶ A.toSSet - SSet.Subcomplex.mono_homOfLE 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {S₁ S₂ : X.Subcomplex} (h : S₁ ≤ S₂) : CategoryTheory.Mono (SSet.Subcomplex.homOfLE h) - SSet.Subcomplex.toImage 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (f : X ⟶ Y) : A.toSSet ⟶ (A.image f).toSSet - SSet.Subcomplex.image_le_range 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (f : X ⟶ Y) : A.image f ≤ SSet.Subcomplex.range f - SSet.Subcomplex.instEpiToImage 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (f : X ⟶ Y) : CategoryTheory.Epi (A.toImage f) - SSet.Subcomplex.homOfLE_refl 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} (S₁ : X.Subcomplex) : SSet.Subcomplex.homOfLE ⋯ = CategoryTheory.CategoryStruct.id S₁.toSSet - SSet.Subcomplex.image_preimage_le 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (B : X.Subcomplex) (f : Y ⟶ X) : (B.preimage f).image f ≤ B - SSet.Subcomplex.preimage_image 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (S : X.Subcomplex) (f : X ⟶ Y) [CategoryTheory.Mono f] : (S.image f).preimage f = S - SSet.Subcomplex.preimage_image_of_isIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) (B : Y.Subcomplex) [CategoryTheory.IsIso f] : (B.preimage f).image f = B - SSet.Subcomplex.image_monotone 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) : Monotone fun S => S.image f - SSet.Subcomplex.preimage_monotone 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : Y ⟶ X) : Monotone fun S => S.preimage f - SSet.Subcomplex.image_eq_range 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (f : X ⟶ Y) : A.image f = SSet.Subcomplex.range (CategoryTheory.CategoryStruct.comp A.ι f) - SSet.Subcomplex.image_inv 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : Y.Subcomplex) (f : X ⟶ Y) [CategoryTheory.IsIso f] : A.image (CategoryTheory.inv f) = A.preimage f - SSet.Subcomplex.lift 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) {B : Y.Subcomplex} (hf : SSet.Subcomplex.range f ≤ B) : X ⟶ B.toSSet - SSet.Subcomplex.preimage_inv 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (f : X ⟶ Y) [CategoryTheory.IsIso f] : A.preimage (CategoryTheory.inv f) = A.image f - SSet.Subcomplex.eqToIso_hom 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {S₁ S₂ : X.Subcomplex} (h : S₁ = S₂) : (SSet.Subcomplex.eqToIso h).hom = SSet.Subcomplex.homOfLE ⋯ - SSet.Subcomplex.eqToIso_inv 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {S₁ S₂ : X.Subcomplex} (h : S₁ = S₂) : (SSet.Subcomplex.eqToIso h).inv = SSet.Subcomplex.homOfLE ⋯ - SSet.Subcomplex.range_comp 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) {Z : SSet} (g : Y ⟶ Z) : SSet.Subcomplex.range (CategoryTheory.CategoryStruct.comp f g) = (SSet.Subcomplex.range f).image g - SSet.Subcomplex.image_le_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (f : X ⟶ Y) (Z : Y.Subcomplex) : A.image f ≤ Z ↔ A ≤ Z.preimage f - SSet.Subcomplex.image_comp 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (f : X ⟶ Y) {Z : SSet} (g : Y ⟶ Z) : A.image (CategoryTheory.CategoryStruct.comp f g) = (A.image f).image g - SSet.Subcomplex.preimage_comp 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y Z : SSet} (A : Z.Subcomplex) (f : X ⟶ Y) (g : Y ⟶ Z) : A.preimage (CategoryTheory.CategoryStruct.comp f g) = (A.preimage g).preimage f - SSet.Subcomplex.homOfLE_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {S₁ S₂ : X.Subcomplex} (h : S₁ ≤ S₂) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.homOfLE h) S₂.ι = S₁.ι - SSet.Subcomplex.image_iSup 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} {ι : Type u_1} (S : ι → X.Subcomplex) (f : X ⟶ Y) : (⨆ i, S i).image f = ⨆ i, (S i).image f - SSet.Subcomplex.preimage_iInf 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} {ι : Type u_1} (A : ι → X.Subcomplex) (p : Y ⟶ X) : (⨅ i, A i).preimage p = ⨅ i, (A i).preimage p - SSet.Subcomplex.preimage_iSup 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} {ι : Type u_1} (A : ι → X.Subcomplex) (p : Y ⟶ X) : (⨆ i, A i).preimage p = ⨆ i, (A i).preimage p - SSet.Subcomplex.isInitialBot 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} : CategoryTheory.Limits.IsInitial ⊥.toSSet - SSet.Subcomplex.topIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
(X : SSet) : ⊤.toSSet ≅ X - SSet.Subcomplex.image_le_image_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) [CategoryTheory.Mono f] {S₁ S₂ : X.Subcomplex} : S₁.image f ≤ S₂.image f ↔ S₁ ≤ S₂ - SSet.Subcomplex.instSubsingletonHomToSSetBot 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} : Subsingleton (⊥.toSSet ⟶ Y) - SSet.Subcomplex.instUniqueHomToSSetBot 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} : Unique (⊥.toSSet ⟶ Y) - SSet.Subcomplex.lift_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) {B : Y.Subcomplex} (hf : SSet.Subcomplex.range f ≤ B) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.lift f hf) B.ι = f - SSet.Subcomplex.preimage_max 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A B : X.Subcomplex) (p : Y ⟶ X) : (A ⊔ B).preimage p = A.preimage p ⊔ B.preimage p - SSet.Subcomplex.preimage_min 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A B : X.Subcomplex) (p : Y ⟶ X) : (A ⊓ B).preimage p = A.preimage p ⊓ B.preimage p - SSet.Subcomplex.toSSetFunctor_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {X✝ Y✝ : X.Subcomplex} (h : X✝ ⟶ Y✝) : SSet.Subcomplex.toSSetFunctor.map h = SSet.Subcomplex.homOfLE ⋯ - SSet.Subcomplex.image_top 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) : ⊤.image f = SSet.Subcomplex.range f - SSet.Subcomplex.preimage_range 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) : (SSet.Subcomplex.range f).preimage f = ⊤ - SSet.Subcomplex.ofSimplex_le_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {n : ℕ} (x : X.obj (Opposite.op { len := n })) (A : X.Subcomplex) : SSet.Subcomplex.ofSimplex x ≤ A ↔ x ∈ A.obj (Opposite.op { len := n }) - SSet.Subcomplex.toImage_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (f : X ⟶ Y) : CategoryTheory.CategoryStruct.comp (A.toImage f) (A.image f).ι = CategoryTheory.CategoryStruct.comp A.ι f - SSet.Subcomplex.range_eq_top 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) [CategoryTheory.Epi f] : SSet.Subcomplex.range f = ⊤ - SSet.Subcomplex.range_eq_top_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) : SSet.Subcomplex.range f = ⊤ ↔ CategoryTheory.Epi f - SSet.Subcomplex.fromPreimage_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (p : Y ⟶ X) : CategoryTheory.CategoryStruct.comp (A.fromPreimage p) A.ι = CategoryTheory.CategoryStruct.comp (A.preimage p).ι p - SSet.Subcomplex.preimage_eq_top_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (B : X.Subcomplex) (f : Y ⟶ X) : B.preimage f = ⊤ ↔ SSet.Subcomplex.range f ≤ B - SSet.Subcomplex.preimage_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} (A : X.Subcomplex) : A.preimage A.ι = ⊤ - SSet.Subcomplex.homOfLE_comp 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {S₁ S₂ : X.Subcomplex} (h : S₁ ≤ S₂) {S₃ : X.Subcomplex} (h' : S₂ ≤ S₃) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.homOfLE h) (SSet.Subcomplex.homOfLE h') = SSet.Subcomplex.homOfLE ⋯ - SSet.Subcomplex.homOfLE_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {S₁ S₂ : X.Subcomplex} (h : S₁ ≤ S₂) {Z : SSet} (h✝ : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.homOfLE h) (CategoryTheory.CategoryStruct.comp S₂.ι h✝) = CategoryTheory.CategoryStruct.comp S₁.ι h✝ - SSet.Subcomplex.lift_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) {B : Y.Subcomplex} (hf : SSet.Subcomplex.range f ≤ B) {Z : SSet} (h : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.lift f hf) (CategoryTheory.CategoryStruct.comp B.ι h) = CategoryTheory.CategoryStruct.comp f h - SSet.Subcomplex.toImage_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (f : X ⟶ Y) {Z : SSet} (h : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (A.toImage f) (CategoryTheory.CategoryStruct.comp (A.image f).ι h) = CategoryTheory.CategoryStruct.comp A.ι (CategoryTheory.CategoryStruct.comp f h) - SSet.Subcomplex.fromPreimage_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (p : Y ⟶ X) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (A.fromPreimage p) (CategoryTheory.CategoryStruct.comp A.ι h) = CategoryTheory.CategoryStruct.comp (A.preimage p).ι (CategoryTheory.CategoryStruct.comp p h) - SSet.Subcomplex.homOfLE_comp_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {S₁ S₂ : X.Subcomplex} (h : S₁ ≤ S₂) {S₃ : X.Subcomplex} (h' : S₂ ≤ S₃) {Z : SSet} (h✝ : S₃.toSSet ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.homOfLE h) (CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.homOfLE h') h✝) = CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.homOfLE ⋯) h✝ - SSet.Subcomplex.image_obj 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (f : X ⟶ Y) (i : SimplexCategoryᵒᵖ) : (A.image f).obj i = ⇑(CategoryTheory.ConcreteCategory.hom (f.app i)) '' A.obj i - SSet.Subcomplex.image_ofSimplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} {n : ℕ} (x : X.obj (Opposite.op { len := n })) (f : X ⟶ Y) : (SSet.Subcomplex.ofSimplex x).image f = SSet.Subcomplex.ofSimplex ((CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { len := n }))) x) - SSet.Subcomplex.preimage_obj 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (p : Y ⟶ X) (n : SimplexCategoryᵒᵖ) : (A.preimage p).obj n = ⇑(CategoryTheory.ConcreteCategory.hom (p.app n)) ⁻¹' A.obj n - SSet.Subcomplex.ofSimplex_map_of_epi 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {n m : ℕ} (f : { len := n } ⟶ { len := m }) [CategoryTheory.Epi f] (x : X.obj (Opposite.op { len := m })) : SSet.Subcomplex.ofSimplex ((CategoryTheory.ConcreteCategory.hom (X.map f.op)) x) = SSet.Subcomplex.ofSimplex x - SSet.Subcomplex.ofSimplex_map_le 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {n m : ℕ} (f : { len := n } ⟶ { len := m }) (x : X.obj (Opposite.op { len := m })) : SSet.Subcomplex.ofSimplex ((CategoryTheory.ConcreteCategory.hom (X.map f.op)) x) ≤ SSet.Subcomplex.ofSimplex x - SSet.Subcomplex.topIso_hom 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
(X : SSet) : (SSet.Subcomplex.topIso X).hom = ⊤.ι - SSet.Subcomplex.topIso_inv_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
(X : SSet) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.topIso X).inv (CategoryTheory.Subfunctor.ι ⊤) = CategoryTheory.CategoryStruct.id X - SSet.Subcomplex.homOfLE_app_val 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {S₁ S₂ : X.Subcomplex} (h : S₁ ≤ S₂) (Δ : SimplexCategoryᵒᵖ) (x : ↑(S₁.obj Δ)) : ↑((CategoryTheory.ConcreteCategory.hom ((SSet.Subcomplex.homOfLE h).app Δ)) x) = ↑x - SSet.Subcomplex.topIso_inv_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
(X : SSet) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.topIso X).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.ι ⊤) h) = h - SSet.Subcomplex.lift_app_coe 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) {B : Y.Subcomplex} (hf : SSet.Subcomplex.range f ≤ B) {n : SimplexCategoryᵒᵖ} (x : X.obj n) : ↑((CategoryTheory.ConcreteCategory.hom ((SSet.Subcomplex.lift f hf).app n)) x) = (CategoryTheory.ConcreteCategory.hom (f.app n)) x - SSet.Subcomplex.topIso_inv_app_hom_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
(X : SSet) (X✝ : SimplexCategoryᵒᵖ) (x : X.obj X✝) : (CategoryTheory.ConcreteCategory.hom ((SSet.Subcomplex.topIso X).inv.app X✝)) x = ⟨x, trivial⟩ - SSet.Subcomplex.toImage_app_hom_apply_coe 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (f : X ⟶ Y) (U : SimplexCategoryᵒᵖ) (x : A.toSSet.obj U) : ↑((CategoryTheory.ConcreteCategory.hom ((A.toImage f).app U)) x) = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp (TypeCat.ofHom fun x => ↑x) (f.app U))) x - SSet.Subcomplex.fromPreimage_app_hom_apply_coe 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (A : X.Subcomplex) (p : Y ⟶ X) (U : SimplexCategoryᵒᵖ) (x : (A.preimage p).toSSet.obj U) : ↑((CategoryTheory.ConcreteCategory.hom ((A.fromPreimage p).app U)) x) = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp (TypeCat.ofHom fun x => ↑x) (p.app U))) x - SSet.Subcomplex.eq_top_iff_contains_nonDegenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
{X : SSet} (A : X.Subcomplex) : A = ⊤ ↔ ∀ (n : ℕ), X.nonDegenerate n ⊆ A.obj (Opposite.op { len := n }) - SSet.Subcomplex.mem_degenerate_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
{X : SSet} (A : X.Subcomplex) {n : ℕ} (x : ↑(A.obj (Opposite.op { len := n }))) : x ∈ A.toSSet.degenerate n ↔ ↑x ∈ X.degenerate n - SSet.Subcomplex.mem_nonDegenerate_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
{X : SSet} (A : X.Subcomplex) {n : ℕ} (x : ↑(A.obj (Opposite.op { len := n }))) : x ∈ A.toSSet.nonDegenerate n ↔ ↑x ∈ X.nonDegenerate n - SSet.Subcomplex.degenerate_eq_top_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
{X : SSet} (A : X.Subcomplex) (n : ℕ) : A.toSSet.degenerate n = ⊤ ↔ X.degenerate n ⊓ A.obj (Opposite.op { len := n }) = A.obj (Opposite.op { len := n }) - SSet.Subcomplex.le_iff_contains_nonDegenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
{X : SSet} (A B : X.Subcomplex) : A ≤ B ↔ ∀ (n : ℕ) (x : ↑(X.nonDegenerate n)), ↑x ∈ A.obj (Opposite.op { len := n }) → ↑x ∈ B.obj (Opposite.op { len := n }) - SSet.Subcomplex.iSup_ofSimplex_nonDegenerate_eq_top 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) : ⨆ x, SSet.Subcomplex.ofSimplex ↑x.snd = ⊤ - SSet.Subcomplex.instHasDimensionLTToSSet 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
{X : SSet} (d : ℕ) [X.HasDimensionLT d] (A : X.Subcomplex) : A.toSSet.HasDimensionLT d - SSet.Subcomplex.hasDimensionLT_of_le 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
{X : SSet} {A B : X.Subcomplex} (h : A ≤ B) (d : ℕ) [B.toSSet.HasDimensionLT d] : A.toSSet.HasDimensionLT d - SSet.hasDimensionLT_iSup_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
{X : SSet} {ι : Type u_1} (A : ι → X.Subcomplex) (d : ℕ) : (⨆ i, A i).toSSet.HasDimensionLT d ↔ ∀ (i : ι), (A i).toSSet.HasDimensionLT d - SSet.instHasDimensionLTToSSetBotSubcomplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
{X : SSet} (n : ℕ) : ⊥.toSSet.HasDimensionLT n - SSet.hasDimensionLT_subcomplex_top_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
(X : SSet) (d : ℕ) : ⊤.toSSet.HasDimensionLT d ↔ X.HasDimensionLT d - SSet.Subcomplex.le_iff_of_hasDimensionLT 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
{X : SSet} (A B : X.Subcomplex) (d : ℕ) [X.HasDimensionLT d] : A ≤ B ↔ ∀ i < d, A.obj (Opposite.op { len := i }) ∩ X.nonDegenerate i ⊆ B.obj (Opposite.op { len := i }) - SSet.Subcomplex.eq_top_iff_of_hasDimensionLT 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
{X : SSet} (A : X.Subcomplex) (d : ℕ) [X.HasDimensionLT d] : A = ⊤ ↔ ∀ i < d, X.nonDegenerate i ⊆ A.obj (Opposite.op { len := i }) - SSet.S.subcomplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (s : X.S) : X.Subcomplex - 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.ofSimplex_eq_subcomplex_mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} {n : ℕ} (x : X.obj (Opposite.op { len := n })) : SSet.Subcomplex.ofSimplex x = { dim := n, simplex := x }.subcomplex - SSet.S.le_def 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} {s t : X.S} : s ≤ t ↔ s.subcomplex ≤ t.subcomplex - SSet.S.subcomplex_toN 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (x : X.S) : x.toN.subcomplex = x.subcomplex - SSet.S.existsUnique_n 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (x : X.S) : ∃! y, y.subcomplex = x.subcomplex - SSet.N.subcomplex_injective 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {x y : X.N} (h : x.subcomplex = y.subcomplex) : x = y - SSet.orderEmbeddingN 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
(X : SSet) : X.N ↪o X.Subcomplex - SSet.N.eq_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {x y : X.N} : x = y ↔ x.subcomplex = y.subcomplex - SSet.N.subcomplex_injective_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {x y : X.N} : x.subcomplex = y.subcomplex ↔ x = y - SSet.S.toN_eq_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {x : X.S} {y : X.N} : x.toN = y ↔ y.subcomplex = x.subcomplex - SSet.N.le_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {x y : X.N} : x ≤ y ↔ x.subcomplex ≤ y.subcomplex - SSet.N.lt_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {x y : X.N} : x < y ↔ x.subcomplex < y.subcomplex - SSet.N.subcomplex_le_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {A B : X.Subcomplex} : A ≤ B ↔ ∀ (s : X.N), s.subcomplex ≤ A → s.subcomplex ≤ B - SSet.N.iSup_subcomplex_eq_top 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
(X : SSet) : ⨆ s, s.subcomplex = ⊤ - SSet.orderEmbeddingN_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
(X : SSet) (x : X.N) : X.orderEmbeddingN x = x.subcomplex - SSet.S.eq_iff_ofSimplex_eq 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {n m : ℕ} (x : X.obj (Opposite.op { len := n })) (y : X.obj (Opposite.op { len := m })) (hx : x ∈ X.nonDegenerate n) (hy : y ∈ X.nonDegenerate m) : { dim := n, simplex := x } = { dim := m, simplex := y } ↔ SSet.Subcomplex.ofSimplex x = SSet.Subcomplex.ofSimplex y - 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.instFiniteToSSet 📋 Mathlib.AlgebraicTopology.SimplicialSet.Finite
(X : SSet) [X.Finite] (A : X.Subcomplex) : A.toSSet.Finite - SSet.finite_iSup_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Finite
{X : SSet} {ι : Type u_1} [Finite ι] (A : ι → X.Subcomplex) : (⨆ i, A i).toSSet.Finite ↔ ∀ (i : ι), (A i).toSSet.Finite - SSet.finite_subcomplex_top_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Finite
(X : SSet) : ⊤.toSSet.Finite ↔ X.Finite - PartialOrder.nerve_ofSimplex_le_ofSimplex_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.NerveNondegenerate
{X : Type u_1} [PartialOrder X] {n m : ℕ} (s : (CategoryTheory.nerve X).obj (Opposite.op { len := n })) (t : (CategoryTheory.nerve X).obj (Opposite.op { len := m })) : SSet.Subcomplex.ofSimplex s ≤ SSet.Subcomplex.ofSimplex t ↔ Set.range s.obj ⊆ Set.range t.obj - SSet.stdSimplex.face 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (S : Finset (Fin (n + 1))) : (SSet.stdSimplex.obj { len := n }).Subcomplex - 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.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.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.face_univ 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : ℕ) : SSet.stdSimplex.face Finset.univ = ⊤ - SSet.stdSimplex.face_empty 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : ℕ) : SSet.stdSimplex.face ∅ = ⊥ - SSet.stdSimplex.ofSimplex_objEquiv_symm_id 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
(n : ℕ) : SSet.Subcomplex.ofSimplex (SSet.stdSimplex.objEquiv.symm (CategoryTheory.CategoryStruct.id { len := n })) = ⊤ - 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.face_singleton_compl 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i : Fin (n + 2)) : SSet.stdSimplex.face {i}ᶜ = SSet.Subcomplex.ofSimplex (SSet.stdSimplex.objEquiv.symm (SimplexCategory.δ i)) - SSet.stdSimplex.ofSimplex_yonedaEquiv_δ 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i : Fin (n + 2)) : SSet.Subcomplex.ofSimplex (SSet.yonedaEquiv (SSet.stdSimplex.δ i)) = SSet.stdSimplex.face {i}ᶜ - SSet.stdSimplex.face_nonDegenerateEquiv' 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n d : ℕ} (x : ↑((SSet.stdSimplex.obj { len := n }).nonDegenerate d)) : SSet.stdSimplex.face ↑(SSet.stdSimplex.nonDegenerateEquiv' x) = SSet.Subcomplex.ofSimplex ↑x - SSet.stdSimplex.face_eq_ofSimplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (S : Finset (Fin (n + 1))) (m : ℕ) (e : Fin (m + 1) ≃o ↥S) : SSet.stdSimplex.face S = SSet.Subcomplex.ofSimplex (SSet.stdSimplex.objMk ((OrderHom.Subtype.val fun x => x ∈ S).comp e.toOrderEmbedding.toOrderHom)) - SSet.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.Subcomplex.op 📋 Mathlib.AlgebraicTopology.SimplicialSet.SubcomplexOp
{X : SSet} (A : X.Subcomplex) : X.op.Subcomplex - SSet.Subcomplex.mem_op_obj_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.SubcomplexOp
{X : SSet} (A : X.Subcomplex) {d : SimplexCategoryᵒᵖ} (x : X.op.obj d) : x ∈ A.op.obj d ↔ SSet.opObjEquiv x ∈ A.obj d - SSet.horn 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i : Fin (n + 1)) : (SSet.stdSimplex.obj { len := n }).Subcomplex - 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.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.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.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.horn_eq_iSup 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i : Fin (n + 1)) : SSet.horn n i = ⨆ j, SSet.stdSimplex.face {↑j}ᶜ - SSet.Subcomplex.BicartSq 📋 Mathlib.AlgebraicTopology.SimplicialSet.SubcomplexColimits
{X : SSet} (A₁ A₂ A₃ A₄ : X.Subcomplex) : Prop - SSet.Subcomplex.MulticoequalizerDiagram 📋 Mathlib.AlgebraicTopology.SimplicialSet.SubcomplexColimits
{X : SSet} (A : X.Subcomplex) {ι : Type u_1} (U : ι → X.Subcomplex) (V : ι → ι → X.Subcomplex) : Prop - SSet.Subcomplex.BicartSq.isPushout 📋 Mathlib.AlgebraicTopology.SimplicialSet.SubcomplexColimits
{X : SSet} {A₁ A₂ A₃ A₄ : X.Subcomplex} (sq : A₁.BicartSq A₂ A₃ A₄) : CategoryTheory.IsPushout (SSet.Subcomplex.homOfLE ⋯) (SSet.Subcomplex.homOfLE ⋯) (SSet.Subcomplex.homOfLE ⋯) (SSet.Subcomplex.homOfLE ⋯) - SSet.Subcomplex.MulticoequalizerDiagram.isColimit 📋 Mathlib.AlgebraicTopology.SimplicialSet.SubcomplexColimits
{X : SSet} {A : X.Subcomplex} {ι : Type u_1} {U : ι → X.Subcomplex} {V : ι → ι → X.Subcomplex} (h : A.MulticoequalizerDiagram U V) : CategoryTheory.Limits.IsColimit ((CompleteLattice.MulticoequalizerDiagram.multicofork h).map SSet.Subcomplex.toSSetFunctor) - SSet.Subcomplex.MulticoequalizerDiagram.isColimit' 📋 Mathlib.AlgebraicTopology.SimplicialSet.SubcomplexColimits
{X : SSet} {A : X.Subcomplex} {ι : Type u_1} {U : ι → X.Subcomplex} {V : ι → ι → X.Subcomplex} (h : A.MulticoequalizerDiagram U V) [LinearOrder ι] : CategoryTheory.Limits.IsColimit ((CompleteLattice.MulticoequalizerDiagram.multicofork h).toLinearOrder.map SSet.Subcomplex.toSSetFunctor) - SSet.horn₃₁.desc.multicofork 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : CategoryTheory.Limits.Multicofork ((CompleteLattice.MulticoequalizerDiagram.multispanIndex ⋯).toLinearOrder.map SSet.Subcomplex.toSSetFunctor) - SSet.horn₃₂.desc.multicofork 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : CategoryTheory.Limits.Multicofork ((CompleteLattice.MulticoequalizerDiagram.multispanIndex ⋯).toLinearOrder.map SSet.Subcomplex.toSSetFunctor) - SSet.horn₃₁.desc.multicofork_pt 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).pt = X - SSet.horn₃₂.desc.multicofork_pt 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).pt = X - SSet.horn.isColimit 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} (i : Fin (n + 1)) : CategoryTheory.Limits.IsColimit ((CompleteLattice.MulticoequalizerDiagram.multicofork ⋯).toLinearOrder.map SSet.Subcomplex.toSSetFunctor) - SSet.horn₃₁.desc.multicofork_π_three 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨3, SSet.horn₃₁.desc.multicofork_π_three._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 3).inv f₃ - SSet.horn₃₁.desc.multicofork_π_two 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨2, SSet.horn₃₁.desc.multicofork_π_two._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 2).inv f₂ - SSet.horn₃₁.desc.multicofork_π_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨0, SSet.horn₃₁.desc.multicofork_π_zero._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 0).inv f₀ - SSet.horn₃₂.desc.multicofork_π_one 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨1, SSet.horn₃₂.desc.multicofork_π_one._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 1).inv f₁ - SSet.horn₃₂.desc.multicofork_π_three 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨3, SSet.horn₃₂.desc.multicofork_π_three._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 3).inv f₃ - SSet.horn₃₂.desc.multicofork_π_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨0, SSet.horn₃₂.desc.multicofork_π_zero._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 0).inv f₀ - SSet.horn₃₁.desc.multicofork_π_three_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) {Z : SSet} (h : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨3, SSet.horn₃₁.desc.multicofork_π_three._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 3).inv f₃) h - SSet.horn₃₁.desc.multicofork_π_two_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) {Z : SSet} (h : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨2, SSet.horn₃₁.desc.multicofork_π_two._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 2).inv f₂) h - SSet.horn₃₁.desc.multicofork_π_zero_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) {Z : SSet} (h : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨0, SSet.horn₃₁.desc.multicofork_π_zero._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 0).inv f₀) h - SSet.horn₃₂.desc.multicofork_π_one_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) {Z : SSet} (h : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨1, SSet.horn₃₂.desc.multicofork_π_one._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 1).inv f₁) h - SSet.horn₃₂.desc.multicofork_π_three_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) {Z : SSet} (h : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨3, SSet.horn₃₂.desc.multicofork_π_three._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 3).inv f₃) h - SSet.horn₃₂.desc.multicofork_π_zero_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) {Z : SSet} (h : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨0, SSet.horn₃₂.desc.multicofork_π_zero._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 0).inv f₀) h - SSet.boundary 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
(n : ℕ) : (SSet.stdSimplex.obj { len := n }).Subcomplex - SSet.op_boundary 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
(n : ℕ) : (SSet.boundary n).op.preimage (SSet.stdSimplex.opIso { len := n }).inv = SSet.boundary n - SSet.face_singleton_compl_le_boundary 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (i : Fin (n + 1)) : SSet.stdSimplex.face {i}ᶜ ≤ SSet.boundary n - SSet.boundary_eq_iSup 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
(n : ℕ) : SSet.boundary n = ⨆ i, SSet.stdSimplex.face {i}ᶜ - SSet.stdSimplex.subcomplex_hasDimensionLT_of_neq_top 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (A : (SSet.stdSimplex.obj { len := n }).Subcomplex) (h : A ≠ ⊤) : A.toSSet.HasDimensionLT n - SSet.boundary_lt_top 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
(n : ℕ) : SSet.boundary n < ⊤ - SSet.boundary_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
: SSet.boundary 0 = ⊥ - SSet.stdSimplex.le_boundary_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (A : (SSet.stdSimplex.obj { len := n }).Subcomplex) : A ≤ SSet.boundary n ↔ A ≠ ⊤ - SSet.stdSimplex.eq_boundary_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (A : (SSet.stdSimplex.obj { len := n }).Subcomplex) : A = SSet.boundary n ↔ SSet.boundary n ≤ A ∧ A ≠ ⊤ - SSet.Subcomplex.instPreservesColimitsOfShapeToSSetFunctorOfIsFilteredOrEmpty 📋 Mathlib.AlgebraicTopology.SimplicialSet.SubcomplexEvaluation
{J : Type u_1} [CategoryTheory.Category.{v_1, u_1} J] {X : SSet} [CategoryTheory.IsFilteredOrEmpty J] : CategoryTheory.Limits.PreservesColimitsOfShape J SSet.Subcomplex.toSSetFunctor - SSet.Subcomplex.evaluation 📋 Mathlib.AlgebraicTopology.SimplicialSet.SubcomplexEvaluation
(X : SSet) (j : SimplexCategoryᵒᵖ) : CategoryTheory.Functor X.Subcomplex (Set (X.obj j)) - SSet.Subcomplex.evaluation_obj 📋 Mathlib.AlgebraicTopology.SimplicialSet.SubcomplexEvaluation
(X : SSet) (j : SimplexCategoryᵒᵖ) (A : X.Subcomplex) : (SSet.Subcomplex.evaluation X j).obj A = A.obj j - SSet.Subcomplex.evaluation_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.SubcomplexEvaluation
(X : SSet) (j : SimplexCategoryᵒᵖ) {X✝ Y✝ : X.Subcomplex} (f : X✝ ⟶ Y✝) : (SSet.Subcomplex.evaluation X j).map f = CategoryTheory.homOfLE ⋯ - SSet.skeleton 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
(X : SSet) : ℕ →o X.Subcomplex - SSet.skeletonOfMono 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) : ℕ →o Y.Subcomplex - SSet.skeletonOfMono_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) : (SSet.skeletonOfMono i) 0 = SSet.Subcomplex.range i - SSet.ofSimplex_le_skeleton 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
(X : SSet) {i : ℕ} (x : X.obj (Opposite.op { len := i })) {n : ℕ} (hi : i < n) : SSet.Subcomplex.ofSimplex x ≤ X.skeleton n - SSet.relativeCellComplexOfMono.t 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) (d : ℕ) : SSet.relativeCellComplexOfMono.sigmaBoundary i d ⟶ ((SSet.skeletonOfMono i) d).toSSet - SSet.relativeCellComplexOfMono.b 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) (d : ℕ) : SSet.relativeCellComplexOfMono.sigmaStdSimplex i d ⟶ ((SSet.skeletonOfMono i) (d + 1)).toSSet - SSet.relativeCellComplexOfMono.Cell.preimage_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} {i : X ⟶ Y} {d : ℕ} (c : SSet.relativeCellComplexOfMono.Cell i d) : ((SSet.skeletonOfMono i) d).preimage c.map = SSet.boundary d - SSet.skeleton_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
(X : SSet) : X.skeleton 0 = ⊥ - SSet.skeleton_le_skeletonOfMono 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) (n : ℕ) : Y.skeleton n ≤ (SSet.skeletonOfMono i) n - SSet.mem_skeleton 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
(X : SSet) {i : ℕ} (x : X.obj (Opposite.op { len := i })) {n : ℕ} (hi : i < n := by lia) : x ∈ (X.skeleton n).obj (Opposite.op { len := i }) - SSet.relativeCellComplexOfMono.Cell.range_map_le 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} {i : X ⟶ Y} {d : ℕ} (c : SSet.relativeCellComplexOfMono.Cell i d) : SSet.Subcomplex.range c.map ≤ (SSet.skeletonOfMono i) (d + 1) - SSet.skeleton_obj_eq_top 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
(X : SSet) {d n : ℕ} (h : d < n) : (X.skeleton n).obj (Opposite.op { len := d }) = ⊤ - SSet.iSup_skeleton 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
(X : SSet) : ⨆ n, X.skeleton n = ⊤ - SSet.relativeCellComplexOfMono.r 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) (d : ℕ) : ((SSet.skeletonOfMono i) d).toSSet ⟶ ((SSet.skeletonOfMono i) (d + 1)).toSSet - SSet.skeletonOfMono_obj_eq_top 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) {d n : ℕ} (h : d < n) : ((SSet.skeletonOfMono i) n).obj (Opposite.op { len := d }) = ⊤ - SSet.iSup_skeletonOfMono 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) : ⨆ n, (SSet.skeletonOfMono i) n = ⊤ - SSet.relativeCellComplexOfMono.isPullback 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) (d : ℕ) : CategoryTheory.IsPullback (SSet.relativeCellComplexOfMono.t i d) (SSet.relativeCellComplexOfMono.l i d) (SSet.relativeCellComplexOfMono.r i d) (SSet.relativeCellComplexOfMono.b i d) - SSet.relativeCellComplexOfMono.isPushout 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) (d : ℕ) : CategoryTheory.IsPushout (SSet.relativeCellComplexOfMono.t i d) (SSet.relativeCellComplexOfMono.l i d) (SSet.relativeCellComplexOfMono.r i d) (SSet.relativeCellComplexOfMono.b i d) - SSet.mem_skeleton_obj_iff_of_nonDegenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
(X : SSet) {d : ℕ} (x : ↑(X.nonDegenerate d)) (n : ℕ) : ↑x ∈ (X.skeleton n).obj (Opposite.op { len := d }) ↔ d < n - SSet.relativeCellComplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
(X : SSet) : HomotopicalAlgebra.RelativeCellComplex (fun n x => (SSet.boundary n).ι) ⊥.ι - SSet.relativeCellComplexCellsEquiv 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X : SSet} : X.relativeCellComplex.Cells ≃ X.N - SSet.relativeCellComplexOfMono.Cell.ι_b_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} {i : X ⟶ Y} {d : ℕ} (c : SSet.relativeCellComplexOfMono.Cell i d) : CategoryTheory.CategoryStruct.comp c.ιSigmaStdSimplex (CategoryTheory.CategoryStruct.comp (SSet.relativeCellComplexOfMono.b i d) ((SSet.skeletonOfMono i) (d + 1)).ι) = c.map - SSet.skeleton_succ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
(X : SSet) (n : ℕ) : X.skeleton (n + 1) = X.skeleton n ⊔ ⨆ x, SSet.Subcomplex.ofSimplex ↑x - SSet.relativeCellComplexOfMono_F 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) [CategoryTheory.Mono i] : (SSet.relativeCellComplexOfMono i).F = ⋯.functor.comp SSet.Subcomplex.toSSetFunctor - SSet.relativeCellComplexOfMono.w 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) (d : ℕ) : CategoryTheory.CategoryStruct.comp (SSet.relativeCellComplexOfMono.t i d) (SSet.relativeCellComplexOfMono.r i d) = CategoryTheory.CategoryStruct.comp (SSet.relativeCellComplexOfMono.l i d) (SSet.relativeCellComplexOfMono.b i d) - SSet.relativeCellComplexOfMono.Cell.ι_b_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} {i : X ⟶ Y} {d : ℕ} (c : SSet.relativeCellComplexOfMono.Cell i d) {Z : SSet} (h : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp c.ιSigmaStdSimplex (CategoryTheory.CategoryStruct.comp (SSet.relativeCellComplexOfMono.b i d) (CategoryTheory.CategoryStruct.comp ((SSet.skeletonOfMono i) (d + 1)).ι h)) = CategoryTheory.CategoryStruct.comp c.map h - SSet.relativeCellComplexOfMono.Cell.mem_skeletonOfMono_obj_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} {i : X ⟶ Y} {d : ℕ} (c : SSet.relativeCellComplexOfMono.Cell i d) {d' : ℕ} : c.simplex ∈ ((SSet.skeletonOfMono i) d').obj (Opposite.op { len := d }) ↔ c.simplex ∈ Set.range ⇑(CategoryTheory.ConcreteCategory.hom (i.app (Opposite.op { len := d }))) ∨ d < d' - SSet.relativeCellComplexOfMono.w_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) (d : ℕ) {Z : SSet} (h : ((SSet.skeletonOfMono i) (d + 1)).toSSet ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.relativeCellComplexOfMono.t i d) (CategoryTheory.CategoryStruct.comp (SSet.relativeCellComplexOfMono.r i d) h) = CategoryTheory.CategoryStruct.comp (SSet.relativeCellComplexOfMono.l i d) (CategoryTheory.CategoryStruct.comp (SSet.relativeCellComplexOfMono.b i d) h) - SSet.relativeCellComplexOfMono.Cell.ι_t_ι_eq_ι_l_b_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} {i : X ⟶ Y} {d : ℕ} (c : SSet.relativeCellComplexOfMono.Cell i d) : CategoryTheory.CategoryStruct.comp c.ιSigmaBoundary (CategoryTheory.CategoryStruct.comp (SSet.relativeCellComplexOfMono.t i d) ((SSet.skeletonOfMono i) d).ι) = CategoryTheory.CategoryStruct.comp (SSet.boundary d).ι (CategoryTheory.CategoryStruct.comp c.ιSigmaStdSimplex (CategoryTheory.CategoryStruct.comp (SSet.relativeCellComplexOfMono.b i d) ((SSet.skeletonOfMono i) (d + 1)).ι))
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