Mapping_from_Totally_Ordered_Set_is_Order_Embedding_iff_Strictly_Increasing
Provedorder-embeddingsproofwikitotal-orderings
Let (S, ≤₁) be a totally ordered set and (T, ≤₂) be an ordered set. A mapping φ: S → T is an order embedding if and only if φ is strictly increasing.
Preamble
import Mathlib.Order.Monotone.Basic
Formal statement
theorem Mapping_from_Totally_Ordered_Set_is_Order_Embedding_iff_Strictly_Increasing {α : Type _} {β : Type _} [LinearOrder α] [Preorder β] (f : α → β) : StrictMono f ↔ (∀ a b : α, a < b → f a < f b) := by sorrySource