Theorems · Definition · algebraic topology
SSet.Subcomplex.PairingCore.RankFunction.noConfusion
{P : Sort u_2} →
{X : SSet} →
{A : X.Subcomplex} →
{h : A.PairingCore} →
{α : Type v} →
{inst : PartialOrder α} →
{t : h.RankFunction α} →
{X' : SSet} →
{A' : X'.Subcomplex} →
{h' : A'.PairingCore} →
{α' : Type v} →
{inst' : PartialOrder α'} →
{t' : h'.RankFunction α'} →
X = X' →
A ≍ A' →
h ≍ h' →
α = α' →
inst ≍ inst' →
t ≍ t' → SSet.Subcomplex.PairingCore.RankFunction.noConfusionType P t t'- Cited by
- 0 results in Mathlib
- Foundations
- Depth 97 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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.noConfusionTypestatement · cited by 0
- SSet.Subcomplex.PairingCore.RankFunction.casesOnproof · cited by 0
Cited by1
Results whose statement or proof uses this declaration.
- SSet.Subcomplex.PairingCore.RankFunction.mk.noConfusionproof · cited by 1