Theorems · Theorem · order theory

Set.not_equitableOn

∀ {α : Type u_1} {β : Type u_2} [inst : LinearOrder β] [inst_1 : Add β] [inst_2 : One β] {s : Set α} {f : α → β},
  ¬s.EquitableOn f ↔ ∃ a ∈ s, ∃ b ∈ s, f b + 1 < f a

Defined in

Mathlib.Data.Set.Equitable

Cited by

1 results in Mathlib

Foundations

Depth 17 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

LinearOrderAddOne