Theorems · Definition · order theory
IsGreatest
{α : Type u_1} → [LE α] → Set α → α → Propa is a greatest element of a set s; for a partial order, it is unique if exists.
- Defined in
- Mathlib.Order.Bounds.Defs
- Cited by
- 112 results in Mathlib
- Foundations
- Depth 5 from the axioms, rests on 12 definitions · uses no axioms
- Assumes
- LE
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
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
- upperBoundsproof · cited by 263
Cited by115
Results whose statement or proof uses this declaration.
- IsGLBproof · cited by 213
- IsGreatest.isLUBstatement and proof · cited by 25
- IsGreatest.csSup_eqstatement and proof · cited by 9
- IsGreatest.norm_cfcstatement and proof · cited by 6
- IsGreatest.uniquestatement and proof · cited by 6
- isGreatest_singletonstatement · cited by 5
- IsGreatest.nnnorm_cfc_nnrealstatement and proof · cited by 5
- IsGreatest.nnnorm_cfcₙ_nnrealstatement and proof · cited by 5
- IsGreatest.norm_cfcₙstatement and proof · cited by 5
- MonotoneOn.map_isGreateststatement and proof · cited by 5
- isGreatest_Iccstatement · cited by 4
- isGreatest_Iicstatement · cited by 4