Theorems · Theorem · order theory
List.SortedLT.nodup
∀ {α : Type u_1} {l : List α} [inst : Preorder α], l.SortedLT → l.Nodup- Defined in
- Mathlib.Data.List.Sort
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 54 from the axioms · uses propext, Quot.sound
- Assumes
- Preorder
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.
- Preorderstatement and proof · cited by 7,952
- StrictMono.injectiveproof · cited by 94
- List.SortedLTstatement and proof · cited by 66
- List.SortedLT.strictMono_getproof · cited by 5
- Function.Injective.nodupproof · cited by 2
Cited by5
Results whose statement or proof uses this declaration.
- Finset.toFinset_bitIndices_sum_two_powproof · cited by 1
- Finset.sum_toFinset_bitIndices_two_powproof · cited by 1
- CompositionSeries.toList_nodupproof · cited by 1
- List.SortedLT.sbtwproof · cited by 1
- List.sortedLT_iff_nodup_and_sortedLEproof · cited by 0