Theorems · Theorem · order theory
RelEmbedding.isPartialOrder
∀ {α : Type u_1} {β : Type u_2} {r : α → α → Prop} {s : β → β → Prop} (x : r ↪r s) [IsPartialOrder β s],
IsPartialOrder α r- Defined in
- Mathlib.Order.RelIso.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses no axioms
- Assumes
- IsPartialOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- RelEmbeddingstatement and proof · cited by 281
- IsPreorderproof · cited by 20
- IsPartialOrderstatement and proof · cited by 6
- RelEmbedding.antisymmproof · cited by 2
- RelEmbedding.isPreorderproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- RelEmbedding.isLinearOrderproof · cited by 0