Theorems · Theorem · order theory

Finset.expect_le

∀ {ι : Type u_1} {α : Type u_2} [inst : AddCommMonoid α] [inst_1 : PartialOrder α] [IsOrderedAddMonoid α]
  [inst_3 : Module ℚ≥0 α] {s : Finset ι} {f : ι → α} [PosSMulMono ℚ≥0 α] {a : α},
  s.Nonempty → (∀ x ∈ s, f x ≤ a) → (s.expect fun i => f i) ≤ a

Defined in

Mathlib.Algebra.Order.BigOperators.Expect

Cited by

1 results in Mathlib

Foundations

Depth 91 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

AddCommMonoidPartialOrderIsOrderedAddMonoidModulePosSMulMono