Theorems · Theorem · algebraic topology
SSet.Subcomplex.Pairing.RankFunction.iSup_filtration_iio
∀ {X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [inst : LinearOrder ι] (f : P.RankFunction ι) [OrderBot ι]
[SuccOrder ι] (m : ι), Order.IsSuccLimit m → ⨆ i, f.filtration ↑i = f.filtration m- Cited by
- 0 results in Mathlib
- Foundations
- Depth 70 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LinearOrderOrderBotSuccOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites38
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Setstatement · cited by 53,352
- LinearOrderstatement and proof · cited by 8,572
- Oppositestatement · cited by 8,081
- Set.Elemstatement and proof · cited by 7,166
- Bot.botproof · cited by 4,720
- LE.le.transproof · cited by 3,151
- iSupstatement and proof · cited by 2,415
- SimplexCategorystatement · cited by 2,204
- LT.lt.leproof · cited by 2,189
- le_antisymmproof · cited by 2,068
- le_reflproof · cited by 2,061
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.