Theorems · Definition · algebraic topology
SSet.Subcomplex.Pairing.WeakRankFunction.mk.noConfusion
{X : SSet} →
{A : X.Subcomplex} →
{P : A.Pairing} →
{α : Type v} →
{inst : PartialOrder α} →
{P_1 : Sort u_1} →
{rank : ↑P.II → α} →
{lt : ∀ {x y : ↑P.II}, P.AncestralRel x y → (↑x).dim = (↑y).dim → rank x < rank y} →
{rank' : ↑P.II → α} →
{lt' : ∀ {x y : ↑P.II}, P.AncestralRel x y → (↑x).dim = (↑y).dim → rank' x < rank' y} →
{ rank := rank, lt := lt } = { rank := rank', lt := lt' } → (rank ≍ rank' → P_1) → P_1- Cited by
- 1 results in Mathlib
- Foundations
- Depth 98 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Set.Elemstatement and proof · 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.toSstatement and proof · cited by 171
- SSet.S.dimstatement and proof · cited by 162
- SSet.Subcomplex.Nstatement · cited by 155
- SSet.Subcomplex.N.toNstatement and proof · cited by 126
- SSet.Subcomplex.Pairingstatement and proof · cited by 117
- SSet.Subcomplex.Pairing.IIstatement and proof · cited by 58
- SSet.Subcomplex.Pairing.AncestralRelstatement and proof · cited by 22
Cited by1
Results whose statement or proof uses this declaration.
- SSet.Subcomplex.Pairing.WeakRankFunction.mk.injproof · cited by 1