Theorems · Theorem · order theory
StrictMonoOn.const_add
∀ {α : Type u_1} {β : Type u_2} [inst : Add α] [inst_1 : Preorder α] [inst_2 : Preorder β] {f : β → α} {s : Set β}
[AddLeftStrictMono α], StrictMonoOn f s → ∀ (c : α), StrictMonoOn (fun x => c + f x) s- Cited by
- 1 results in Mathlib
- Foundations
- Depth 6 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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
- Preorderstatement and proof · cited by 7,952
- AddLeftStrictMonostatement and proof · cited by 203
- StrictMonoOnstatement and proof · cited by 194
- add_lt_add_rightproof · cited by 50
Cited by1
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.strictMonoOn_one_sub_smoothingFnproof · cited by 0