Theorems · Theorem · number theory
ThreeGPFree.le_mulRothNumber
∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : Monoid α] {s t : Finset α},
ThreeGPFree ↑s → s ⊆ t → s.card ≤ mulRothNumber t- Cited by
- 6 results in Mathlib
- Foundations
- Depth 73 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Finsetstatement and proof · cited by 13,712
- SetLike.coestatement and proof · cited by 8,199
- Monoidstatement and proof · cited by 3,887
- Finset.cardstatement · cited by 2,327
- OrderHomstatement · cited by 934
- Finset.card_le_cardproof · cited by 118
- ThreeGPFreestatement and proof · cited by 29
- mulRothNumberstatement · cited by 13
- Nat.le_findGreatestproof · cited by 6
Cited by6
Results whose statement or proof uses this declaration.
- mulRothNumber_map_mul_leftproof · cited by 1
- IsMulFreimanHom.mulRothNumber_monoproof · cited by 1
- ThreeGPFree.mulRothNumber_eqproof · cited by 1
- mulRothNumber_union_leproof · cited by 0
- IsMulFreimanIso.mulRothNumber_congrproof · cited by 0
- le_mulRothNumber_productproof · cited by 0