Mathlib Map

Theorems · Theorem · order theory

Finset.sum_lt_sum_of_nonempty

∀ {ι : Type u_1} {M : Type u_4} [inst : AddCommMonoid M] [inst_1 : Preorder M] [IsOrderedCancelAddMonoid M]
  {f g : ι → M} {s : Finset ι} [AddLeftStrictMono M], s.Nonempty → (∀ i ∈ s, f i < g i) → ∑ i ∈ s, f i < ∑ i ∈ s, g i

In an ordered additive commutative monoid, if each summand f i of one nontrivial finite sum is strictly less than the corresponding summand g i of another nontrivial finite sum, then s.sum f < s.sum g.

Defined in
Mathlib.Algebra.Order.BigOperators.Group.Finset
Cited by
10 results in Mathlib
Foundations
Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
AddCommMonoidPreorderIsOrderedCancelAddMonoidAddLeftStrictMono

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites10

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by10

Results whose statement or proof uses this declaration.