Theorems · Definition · real analysis
OrderedFinpartition.extendLeft
{n : ℕ} → OrderedFinpartition n → OrderedFinpartition (n + 1)Extend an ordered partition of n entries, by adding a new singleton part to the left.
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Set.univproof · cited by 3,945
- Fin.consproof · cited by 190
- OrderedFinpartitionstatement and proof · cited by 61
- OrderedFinpartition.lengthproof · cited by 54
- OrderedFinpartition.partSizeproof · cited by 47
- OrderedFinpartition.embproof · cited by 26
Cited by6
Results whose statement or proof uses this declaration.
- OrderedFinpartition.extendproof · cited by 5
- iteratedDerivWithin_vcomp_threeproof · cited by 2
- OrderedFinpartition.extendLeft_lengthstatement and proof · cited by 0
- OrderedFinpartition.extendLeft_partSizestatement and proof · cited by 0
- OrderedFinpartition.range_extendLeft_zerostatement · cited by 0
- OrderedFinpartition.extend_nonestatement · cited by 0