Mathlib Map

Theorems · Theorem · number theory

addRothNumber_spec

∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : AddMonoid α] (s : Finset α),
  ∃ t ⊆ s, t.card = addRothNumber s ∧ ThreeAPFree ↑t
Defined in
Mathlib.Combinatorics.Additive.AP.Three.Defs
Cited by
8 results in Mathlib
Foundations
Depth 73 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidableEqAddMonoid
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

addRothNumber_map_add_left · cited by 3addRothNumber_map_add_leftIsAddFreimanHom.addRothNumber_mono · cited by 2IsAddFreimanHom.addRothNu…rothNumberNat_spec · cited by 1rothNumberNat_specaddRothNumber_le_ruzsaSzemerediNumber · cited by 1addRothNumber_le_ruzsaSze…IsAddFreimanIso.addRothNumber_congr · cited by 1IsAddFreimanIso.addRothNu…addRothNumber_union_le · cited by 1addRothNumber_union_lele_addRothNumber_product · cited by 0le_addRothNumber_productaddRothNumber_lt_of_forall_not_threeAPFree · cited by 0addRothNumber_lt_of_foral…DFunLike.coe · cited by 62936DFunLike.coeFinset · cited by 13712FinsetSetLike.coe · cited by 8199SetLike.coeAddMonoid · cited by 2864AddMonoidFinset.card · cited by 2327Finset.cardOrderHom · cited by 934OrderHomFinset.coe_empty · cited by 109Finset.coe_emptyThreeAPFree · cited by 38ThreeAPFreeFinset.card_empty · cited by 20Finset.card_emptyaddRothNumber · cited by 20addRothNumberFinset.empty_subset · cited by 12Finset.empty_subsetNat.findGreatest_spec · cited by 9Nat.findGreatest_specthreeAPFree_empty · cited by 1threeAPFree_emptyaddRothNumber_specCITED BYCITES

Cites13

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by8

Results whose statement or proof uses this declaration.