Theorems · Theorem · number theory
addRothNumber_lt_of_forall_not_threeAPFree
∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : AddMonoid α] {s : Finset α} {n : ℕ},
(∀ t ∈ Finset.powersetCard n s, ¬ThreeAPFree ↑t) → addRothNumber s < n- Cited by
- 0 results in Mathlib
- Foundations
- Depth 74 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.
Cites15
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Finsetstatement and proof · cited by 13,712
- SetLike.coestatement and proof · cited by 8,199
- LE.le.transproof · cited by 3,151
- AddMonoidstatement and proof · cited by 2,864
- Finset.cardproof · cited by 2,327
- OrderHomstatement · cited by 934
- not_leproof · cited by 328
- Finset.powersetCardstatement and proof · cited by 60
- ThreeAPFreestatement and proof · cited by 38
- addRothNumberstatement and proof · cited by 20
- Finset.mem_powersetCardproof · cited by 14
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.