Theorems · Definition · order theory
IsLowerSet
{α : Type u_1} → [LE α] → Set α → PropA lower set in an order α is a set such that any element less than one of its
members is also a member. Also called down-set, downward-closed set.
- Defined in
- Mathlib.Order.Defs.Unbundled
- Cited by
- 167 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 by184
Results whose statement or proof uses this declaration.
- LowerSet.lowerstatement · cited by 13
- Order.Ideal.lowerstatement · cited by 11
- IsUpperSet.complstatement · cited by 9
- IsLowerSet.toDualstatement · cited by 9
- isLowerSet_Iicstatement · cited by 8
- isLowerSet_univstatement · cited by 8
- IsLowerSet.complstatement and proof · cited by 7
- isLowerSet_complstatement and proof · cited by 6
- IsLowerSet.Iic_subsetstatement · cited by 6
- lowerClosure_minstatement and proof · cited by 6
- isUpperSet_complstatement and proof · cited by 5
- IsLowerSet.ordConnectedstatement and proof · cited by 5