Theorems · Theorem · combinatorics
Finset.nonneg_of_mem_subsetSum
∀ {M : Type u_1} [inst : DecidableEq M] [inst_1 : AddCommMonoid M] {A : Finset M} [inst_2 : LinearOrder M]
[IsOrderedCancelAddMonoid M], (∀ x ∈ A, 0 ≤ x) → ∀ x ∈ A.subsetSum, 0 ≤ x- Defined in
- Mathlib.Combinatorics.Additive.SubsetSum
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 78 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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
- AddCommMonoidstatement and proof · cited by 12,281
- LinearOrderstatement and proof · cited by 8,572
- IsOrderedCancelAddMonoidstatement and proof · cited by 359
- Finset.sum_nonnegproof · cited by 91
- Finset.subsetSumstatement · cited by 11
Cited by1
Results whose statement or proof uses this declaration.
- Finset.card_add_card_subsetSum_lt_card_subsetSum_insert_maxproof · cited by 1