Theorems · Theorem · algebraic topology
SSet.Subcomplex.range_eq_ofSimplex
∀ {X : SSet} {n : ℕ} (f : SSet.stdSimplex.obj { len := n } ⟶ X),
SSet.Subcomplex.range f = SSet.Subcomplex.ofSimplex (SSet.yonedaEquiv f)- Cited by
- 5 results in Mathlib
- Foundations
- Depth 34 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Quiver.Homstatement and proof · cited by 32,603
- CategoryTheory.Functor.objstatement and proof · cited by 19,642
- Equivstatement · cited by 8,337
- Oppositestatement · cited by 8,081
- SimplexCategorystatement · cited by 2,204
- SSetstatement and proof · cited by 1,283
- SSet.stdSimplexstatement and proof · cited by 499
- SSet.Subcomplexstatement · cited by 461
- SSet.Subcomplex.ofSimplexstatement · cited by 73
- SSet.yonedaEquivstatement · cited by 55
- SSet.Subcomplex.rangestatement · cited by 49
Cited by5
Results whose statement or proof uses this declaration.
- SSet.relativeCellComplexOfMono.Cell.range_map_leproof · cited by 3
- SSet.Subcomplex.Pairing.RankFunction.Cell.range_mapproof · cited by 2
- SSet.Subcomplex.ofSimplexProd_eq_rangeproof · cited by 1
- SSet.stdSimplex.range_δproof · cited by 0
- SSet.Finite.exists_epi_from_isCardinalPresentableproof · cited by 0