Theorems · Definition · algebraic topology
SSet.Subcomplex.Pairing.WeakRankFunction.noConfusionType
Sort u_1 →
{X : SSet} →
{A : X.Subcomplex} →
{P : A.Pairing} →
{α : Type v} →
[inst : PartialOrder α] →
P.WeakRankFunction α →
{X' : SSet} →
{A' : X'.Subcomplex} →
{P' : A'.Pairing} → {α' : Type v} → [inst' : PartialOrder α'] → P'.WeakRankFunction α' → Sort u_1- 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.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Set.Elemproof · 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.toSproof · cited by 171
- SSet.S.dimproof · cited by 162
- SSet.Subcomplex.N.toNproof · cited by 126
- SSet.Subcomplex.Pairingstatement and proof · cited by 117
- SSet.Subcomplex.Pairing.IIproof · cited by 58
- SSet.Subcomplex.Pairing.AncestralRelproof · cited by 22
- SSet.Subcomplex.Pairing.WeakRankFunctionstatement and proof · cited by 8
- SSet.Subcomplex.Pairing.WeakRankFunction.casesOnproof · cited by 0
Cited by1
Results whose statement or proof uses this declaration.
- SSet.Subcomplex.Pairing.WeakRankFunction.noConfusionstatement · cited by 0