Theorems · Theorem · order theory
List.monotone_sum_take
∀ {M : Type u_3} [inst : AddMonoid M] [inst_1 : Preorder M] [CanonicallyOrderedAdd M] (L : List M),
Monotone fun i => (List.take i L).sum- Cited by
- 3 results in Mathlib
- Foundations
- Depth 25 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.
- Preorderstatement and proof · cited by 7,952
- AddMonoidstatement and proof · cited by 2,864
- Monotonestatement · cited by 1,397
- le_transproof · cited by 985
- CanonicallyOrderedAddstatement and proof · cited by 229
- lt_or_geproof · cited by 182
- le_self_addproof · cited by 68
- monotone_nat_of_le_succproof · cited by 45
- List.sum_take_succproof · cited by 6
Cited by3
Results whose statement or proof uses this declaration.
- Composition.disjoint_rangeproof · cited by 1
- Composition.sizeUpTo_sizeUpTo_addproof · cited by 1
- Composition.monotone_sizeUpToproof · cited by 0