Theorems · Theorem · combinatorics
Finset.pluennecke_petridis_inequality_add
∀ {G : Type u_1} [inst : DecidableEq G] [inst_1 : AddGroup G] {A B : Finset G} (C : Finset G),
(∀ A' ⊆ A, (A + B).card * A'.card ≤ (A' + B).card * A.card) → (C + A + B).card * A.card ≤ (A + B).card * (C + A).card- Cited by
- 1 results in Mathlib
- Foundations
- Depth 87 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqAddGroup
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites35
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
- AddGroupstatement and proof · cited by 4,410
- Finset.cardstatement and proof · cited by 2,327
- MulZeroClass.mul_zeroproof · cited by 2,091
- le_reflproof · cited by 2,061
- MulZeroClass.zero_mulproof · cited by 1,625
- add_commproof · cited by 1,535
- add_assocproof · cited by 746
- add_le_addproof · cited by 666
- mul_addproof · cited by 413
- add_mulproof · cited by 363
- LE.le.trans_eqproof · cited by 328
Cited by1
Results whose statement or proof uses this declaration.
- Finset.ruzsa_triangle_inequality_add_add_addproof · cited by 2