Theorems · Theorem · order theory
List.minimum_mem
∀ {α : Type u_1} [inst : Preorder α] [inst_1 : DecidableLT α] {l : List α} {m : α}, l.minimum = ↑m → m ∈ l- Defined in
- Mathlib.Data.List.MinMax
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 20 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PreorderDecidableLT
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
- WithTopstatement · cited by 3,754
- WithTop.somestatement · cited by 1,128
- List.minimumstatement · cited by 24
- List.argmin_memproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- List.minimum_of_length_pos_memproof · cited by 0