Theorems · Definition · algebraic topology
SSet.Subcomplex.PairingCore.WeakRankFunction.recOn
{X : SSet} →
{A : X.Subcomplex} →
{h : A.PairingCore} →
{α : Type v} →
[inst : PartialOrder α] →
{motive : h.WeakRankFunction α → Sort u_2} →
(t : h.WeakRankFunction α) →
((rank : h.ι → α) →
(lt : ∀ {x y : h.ι}, h.AncestralRel x y → h.dim x = h.dim y → rank x < rank y) →
motive { rank := rank, lt := lt }) →
motive t- Cited by
- 0 results in Mathlib
- Foundations
- Depth 95 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PartialOrder
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.ι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 and proof · cited by 7
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.