Theorems · Theorem · order theory
Finset.expect_eq_zero_iff_of_nonpos
∀ {ι : Type u_1} {α : Type u_2} [inst : AddCommMonoid α] [inst_1 : PartialOrder α] [IsOrderedAddMonoid α]
[inst_3 : Module ℚ≥0 α] {s : Finset ι} {f : ι → α},
(∀ i ∈ s, f i ≤ 0) → ((s.expect fun i => f i) = 0 ↔ ∀ i ∈ s, f i = 0)- Cited by
- 1 results in Mathlib
- Foundations
- Depth 91 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Modulestatement and proof · cited by 20,661
- Finsetstatement and proof · cited by 13,712
- AddCommMonoidstatement and proof · cited by 12,281
- PartialOrderstatement and proof · cited by 6,410
- Finset.cardproof · cited by 2,327
- Finset.sum_congrproof · cited by 2,323
- IsOrderedAddMonoidstatement and proof · cited by 1,659
- NNRatstatement and proof · cited by 523
- Finset.expectstatement · cited by 116
- Finset.sum_eq_zero_iff_of_nonposproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Fintype.expect_eq_zero_iff_of_nonposproof · cited by 0