Theorems · Definition · order theory
OrderEmbedding
(α : Type u_6) → (β : Type u_7) → [LE α] → [LE β] → Type (max u_6 u_7)
An order embedding is an embedding f : α ↪ β such that a ≤ b ↔ (f a) ≤ (f b).
This definition is an abbreviation of RelEmbedding (≤) (≤).
- Defined in
- Mathlib.Order.Hom.Basic
- Cited by
- 619 results in Mathlib
- Foundations
- Depth 2 from the axioms, rests on 4 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- RelEmbeddingproof · cited by 281
Cited by762
Results whose statement or proof uses this declaration.
- Subalgebra.toSubmodulestatement · cited by 141
- Cardinal.alephstatement · cited by 76
- BoxIntegral.Box.Iccstatement · cited by 76
- Ordinal.omegastatement · cited by 60
- Finset.orderEmbOfFinstatement · cited by 47
- OrderEmbedding.le_iff_lestatement and proof · cited by 32
- Ordinal.preOmegastatement · cited by 31
- OrderEmbedding.monotonestatement and proof · cited by 26
- OrderEmbedding.strictMonostatement and proof · cited by 26
- Composition.embeddingstatement · cited by 25
- OrderEmbedding.lt_iff_ltstatement and proof · cited by 23
- OrderIso.toOrderEmbeddingstatement · cited by 22
Showing the 200 most cited of 762.