Theorems · Theorem · algebraic topology
SSet.Subcomplex.Pairing.RankFunction.Cell.image_horn_lt_subcomplex
∀ {X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [inst : LinearOrder ι] {f : P.RankFunction ι} {i : ι}
(c : f.Cell i) [inst_1 : P.IsProper], c.horn.image c.map < (↑(P.p c.s)).subcomplex- Cited by
- 1 results in Mathlib
- Foundations
- Depth 101 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites32
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Setstatement · cited by 53,352
- CategoryTheory.Functor.objstatement · cited by 19,642
- LinearOrderstatement and proof · cited by 8,572
- Equivstatement · cited by 8,337
- Oppositestatement · cited by 8,081
- Set.Elemstatement · cited by 7,166
- SimplexCategorystatement · cited by 2,204
- SSetstatement and proof · cited by 1,283
- SSet.stdSimplexstatement · cited by 499
- SSet.Subcomplexstatement and proof · cited by 461
- SSet.N.toSstatement and proof · cited by 171
Cited by1
Results whose statement or proof uses this declaration.
- SSet.Subcomplex.Pairing.RankFunction.Cell.preimage_filtration_mapproof · cited by 1