Theorems · Definition · algebraic topology
SSet.Subcomplex.PairingCore.rankFunctionEquiv
{X : SSet} →
{A : X.Subcomplex} →
(h : A.PairingCore) → (α : Type v) → [inst : PartialOrder α] → h.RankFunction α ≃ h.pairing.RankFunction αRank functions for h : A.PairingCore correspond to
rank functions for h.pairing : A.Pairing.
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 96 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.
Cites18
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Equivstatement · cited by 8,337
- Set.Elemproof · cited by 7,166
- PartialOrderstatement and proof · cited by 6,410
- Equiv.symmproof · cited by 3,681
- SSetstatement and proof · cited by 1,283
- SSet.Subcomplexstatement and proof · cited by 461
- SSet.Subcomplex.Pairing.RankFunctionstatement and proof · cited by 68
- SSet.Subcomplex.Pairing.IIproof · cited by 58
- SSet.Subcomplex.PairingCorestatement and proof · cited by 50
- SSet.Subcomplex.PairingCore.ιproof · cited by 42
- SSet.Subcomplex.Pairing.AncestralRelproof · cited by 22
Cited by2
Results whose statement or proof uses this declaration.
- SSet.Subcomplex.PairingCore.RankFunction.isRegularproof · cited by 0
- SSet.Subcomplex.PairingCore.isRegular_iff_nonempty_rankFunctionproof · cited by 0