Theorems · Theorem · number theory
addRothNumber_union_le
∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : AddMonoid α] (s t : Finset α),
addRothNumber (s ∪ t) ≤ addRothNumber s + addRothNumber t- Cited by
- 1 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.
Cites17
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.coeproof · cited by 8,199
- AddMonoidstatement and proof · cited by 2,864
- Finset.cardproof · cited by 2,327
- OrderHomstatement · cited by 934
- add_le_addproof · cited by 666
- ThreeAPFreeproof · cited by 38
- Finset.inter_subset_leftproof · cited by 23
- Finset.inter_subset_rightproof · cited by 21
- addRothNumberstatement and proof · cited by 20
- Finset.card_union_leproof · cited by 18
Cited by1
Results whose statement or proof uses this declaration.
- rothNumberNat_add_leproof · cited by 0