Theorems · Theorem · order theory
List.not_maximum_lt_of_mem
∀ {α : Type u_1} [inst : Preorder α] [inst_1 : DecidableLT α] {l : List α} {a m : α}, a ∈ l → l.maximum = ↑m → ¬m < a- Defined in
- Mathlib.Data.List.MinMax
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 21 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
- WithBotstatement · cited by 1,498
- WithBot.somestatement · cited by 541
- List.maximumstatement · cited by 25
- List.not_lt_of_mem_argmaxproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- List.not_maximum_lt_of_mem'proof · cited by 1