Mathlib Map

Theorems · Theorem · number theory

addRothNumber_le

∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : AddMonoid α] (s : Finset α), addRothNumber s ≤ s.card
Defined in
Mathlib.Combinatorics.Additive.AP.Three.Defs
Cited by
3 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.

ThreeAPFree.addRothNumber_eq · cited by 1ThreeAPFree.addRothNumber…addRothNumber_empty · cited by 1addRothNumber_emptyrothNumberNat_le · cited by 0rothNumberNat_leDFunLike.coe · cited by 62936DFunLike.coeFinset · cited by 13712FinsetAddMonoid · cited by 2864AddMonoidFinset.card · cited by 2327Finset.cardOrderHom · cited by 934OrderHomaddRothNumber · cited by 20addRothNumberNat.findGreatest_le · cited by 7Nat.findGreatest_leaddRothNumber_leCITED BYCITES

Cites7

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

Cited by3

Results whose statement or proof uses this declaration.