Theorems · Theorem · algebraic topology
SSet.Subcomplex.Pairing.RankFunction.filtration_bot
∀ {X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [inst : LinearOrder ι] (f : P.RankFunction ι)
[inst_1 : OrderBot ι], f.filtration ⊥ = A- Cited by
- 3 results in Mathlib
- Foundations
- Depth 67 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LinearOrderOrderBot
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites20
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- LinearOrderstatement and proof · cited by 8,572
- Bot.botstatement · cited by 4,720
- iSupproof · cited by 2,415
- SSetstatement and proof · cited by 1,283
- OrderBotstatement and proof · cited by 1,055
- SSet.Subcomplexstatement and proof · cited by 461
- iSup_congr_Propproof · cited by 247
- sup_of_le_leftproof · cited by 218
- SSet.N.toSproof · cited by 171
- SSet.Subcomplex.N.toNproof · cited by 126
- SSet.Subcomplex.Pairingstatement and proof · cited by 117
Cited by4
Results whose statement or proof uses this declaration.
- SSet.Subcomplex.Pairing.RankFunction.relativeCellComplexproof · cited by 2
- SSet.Subcomplex.Pairing.RankFunction.iSup_filtration_iioproof · cited by 0
- SSet.Subcomplex.Pairing.RankFunction.filtration_of_isSuccLimitproof · cited by 0
- SSet.Subcomplex.Pairing.RankFunction.iSup_filtrationproof · cited by 0