Theorems · Theorem · order theory
isLeast_csInf
∀ {α : Type u_1} [inst : ConditionallyCompleteLinearOrder α] {s : Set α} [WellFoundedLT α],
s.Nonempty → IsLeast s (sInf s)- Cited by
- 4 results in Mathlib
- Foundations
- Depth 19 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Setstatement and proof · cited by 53,352
- Set.Nonemptystatement and proof · cited by 2,627
- InfSet.sInfstatement · cited by 935
- ConditionallyCompleteLinearOrderstatement and proof · cited by 542
- WellFoundedLTstatement and proof · cited by 491
- IsLeaststatement and proof · cited by 122
- Function.argminOn_memproof · cited by 7
- Function.argminOn_leproof · cited by 5
- sInf_eq_argmin_onproof · cited by 1
Cited by4
Results whose statement or proof uses this declaration.
- csInf_memproof · cited by 19
- Monotone.map_csInfproof · cited by 2
- le_csInf_iff'proof · cited by 0
- MonotoneOn.map_csInfproof · cited by 0