Theorems · Definition · algebraic topology
SSet.Subcomplex.PairingCore.RankFunction.noConfusionType
Sort u_2 →
{X : SSet} →
{A : X.Subcomplex} →
{h : A.PairingCore} →
{α : Type v} →
[inst : PartialOrder α] →
h.RankFunction α →
{X' : SSet} →
{A' : X'.Subcomplex} →
{h' : A'.PairingCore} → {α' : Type v} → [inst' : PartialOrder α'] → h'.RankFunction α' → Sort u_2- Cited by
- 0 results in Mathlib
- Foundations
- Depth 96 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PartialOrderPartialOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- PartialOrderstatement and proof · cited by 6,410
- SSetstatement and proof · cited by 1,283
- SSet.Subcomplexstatement and proof · cited by 461
- SSet.Subcomplex.PairingCorestatement and proof · cited by 50
- SSet.Subcomplex.PairingCore.ιproof · cited by 42
- SSet.Subcomplex.PairingCore.AncestralRelproof · cited by 13
- SSet.Subcomplex.PairingCore.RankFunctionstatement and proof · cited by 7
- SSet.Subcomplex.PairingCore.RankFunction.casesOnproof · cited by 0
Cited by1
Results whose statement or proof uses this declaration.
- SSet.Subcomplex.PairingCore.RankFunction.noConfusionstatement · cited by 0