Theorems · Theorem · order theory
Finset.prod_le_prod_of_subset_of_one_le
∀ {ι : Type u_1} {R : Type u_2} [inst : CommMonoidWithZero R] [inst_1 : Preorder R] [ZeroLEOneClass R] [PosMulMono R]
{f : ι → R} {s t : Finset ι}, s ⊆ t → (∀ i ∈ s, 0 ≤ f i) → (∀ i ∈ t, i ∉ s → 1 ≤ f i) → ∏ i ∈ s, f i ≤ ∏ i ∈ t, f i- Cited by
- 2 results in Mathlib
- Foundations
- Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Preorderstatement and proof · cited by 7,952
- Finset.prodstatement and proof · cited by 2,356
- CommMonoidWithZerostatement and proof · cited by 913
- ZeroLEOneClassstatement and proof · cited by 304
- PosMulMonostatement and proof · cited by 165
- MulPosMonoproof · cited by 128
- Finset.prod_nonnegproof · cited by 39
- Finset.prod_unionproof · cited by 31
- Finset.sdiff_disjointproof · cited by 20
- le_mul_of_one_le_leftproof · cited by 19
- Finset.sdiff_union_of_subsetproof · cited by 12
Cited by2
Results whose statement or proof uses this declaration.
- discrete_gronwallproof · cited by 1
- Finset.prod_mono_set_of_one_leproof · cited by 0