Theorems · Inductive type · algebraic topology
SSet.Subcomplex.PairingCore.RankFunction
{X : SSet} → {A : X.Subcomplex} → A.PairingCore → (α : Type v) → [PartialOrder α] → Type (max u_1 v)A rank function for h : A.PairingCore is a function from the index type h.ι
to a partially ordered type which maps the ancestrality relations to strict inequalities.
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 34 from the axioms · uses propext, Quot.sound
- Assumes
- PartialOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- PartialOrderstatement · cited by 6,410
- SSetstatement · cited by 1,283
- SSet.Subcomplexstatement · cited by 461
- SSet.Subcomplex.PairingCorestatement · cited by 50
Cited by15
Results whose statement or proof uses this declaration.
- SSet.Subcomplex.PairingCore.rankFunctionEquivstatement and proof · cited by 2
- SSet.Subcomplex.PairingCore.RankFunction.mk.injstatement · cited by 1
- SSet.Subcomplex.PairingCore.RankFunction.mk.noConfusionstatement · cited by 1
- SSet.Subcomplex.PairingCore.RankFunction.rankstatement and proof · cited by 1
- SSet.Subcomplex.PairingCore.RankFunction.mk.congr_simpstatement · cited by 0
- SSet.Subcomplex.PairingCore.RankFunction.mk.injEqstatement · cited by 0
- SSet.Subcomplex.PairingCore.RankFunction.mk.sizeOf_specstatement · cited by 0
- SSet.Subcomplex.PairingCore.RankFunction.casesOnstatement and proof · cited by 0
- SSet.Subcomplex.PairingCore.RankFunction.ctorIdxstatement and proof · cited by 0
- SSet.Subcomplex.PairingCore.RankFunction.isRegularstatement and proof · cited by 0
- SSet.Subcomplex.PairingCore.RankFunction.ltstatement and proof · cited by 0
- SSet.Subcomplex.PairingCore.RankFunction.noConfusionstatement and proof · cited by 0