Theorems · Theorem · number theory
ThreeAPFree.le_addRothNumber
∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : AddMonoid α] {s t : Finset α},
ThreeAPFree ↑s → s ⊆ t → s.card ≤ addRothNumber t- Cited by
- 7 results in Mathlib
- Foundations
- Depth 73 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqAddMonoid
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
- AddMonoidstatement and proof · cited by 2,864
- Finset.cardstatement · cited by 2,327
- OrderHomstatement · cited by 934
- Finset.card_le_cardproof · cited by 118
- ThreeAPFreestatement and proof · cited by 38
- addRothNumberstatement · cited by 20
- Nat.le_findGreatestproof · cited by 6
Cited by7
Results whose statement or proof uses this declaration.
- addRothNumber_map_add_leftproof · cited by 3
- IsAddFreimanHom.addRothNumber_monoproof · cited by 2
- ThreeAPFree.le_rothNumberNatproof · cited by 1
- ThreeAPFree.addRothNumber_eqproof · cited by 1
- IsAddFreimanIso.addRothNumber_congrproof · cited by 1
- addRothNumber_union_leproof · cited by 1
- le_addRothNumber_productproof · cited by 0