Theorems · Theorem · order theory
strictMono_of_le_iff_le
∀ {α : Type u} {β : Type v} [inst : Preorder α] [inst_1 : Preorder β] {f : α → β},
(∀ (x y : α), x ≤ y ↔ f x ≤ f y) → StrictMono f- Defined in
- Mathlib.Order.Monotone.Defs
- Cited by
- 14 results in Mathlib
- Foundations
- Depth 5 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement and proof · cited by 7,952
- StrictMonostatement · cited by 706
- lt_iff_lt_of_le_iff_le'proof · cited by 26
Cited by14
Results whose statement or proof uses this declaration.
- GaloisCoinsertion.strictMono_lproof · cited by 10
- GaloisInsertion.strictMono_uproof · cited by 6
- OrderMonoidIso.strictMonoproof · cited by 3
- Ideal.exist_integer_multiples_notMemproof · cited by 1
- IsLocalization.coeSubmodule_strictMonoproof · cited by 1
- ZFSet.vonNeumann_strictMonoproof · cited by 1
- Multiset.powerset_strictMonoproof · cited by 1
- Int.cast_strictMonoproof · cited by 1
- MvPolynomial.supported_strictMonoproof · cited by 0
- OrderAddMonoidIso.strictMonoproof · cited by 0
- OrderAddMonoidIso.strictMono_symmproof · cited by 0
- AffineSubspace.mk'_strictMonoproof · cited by 0