Theorems · Theorem · algebraic topology
SSet.Subcomplex.PairingCore.WeakRankFunction.mk.inj
∀ {X : SSet} {A : X.Subcomplex} {h : A.PairingCore} {α : Type v} {inst : PartialOrder α} {rank : h.ι → α}
{lt : ∀ {x y : h.ι}, h.AncestralRel x y → h.dim x = h.dim y → rank x < rank y} {rank_1 : h.ι → α}
{lt_1 : ∀ {x y : h.ι}, h.AncestralRel x y → h.dim x = h.dim y → rank_1 x < rank_1 y},
{ rank := rank, lt := lt } = { rank := rank_1, lt := lt_1 } → rank = rank_1- Cited by
- 1 results in Mathlib
- Foundations
- Depth 99 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.ιstatement and proof · cited by 42
- SSet.Subcomplex.PairingCore.dimstatement and proof · cited by 22
- SSet.Subcomplex.PairingCore.AncestralRelstatement and proof · cited by 13
- SSet.Subcomplex.PairingCore.WeakRankFunctionstatement · cited by 7
- SSet.Subcomplex.PairingCore.WeakRankFunction.mk.noConfusionproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- SSet.Subcomplex.PairingCore.WeakRankFunction.mk.injEqproof · cited by 0