Theorems · Theorem · order theory

StrictMono.add_const

∀ {α : Type u_1} {β : Type u_2} [inst : Add α] [inst_1 : Preorder α] [inst_2 : Preorder β] {f : β → α}
  [AddRightStrictMono α], StrictMono f → ∀ (c : α), StrictMono fun x => f x + c

Defined in

Mathlib.Algebra.Order.Monoid.Unbundled.Basic

Cited by

6 results in Mathlib

Foundations

Depth 6 from the axioms · uses no axioms

Assumes

AddPreorderPreorderAddRightStrictMono