Theorems · Theorem · order theory

StrictMono.mul_const

∀ {α : Type u_1} {M₀ : Type u_2} [inst : MonoidWithZero M₀] [inst_1 : PartialOrder M₀] {a : M₀} [inst_2 : Preorder α]
  {f : α → M₀} [MulPosStrictMono M₀], StrictMono f → 0 < a → StrictMono fun x => f x * a

Defined in

Mathlib.Algebra.Order.GroupWithZero.Basic

Cited by

2 results in Mathlib

Foundations

Depth 7 from the axioms · uses no axioms

Assumes

MonoidWithZeroPartialOrderPreorderMulPosStrictMono