Theorems · Definition · algebraic topology
SSet.Subcomplex.Pairing.WeakRankFunction.casesOn
{X : SSet} →
{A : X.Subcomplex} →
{P : A.Pairing} →
{α : Type v} →
[inst : PartialOrder α] →
{motive : P.WeakRankFunction α → Sort u_1} →
(t : P.WeakRankFunction α) →
((rank : ↑P.II → α) →
(lt : ∀ {x y : ↑P.II}, P.AncestralRel x y → (↑x).dim = (↑y).dim → rank x < rank y) →
motive { rank := rank, lt := lt }) →
motive t- Cited by
- 0 results in Mathlib
- Foundations
- Depth 95 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PartialOrder
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.
- Setstatement · cited by 53,352
- Set.Elemstatement and proof · cited by 7,166
- PartialOrderstatement and proof · cited by 6,410
- SSetstatement and proof · cited by 1,283
- SSet.Subcomplexstatement and proof · cited by 461
- SSet.N.toSstatement and proof · cited by 171
- SSet.S.dimstatement and proof · cited by 162
- SSet.Subcomplex.Nstatement · cited by 155
- SSet.Subcomplex.N.toNstatement and proof · cited by 126
- SSet.Subcomplex.Pairingstatement and proof · cited by 117
- SSet.Subcomplex.Pairing.IIstatement and proof · cited by 58
- SSet.Subcomplex.Pairing.AncestralRelstatement and proof · cited by 22
Cited by2
Results whose statement or proof uses this declaration.
- SSet.Subcomplex.Pairing.WeakRankFunction.noConfusionproof · cited by 0
- SSet.Subcomplex.Pairing.WeakRankFunction.noConfusionTypeproof · cited by 0