Theorems · Definition · order theory
Set.EquitableOn
{α : Type u_1} → {β : Type u_2} → [LE β] → [Add β] → [One β] → Set α → (α → β) → PropA set is equitable if no element value is more than one bigger than another.
- Defined in
- Mathlib.Data.Set.Equitable
- Cited by
- 12 results in Mathlib
- Foundations
- Depth 4 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
Cited by13
Results whose statement or proof uses this declaration.
- Finpartition.IsEquipartitionproof · cited by 45
- Set.equitableOn_iff_exists_le_le_add_onestatement and proof · cited by 2
- Finset.equitableOn_iff_le_le_add_onestatement · cited by 2
- Set.Subsingleton.equitableOnstatement · cited by 2
- Set.equitableOn_iff_exists_eq_eq_add_onestatement · cited by 2
- Set.equitableOn_singletonstatement · cited by 1
- Finset.EquitableOn.lestatement and proof · cited by 1
- Finset.EquitableOn.le_add_onestatement and proof · cited by 1
- Set.not_equitableOnstatement · cited by 1
- Finset.equitableOn_iffstatement · cited by 0
- Finpartition.indiscrete_isEquipartitionproof · cited by 0
- Set.equitableOn_emptystatement · cited by 0