Theorems · Theorem · order theory
OrderEmbedding.sortedLT_listMap
∀ {α : Type u_1} {β : Type u_2} [inst : Preorder α] [inst_1 : Preorder β] (e : α ↪o β) {l : List α},
(List.map (⇑e) l).SortedLT ↔ l.SortedLT- Defined in
- Mathlib.Data.List.Sort
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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
- List.SortedLTstatement · cited by 66
- OrderEmbedding.ltEmbeddingproof · cited by 9
- RelEmbedding.pairwise_listMapproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- StrictMono.sortedLT_listMapproof · cited by 0
- OrderIso.sortedLT_listMapproof · cited by 0