Theorems · Definition · order theory
IsUpperSet
{α : Type u_1} → [LE α] → Set α → PropAn upper set in an order α is a set such that any element greater than one of its members is
also a member. Also called up-set, upward-closed set.
- Defined in
- Mathlib.Order.Defs.Unbundled
- Cited by
- 148 results in Mathlib
- Foundations
- Depth 4 from the axioms, rests on 9 definitions · uses no axioms
- Assumes
- LE
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
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
Cited by164
Results whose statement or proof uses this declaration.
- UpperSet.upperstatement · cited by 11
- IsUpperSet.complstatement and proof · cited by 9
- IsLowerSet.toDualstatement · cited by 9
- IsUpperSet.preimagestatement and proof · cited by 8
- IsLowerSet.complstatement · cited by 7
- IsUpperSet.Ici_subsetstatement · cited by 6
- isLowerSet_complstatement and proof · cited by 6
- isUpperSet_Icistatement · cited by 5
- isUpperSet_complstatement and proof · cited by 5
- upperClosure_minstatement and proof · cited by 5
- IsUpperSet.interiorstatement and proof · cited by 4
- IsUpperSet.ordConnectedstatement and proof · cited by 4