Theorems · Theorem · order theory
OrderEmbedding.eq_iff_eq
∀ {α : Type u_2} {β : Type u_3} [inst : Preorder α] [inst_1 : Preorder β] (f : α ↪o β) {a b : α}, f a = f b ↔ a = b- Defined in
- Mathlib.Order.Hom.Basic
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Preorderstatement and proof · cited by 7,952
- OrderEmbeddingstatement and proof · cited by 619
- RelEmbedding.injectiveproof · cited by 41
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.edgeSet_injproof · cited by 1
- ENat.toENNReal_injproof · cited by 1
- Finset.orderEmbOfFin_eq_orderEmbOfFin_iffproof · cited by 0
- ContinuousMap.realToRCLike_injproof · cited by 0