Mathlib Map

Theorems · Theorem · number theory

ThreeAPFree.addRothNumber_eq

∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : AddMonoid α] {s : Finset α}, ThreeAPFree ↑s → addRothNumber s = s.card
Defined in
Mathlib.Combinatorics.Additive.AP.Three.Defs
Cited by
1 results in Mathlib
Foundations
Depth 74 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_singleton · cited by 0addRothNumber_singletonDFunLike.coe · cited by 62936DFunLike.coeFinset · cited by 13712FinsetSetLike.coe · cited by 8199SetLike.coeAddMonoid · cited by 2864AddMonoidFinset.card · cited by 2327Finset.cardOrderHom · cited by 934OrderHomLE.le.antisymm · cited by 507le.antisymmThreeAPFree · cited by 38ThreeAPFreeFinset.Subset.refl · cited by 29Subset.refladdRothNumber · cited by 20addRothNumberThreeAPFree.le_addRothNumber · cited by 7ThreeAPFree.le_addRothNum…addRothNumber_le · cited by 3addRothNumber_leThreeAPFree.addRothNumber_eqCITED BYCITES

Cites12

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

Cited by1

Results whose statement or proof uses this declaration.