Loogle!
Result
Found 1957 declarations mentioning SSet. Of these, only the first 200 are shown.
- SSet 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
: Type (u + 1) - SSet.uliftFunctor 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
: CategoryTheory.Functor SSet SSet - SSet.cosk 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : CategoryTheory.Functor SSet SSet - SSet.sk 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : CategoryTheory.Functor SSet SSet - SSet.evaluation 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
: CategoryTheory.Functor SimplexCategoryᵒᵖ (CategoryTheory.Functor SSet (Type u)) - SSet.truncation 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : CategoryTheory.Functor SSet (SSet.Truncated n) - SSet.Truncated.cosk 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : CategoryTheory.Functor (SSet.Truncated n) SSet - SSet.Truncated.sk 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : CategoryTheory.Functor (SSet.Truncated n) SSet - SSet.Truncated.cosk.faithful 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : (SSet.Truncated.cosk n).Faithful - SSet.Truncated.cosk.full 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : (SSet.Truncated.cosk n).Full - SSet.Truncated.cosk.fullyFaithful 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : (SSet.Truncated.cosk n).FullyFaithful - SSet.Truncated.coskAdj.reflective 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : CategoryTheory.Reflective (SSet.Truncated.cosk n) - SSet.Truncated.sk.faithful 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : (SSet.Truncated.sk n).Faithful - SSet.Truncated.sk.full 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : (SSet.Truncated.sk n).Full - SSet.Truncated.sk.fullyFaithful 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : (SSet.Truncated.sk n).FullyFaithful - SSet.Truncated.skAdj.coreflective 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : CategoryTheory.Coreflective (SSet.Truncated.sk n) - SSet.const 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{X Y : SSet} (y : Y.obj (Opposite.op { len := 0 })) : X ⟶ Y - SSet.coskAdj 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : SSet.truncation n ⊣ SSet.Truncated.cosk n - SSet.skAdj 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : SSet.Truncated.sk n ⊣ SSet.truncation n - SSet.id_app 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(X : SSet) (n : SimplexCategoryᵒᵖ) : (CategoryTheory.CategoryStruct.id X).app n = CategoryTheory.CategoryStruct.id (X.obj n) - SSet.comp_const 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{X Y Z : SSet} (f : X ⟶ Y) (z : Z.obj (Opposite.op { len := 0 })) : CategoryTheory.CategoryStruct.comp f (SSet.const z) = SSet.const z - SSet.hom_ext 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{X Y : SSet} {f g : X ⟶ Y} (w : ∀ (n : SimplexCategoryᵒᵖ), f.app n = g.app n) : f = g - SSet.hom_ext_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{X Y : SSet} {f g : X ⟶ Y} : f = g ↔ ∀ (n : SimplexCategoryᵒᵖ), f.app n = g.app n - SSet.truncationCompTrunc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{n m : ℕ} (h : m ≤ n) : (SSet.truncation n).comp (SSet.Truncated.trunc n m ⋯) ≅ SSet.truncation m - SSet.comp_app 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{X Y Z : SSet} (f : X ⟶ Y) (g : Y ⟶ Z) (n : SimplexCategoryᵒᵖ) : (CategoryTheory.CategoryStruct.comp f g).app n = CategoryTheory.CategoryStruct.comp (f.app n) (g.app n) - SSet.Truncated.cosk_reflective 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : CategoryTheory.IsIso (SSet.coskAdj n).counit - SSet.Truncated.sk_coreflective 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
(n : ℕ) : CategoryTheory.IsIso (SSet.skAdj n).unit - SSet.comp_app_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{X Y Z : SSet} (f : X ⟶ Y) (g : Y ⟶ Z) (n : SimplexCategoryᵒᵖ) {Z✝ : Type u_1} (h : Z.obj n ⟶ Z✝) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.CategoryStruct.comp f g).app n) h = CategoryTheory.CategoryStruct.comp (f.app n) (CategoryTheory.CategoryStruct.comp (g.app n) h) - SSet.const_comp 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{X Y Z : SSet} (y : Y.obj (Opposite.op { len := 0 })) (g : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.const y) g = SSet.const ((CategoryTheory.ConcreteCategory.hom (g.app (Opposite.op { len := 0 }))) y) - SSet.const_app 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{X Y : SSet} (y : Y.obj (Opposite.op { len := 0 })) (n : SimplexCategoryᵒᵖ) : (SSet.const y).app n = TypeCat.ofHom fun x => (CategoryTheory.ConcreteCategory.hom (Y.map ((Opposite.unop n).const { len := 0 } 0).op)) y - SSet.δ_comp_σ_self_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{S : SSet} {n : ℕ} (i : Fin (n + 1)) (x : S.obj (Opposite.op { len := n })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i.castSucc)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ S i)) x) = x - SSet.δ_comp_σ_succ_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{S : SSet} {n : ℕ} (i : Fin (n + 1)) (x : S.obj (Opposite.op { len := n })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i.succ)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ S i)) x) = x - SSet.δ_comp_σ_self'_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{S : SSet} {n : ℕ} {j : Fin (n + 2)} {i : Fin (n + 1)} (H : j = i.castSucc) (x : S.obj (Opposite.op { len := n })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S j)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ S i)) x) = x - SSet.δ_comp_σ_succ'_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{S : SSet} {n : ℕ} {j : Fin (n + 2)} {i : Fin (n + 1)} (H : j = i.succ) (x : S.obj (Opposite.op { len := n })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S j)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ S i)) x) = x - SSet.σ_naturality_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{S T : SSet} (f : S ⟶ T) {n : ℕ} (i : Fin (n + 1)) (x : S.obj (Opposite.op { len := n })) : (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { len := n + 1 }))) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ S i)) x) = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ T i)) ((CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { len := n }))) x) - SSet.δ_naturality_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{S T : SSet} (f : S ⟶ T) {n : ℕ} (i : Fin (n + 2)) (x : S.obj (Opposite.op { len := n + 1 })) : (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { len := n }))) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i)) x) = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ T i)) ((CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { len := n + 1 }))) x) - SSet.δ_comp_δ_self_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{S : SSet} {n : ℕ} {i : Fin (n + 2)} (x : S.obj (Opposite.op { len := n + 2 })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i.castSucc)) x) = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i.succ)) x) - SSet.σ_comp_σ_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{S : SSet} {n : ℕ} {i j : Fin (n + 1)} (H : i ≤ j) (x : S.obj (Opposite.op { len := n })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ S i.castSucc)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ S j)) x) = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ S j.succ)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ S i)) x) - SSet.δ_comp_δ_self'_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{S : SSet} {n : ℕ} {i : Fin (n + 2)} {j : Fin (n + 3)} (H : j = i.castSucc) (x : S.obj (Opposite.op { len := n + 2 })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S j)) x) = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i.succ)) x) - SSet.δ_comp_δ_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{S : SSet} {n : ℕ} {i j : Fin (n + 2)} (H : i ≤ j) (x : S.obj (Opposite.op { len := n + 2 })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S j.succ)) x) = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S j)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i.castSucc)) x) - SSet.δ_comp_σ_of_le_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{S : SSet} {n : ℕ} {i : Fin (n + 2)} {j : Fin (n + 1)} (H : i ≤ j.castSucc) (x : S.obj (Opposite.op { len := n + 1 })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i.castSucc)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ S j.succ)) x) = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ S j)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i)) x) - SSet.δ_comp_σ_of_gt_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{S : SSet} {n : ℕ} {i : Fin (n + 2)} {j : Fin (n + 1)} (H : j.castSucc < i) (x : S.obj (Opposite.op { len := n + 1 })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i.succ)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ S j.castSucc)) x) = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ S j)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i)) x) - SSet.δ_comp_δ''_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{S : SSet} {n : ℕ} {i : Fin (n + 3)} {j : Fin (n + 2)} (H : i ≤ j.castSucc) (x : S.obj (Opposite.op { len := n + 2 })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S (i.castLT ⋯))) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S j.succ)) x) = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S j)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i)) x) - SSet.δ_comp_δ'_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{S : SSet} {n : ℕ} {i : Fin (n + 2)} {j : Fin (n + 3)} (H : i.castSucc < j) (x : S.obj (Opposite.op { len := n + 2 })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S j)) x) = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S (j.pred ⋯))) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i.castSucc)) x) - SSet.δ_comp_σ_of_gt'_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Basic
{S : SSet} {n : ℕ} {i : Fin (n + 3)} {j : Fin (n + 2)} (H : j.succ < i) (x : S.obj (Opposite.op { len := n + 1 })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S i)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ S j)) x) = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ S (j.castLT ⋯))) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S (i.pred ⋯))) x) - SSet.op 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
(X : SSet) : SSet - SSet.opEquivalence 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
: SSet ≌ SSet - SSet.opFunctor 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
: CategoryTheory.Functor SSet SSet - SSet.opObjEquiv 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
{X : SSet} {n : SimplexCategoryᵒᵖ} : X.op.obj n ≃ X.obj n - SSet.opEquivalence_functor 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
: SSet.opEquivalence.functor = SSet.opFunctor - SSet.opEquivalence_inverse 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
: SSet.opEquivalence.inverse = SSet.opFunctor - SSet.opFunctorCompOpFunctorIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
: SSet.opFunctor.comp SSet.opFunctor ≅ CategoryTheory.Functor.id SSet - SSet.opEquivalence_counitIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
: SSet.opEquivalence.counitIso = SSet.opFunctorCompOpFunctorIso - SSet.opEquivalence_unitIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
: SSet.opEquivalence.unitIso = SSet.opFunctorCompOpFunctorIso.symm - SSet.opFunctor_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
{X Y : SSet} (f : X ⟶ Y) {n : SimplexCategoryᵒᵖ} (x : X.op.obj n) : (CategoryTheory.ConcreteCategory.hom ((SSet.opFunctor.map f).app n)) x = SSet.opObjEquiv.symm ((CategoryTheory.ConcreteCategory.hom (f.app n)) (SSet.opObjEquiv x)) - SSet.σ_opObjEquiv 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
(X : SSet) {n : ℕ} (i : Fin (n + 1)) (x : X.op.obj (Opposite.op { len := n })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ X i)) (SSet.opObjEquiv x) = SSet.opObjEquiv ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ X.op i.rev)) x) - SSet.δ_opObjEquiv 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
(X : SSet) {n : ℕ} (i : Fin (n + 2)) (x : X.op.obj (Opposite.op { len := n + 1 })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X i)) (SSet.opObjEquiv x) = SSet.opObjEquiv ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X.op i.rev)) x) - SSet.op_δ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
(X : SSet) {n : ℕ} (i : Fin (n + 2)) (x : X.op.obj (Opposite.op { len := n + 1 })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X.op i)) x = SSet.opObjEquiv.symm ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X i.rev)) (SSet.opObjEquiv x)) - SSet.op_σ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
(X : SSet) {n : ℕ} (i : Fin (n + 1)) (x : X.op.obj (Opposite.op { len := n })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ X.op i)) x = SSet.opObjEquiv.symm ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ X i.rev)) (SSet.opObjEquiv x)) - SSet.op_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
(X : SSet) {n m : SimplexCategoryᵒᵖ} (f : n ⟶ m) (x : X.op.obj n) : (CategoryTheory.ConcreteCategory.hom (X.op.map f)) x = SSet.opObjEquiv.symm ((CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.rev.map f.unop).op)) (SSet.opObjEquiv x)) - SSet.opFunctorCompOpFunctorIso_hom_app_app_hom_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
(X : SSet) (X✝ : SimplexCategoryᵒᵖ) (x : (SSet.opFunctor.obj (SSet.opFunctor.obj X)).obj X✝) : (CategoryTheory.ConcreteCategory.hom ((SSet.opFunctorCompOpFunctorIso.hom.app X).app X✝)) x = SSet.opObjEquiv (SSet.opObjEquiv x) - SSet.opFunctorCompOpFunctorIso_inv_app_app_hom_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Op
(X : SSet) (X✝ : SimplexCategoryᵒᵖ) (x : X.obj X✝) : (CategoryTheory.ConcreteCategory.hom ((SSet.opFunctorCompOpFunctorIso.inv.app X).app X✝)) x = SSet.opObjEquiv.symm (SSet.opObjEquiv.symm x) - 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.instBalanced 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
: CategoryTheory.Balanced 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.instEpiToRange 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) : CategoryTheory.Epi (SSet.Subcomplex.toRange f) - SSet.Subcomplex.toRange 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) : X ⟶ (SSet.Subcomplex.range f).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.instIsIsoToRangeOfMono 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) [CategoryTheory.Mono f] : CategoryTheory.IsIso (SSet.Subcomplex.toRange f) - SSet.Subcomplex.instMonoToRange 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) [CategoryTheory.Mono f] : CategoryTheory.Mono (SSet.Subcomplex.toRange 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.toRange_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.toRange f) (SSet.Subcomplex.range f).ι = f - 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.ofSimplex_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} (x : X.obj (Opposite.op { len := 0 })) : (SSet.Subcomplex.ofSimplex x).ι = SSet.const x - 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.mem_ofSimplex_obj 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {n : ℕ} (x : X.obj (Opposite.op { len := n })) : x ∈ (SSet.Subcomplex.ofSimplex x).obj (Opposite.op { len := n }) - SSet.Subcomplex.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.toRange_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) {Z : SSet} (h : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.toRange f) (CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.range f).ι h) = CategoryTheory.CategoryStruct.comp f h - 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.mem_ofSimplex_obj_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {n : ℕ} (x : X.obj (Opposite.op { len := n })) {m : SimplexCategoryᵒᵖ} (y : X.obj m) : y ∈ (SSet.Subcomplex.ofSimplex x).obj m ↔ ∃ f, (CategoryTheory.ConcreteCategory.hom (X.map f.op)) x = y - SSet.Subcomplex.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.toRange_app_val 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X Y : SSet} (f : X ⟶ Y) {Δ : SimplexCategoryᵒᵖ} (x : X.obj Δ) : ↑((CategoryTheory.ConcreteCategory.hom ((SSet.Subcomplex.toRange f).app Δ)) x) = (CategoryTheory.ConcreteCategory.hom (f.app Δ)) x - 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.degenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) (n : ℕ) : Set (X.obj (Opposite.op { len := n })) - SSet.nonDegenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) (n : ℕ) : Set (X.obj (Opposite.op { len := n })) - SSet.nondegenerate_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) : X.nonDegenerate 0 = Set.univ - SSet.nonDegenerateEquivOfIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
{X Y : SSet} (e : X ≅ Y) {n : ℕ} : ↑(X.nonDegenerate n) ≃ ↑(Y.nonDegenerate n) - SSet.degenerate_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) : X.degenerate 0 = ∅ - SSet.mem_degenerate_iff_notMem_nonDegenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) {n : ℕ} (x : X.obj (Opposite.op { len := n })) : x ∈ X.degenerate n ↔ x ∉ X.nonDegenerate n - SSet.mem_nonDegenerate_iff_notMem_degenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) {n : ℕ} (x : X.obj (Opposite.op { len := n })) : x ∈ X.nonDegenerate n ↔ x ∉ X.degenerate n - 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.degenerate_le_preimage 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
{X Y : SSet} (f : X ⟶ Y) (n : ℕ) : X.degenerate n ⊆ ⇑(CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { len := n }))) ⁻¹' Y.degenerate 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.image_degenerate_le 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
{X Y : SSet} (f : X ⟶ Y) (n : ℕ) : ⇑(CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { len := n }))) '' X.degenerate n ⊆ Y.degenerate 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.degenerate_app_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
{X Y : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := n })} (hx : x ∈ X.degenerate n) (f : X ⟶ Y) : (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { len := n }))) x ∈ Y.degenerate n - SSet.opObjEquiv_mem_degenerate_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) {n : ℕ} (x : X.op.obj (Opposite.op { len := n })) : SSet.opObjEquiv x ∈ X.degenerate n ↔ x ∈ X.op.degenerate n - SSet.opObjEquiv_mem_nonDegenerate_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) {n : ℕ} (x : X.op.obj (Opposite.op { len := n })) : SSet.opObjEquiv x ∈ X.nonDegenerate n ↔ x ∈ X.op.nonDegenerate n - SSet.degenerate_iff_of_isIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
{X Y : SSet} (f : X ⟶ Y) [CategoryTheory.IsIso f] {n : ℕ} (x : X.obj (Opposite.op { len := n })) : (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { len := n }))) x ∈ Y.degenerate n ↔ x ∈ X.degenerate n - SSet.degenerate_iff_of_mono 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
{X : SSet} {n : ℕ} {Y : SSet} (f : X ⟶ Y) [CategoryTheory.Mono f] (x : X.obj (Opposite.op { len := n })) : (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { len := n }))) x ∈ Y.degenerate n ↔ x ∈ X.degenerate n - SSet.nonDegenerate_iff_of_isIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
{X Y : SSet} (f : X ⟶ Y) [CategoryTheory.IsIso f] {n : ℕ} (x : X.obj (Opposite.op { len := n })) : (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { len := n }))) x ∈ Y.nonDegenerate n ↔ x ∈ X.nonDegenerate n - SSet.nonDegenerate_iff_of_mono 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
{X : SSet} {n : ℕ} {Y : SSet} (f : X ⟶ Y) [CategoryTheory.Mono f] (x : X.obj (Opposite.op { len := n })) : (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { len := n }))) x ∈ Y.nonDegenerate n ↔ x ∈ X.nonDegenerate n - SSet.mono_of_nonDegenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) {n : ℕ} (x : ↑(X.nonDegenerate n)) {m : SimplexCategory} (f : { len := n } ⟶ m) (y : X.obj (Opposite.op m)) (hy : (CategoryTheory.ConcreteCategory.hom (X.map f.op)) y = ↑x) : CategoryTheory.Mono f - 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.isIso_of_nonDegenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) {n : ℕ} (x : ↑(X.nonDegenerate n)) {m : SimplexCategory} (f : { len := n } ⟶ m) [CategoryTheory.Epi f] (y : X.obj (Opposite.op m)) (hy : (CategoryTheory.ConcreteCategory.hom (X.map f.op)) y = ↑x) : CategoryTheory.IsIso f - SSet.σ_mem_degenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) {n : ℕ} (i : Fin (n + 1)) (x : X.obj (Opposite.op { len := n })) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ X i)) x ∈ X.degenerate (n + 1) - SSet.degenerate_eq_iUnion_range_σ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) {n : ℕ} : X.degenerate (n + 1) = ⋃ i, Set.range ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ X i)) - SSet.exists_nonDegenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) {n : ℕ} (x : X.obj (Opposite.op { len := n })) : ∃ m f, ∃ (_ : CategoryTheory.Epi f), ∃ y, x = (CategoryTheory.ConcreteCategory.hom (X.map f.op)) ↑y - SSet.mem_degenerate_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) {n : ℕ} (x : X.obj (Opposite.op { len := n })) : x ∈ X.degenerate n ↔ ∃ m, ∃ (_ : m < n), ∃ f, ∃ (_ : CategoryTheory.Epi f), x ∈ Set.range ⇑(CategoryTheory.ConcreteCategory.hom (X.map f.op)) - SSet.Subcomplex.iSup_ofSimplex_nonDegenerate_eq_top 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) : ⨆ x, SSet.Subcomplex.ofSimplex ↑x.snd = ⊤ - SSet.nonDegenerateEquivOfIso_apply_coe 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
{X Y : SSet} (e : X ≅ Y) {n : ℕ} (x✝ : ↑(X.nonDegenerate n)) : ↑((SSet.nonDegenerateEquivOfIso e) x✝) = (CategoryTheory.ConcreteCategory.hom (e.hom.app (Opposite.op { len := n }))) ↑x✝ - SSet.nonDegenerateEquivOfIso_symm_apply_coe 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
{X Y : SSet} (e : X ≅ Y) {n : ℕ} (x✝ : ↑(Y.nonDegenerate n)) : ↑((SSet.nonDegenerateEquivOfIso e).symm x✝) = (CategoryTheory.ConcreteCategory.hom (e.inv.app (Opposite.op { len := n }))) ↑x✝ - SSet.unique_nonDegenerate_dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) {n : ℕ} (x : X.obj (Opposite.op { len := n })) {m₁ m₂ : ℕ} (f₁ : { len := n } ⟶ { len := m₁ }) [CategoryTheory.Epi f₁] (y₁ : ↑(X.nonDegenerate m₁)) (hy₁ : x = (CategoryTheory.ConcreteCategory.hom (X.map f₁.op)) ↑y₁) (f₂ : { len := n } ⟶ { len := m₂ }) [CategoryTheory.Epi f₂] (y₂ : ↑(X.nonDegenerate m₂)) (hy₂ : x = (CategoryTheory.ConcreteCategory.hom (X.map f₂.op)) ↑y₂) : m₁ = m₂ - SSet.unique_nonDegenerate_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) {n : ℕ} (x : X.obj (Opposite.op { len := n })) {m : ℕ} (f₁ : { len := n } ⟶ { len := m }) [CategoryTheory.Epi f₁] (y₁ : ↑(X.nonDegenerate m)) (hy₁ : x = (CategoryTheory.ConcreteCategory.hom (X.map f₁.op)) ↑y₁) (f₂ : { len := n } ⟶ { len := m }) (y₂ : ↑(X.nonDegenerate m)) (hy₂ : x = (CategoryTheory.ConcreteCategory.hom (X.map f₂.op)) ↑y₂) : f₁ = f₂ - SSet.unique_nonDegenerate_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.Degenerate
(X : SSet) {n : ℕ} (x : X.obj (Opposite.op { len := n })) {m : ℕ} (f₁ : { len := n } ⟶ { len := m }) [CategoryTheory.Epi f₁] (y₁ : ↑(X.nonDegenerate m)) (hy₁ : x = (CategoryTheory.ConcreteCategory.hom (X.map f₁.op)) ↑y₁) (f₂ : { len := n } ⟶ { len := m }) (y₂ : ↑(X.nonDegenerate m)) (hy₂ : x = (CategoryTheory.ConcreteCategory.hom (X.map f₂.op)) ↑y₂) : y₁ = y₂ - SSet.HasDimensionLE 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
(X : SSet) (d : ℕ) : Prop - SSet.HasDimensionLT 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
(X : SSet) (d : ℕ) : Prop - SSet.Subcomplex.instHasDimensionLTToSSet 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
{X : SSet} (d : ℕ) [X.HasDimensionLT d] (A : X.Subcomplex) : A.toSSet.HasDimensionLT d - SSet.hasDimensionLT_of_le 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
(X : SSet) (d : ℕ) [X.HasDimensionLT d] (n : ℕ) (hn : d ≤ n := by lia) : X.HasDimensionLT n - SSet.instHasDimensionLTHAddNat 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
(X : SSet) (n : ℕ) [X.HasDimensionLT n] (k : ℕ) : X.HasDimensionLT (n + k) - SSet.hasDimensionLT_iff_of_iso 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
{X Y : SSet} (e : X ≅ Y) (d : ℕ) : X.HasDimensionLT d ↔ Y.HasDimensionLT d - SSet.dim_le_of_nonDegenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
(X : SSet) {n : ℕ} (x : ↑(X.nonDegenerate n)) (d : ℕ) [X.HasDimensionLE d] : n ≤ d - SSet.dim_lt_of_nonDegenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
(X : SSet) {n : ℕ} (x : ↑(X.nonDegenerate n)) (d : ℕ) [X.HasDimensionLT d] : n < d - SSet.instHasDimensionLTToSSetRange 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
{X Y : SSet} (f : X ⟶ Y) (d : ℕ) [X.HasDimensionLT d] : (SSet.Subcomplex.range f).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.hasDimensionLT_of_epi 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
{X Y : SSet} (f : X ⟶ Y) [CategoryTheory.Epi f] (d : ℕ) [X.HasDimensionLT d] : Y.HasDimensionLT d - SSet.hasDimensionLT_of_mono 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
{X Y : SSet} (f : X ⟶ Y) [CategoryTheory.Mono f] (d : ℕ) [Y.HasDimensionLT d] : X.HasDimensionLT d - SSet.degenerate_eq_top_of_hasDimensionLT 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
(X : SSet) (d : ℕ) [X.HasDimensionLT d] (n : ℕ) (hn : d ≤ n := by lia) : X.degenerate n = Set.univ - SSet.degenerate_eq_univ_of_hasDimensionLT 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
(X : SSet) (d : ℕ) [X.HasDimensionLT d] (n : ℕ) (hn : d ≤ n := by lia) : X.degenerate n = Set.univ - SSet.nonDegenerate_eq_bot_of_hasDimensionLT 📋 Mathlib.AlgebraicTopology.SimplicialSet.Dimension
(X : SSet) (d : ℕ) [X.HasDimensionLT d] (n : ℕ) (hn : d ≤ n := by lia) : X.nonDegenerate n = ∅
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