Theorems · Theorem · order theory

Monotone.pairwise_disjoint_on_Ico_pred

∀ {α : Type u_1} {β : Type u_2} [inst : LinearOrder α] [inst_1 : PredOrder α] [inst_2 : Preorder β] {f : α → β},
  Monotone f → Pairwise (Function.onFun Disjoint fun n => Set.Ico (f (Order.pred n)) (f n))

If α is a linear pred order, β is a preorder, and f : α → β is a monotone function, then the intervals Set.Ico (f Order.pred n) (f n) are pairwise disjoint.

Defined in

Mathlib.Order.SuccPred.IntervalSucc

Cited by

1 results in Mathlib

Foundations

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

Assumes

LinearOrderPredOrderPreorder