Theorems · Theorem · combinatorics
Finset.subsetSum_mono
∀ {M : Type u_1} [inst : DecidableEq M] [inst_1 : AddCommMonoid M] {A B : Finset M}, A ⊆ B → A.subsetSum ⊆ B.subsetSum- Defined in
- Mathlib.Combinatorics.Additive.SubsetSum
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 77 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqAddCommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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
- Finset.sumproof · cited by 5,195
- Finset.powersetproof · cited by 93
- Finset.subsetSumstatement · cited by 11
- Finset.image_monoproof · cited by 4
- Finset.powerset_monoproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- Finset.subsetSum_erase_zeroproof · cited by 1
- Finset.card_add_card_subsetSum_lt_card_subsetSum_insert_maxproof · cited by 1