Theorems · Theorem · order theory
Finset.expect_lt_expect
∀ {ι : Type u_1} {α : Type u_2} [inst : AddCommMonoid α] [inst_1 : PartialOrder α] [IsOrderedCancelAddMonoid α]
[inst_3 : Module ℚ≥0 α] [PosSMulStrictMono ℚ≥0 α] {s : Finset ι} {f g : ι → α},
(∀ i ∈ s, f i ≤ g i) → (∃ i ∈ s, f i < g i) → (s.expect fun i => f i) < s.expect fun i => g i- Cited by
- 4 results in Mathlib
- Foundations
- Depth 93 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
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.Nonemptyproof · cited by 1,001
- NNRatstatement and proof · cited by 523
- IsOrderedCancelAddMonoidstatement and proof · cited by 359
- PosSMulStrictMonostatement and proof · cited by 128
- Finset.expectstatement · cited by 116
- smul_lt_smul_of_pos_leftproof · cited by 23
- Finset.sum_lt_sumproof · cited by 11
Cited by4
Results whose statement or proof uses this declaration.
- Finset.exists_le_of_expect_le_expectproof · cited by 2
- Finset.expect_pos'proof · cited by 0
- Finset.lt_expectproof · cited by 0
- Finset.expect_ltproof · cited by 0