Theorems · Theorem · order theory
Order.IsNormal.strictMono
∀ {α : Type u_1} {β : Type u_2} [inst : LinearOrder α] [inst_1 : LinearOrder β] {f : α → β},
Order.IsNormal f → StrictMono f- Defined in
- Mathlib.Order.IsNormal
- Cited by
- 44 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext
- Assumes
- LinearOrderLinearOrder
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.
- LinearOrderstatement and proof · cited by 8,572
- StrictMonostatement · cited by 706
- Order.IsNormalstatement and proof · cited by 118
Cited by44
Results whose statement or proof uses this declaration.
- Order.IsNormal.monotoneproof · cited by 11
- Ordinal.veblenWith_right_strictMonoproof · cited by 9
- Ordinal.opow_lt_opow_iff_rightproof · cited by 8
- Ordinal.cof_map_of_isNormalproof · cited by 7
- Order.IsNormal.compproof · cited by 5
- Order.IsNormal.map_isSuccLimitproof · cited by 4
- Ordinal.right_le_opowproof · cited by 4
- Ordinal.nfpFamily_fpproof · cited by 4
- Order.IsNormal.isLUB_image_Iio_of_isSuccLimitproof · cited by 3
- Ordinal.isPrincipal_add_iff_add_left_eq_selfproof · cited by 3
- Order.IsNormal.map_isLUBproof · cited by 3
- Ordinal.isPrincipal_mul_iff_mul_left_eqproof · cited by 3