Theorems · Theorem · order theory
List.maximum_eq_bot
∀ {α : Type u_1} [inst : Preorder α] [inst_1 : DecidableLT α] {l : List α}, l.maximum = ⊥ ↔ l = []- Defined in
- Mathlib.Data.List.MinMax
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 21 from the axioms · uses propext, 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
- Bot.botstatement · cited by 4,720
- WithBotstatement · cited by 1,498
- List.maximumstatement · cited by 25
- List.argmax_eq_noneproof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- Nat.Subtype.ofNat_surjectiveproof · cited by 1
- List.getD_max?_eq_unbotD_maximumproof · cited by 0