Theorems · Theorem · order theory
List.foldr_min_of_ne_nil
∀ {α : Type u_1} [inst : LinearOrder α] [inst_1 : OrderTop α] {l : List α}, l ≠ [] → ↑(List.foldr min ⊤ l) = l.minimum- Defined in
- Mathlib.Data.List.MinMax
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 26 from the axioms · uses propext, Quot.sound
- Assumes
- LinearOrderOrderTop
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topstatement and proof · cited by 9,680
- LinearOrderstatement and proof · cited by 8,572
- WithTopstatement and proof · cited by 3,754
- WithTop.somestatement and proof · cited by 1,128
- OrderTopstatement and proof · cited by 493
- le_topproof · cited by 411
- inf_of_le_leftproof · cited by 186
- WithTop.coe_le_coeproof · cited by 65
- List.minimumstatement and proof · cited by 24
- List.minimum_consproof · cited by 7
- WithTop.coe_minproof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.