Theorems · Theorem · order theory

Finset.lt_expect

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

Defined in

Mathlib.Algebra.Order.BigOperators.Expect

Cited by

0 results in Mathlib

Foundations

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

Assumes

AddCommMonoidPartialOrderIsOrderedCancelAddMonoidModulePosSMulStrictMono