Theorems · Theorem · order theory
List.foldr_max_of_ne_nil
∀ {α : Type u_1} [inst : LinearOrder α] [inst_1 : OrderBot α] {l : List α}, l ≠ [] → ↑(List.foldr max ⊥ l) = l.maximum- Defined in
- Mathlib.Data.List.MinMax
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 28 from the axioms · uses propext, Quot.sound
- Assumes
- LinearOrderOrderBot
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LinearOrderstatement and proof · cited by 8,572
- Bot.botstatement and proof · cited by 4,720
- WithBotstatement and proof · cited by 1,498
- OrderBotstatement and proof · cited by 1,055
- WithBot.somestatement and proof · cited by 541
- sup_of_le_leftproof · cited by 218
- List.maximumstatement and proof · cited by 25
- List.maximum_consproof · cited by 6
- WithBot.coe_maxproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.