Theorems · Definition · order theory
lowerClosure
{α : Type u_1} → [inst : Preorder α] → Set α → LowerSet αThe least lower set containing a given set.
- Defined in
- Mathlib.Order.UpperLower.Closure
- Cited by
- 83 results in Mathlib
- Foundations
- Depth 7 from the axioms · uses no axioms
- Assumes
- Preorder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
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
- Preorderstatement and proof · cited by 7,952
- Set.ofPredproof · cited by 6,101
- LowerSetstatement · cited by 230
Cited by89
Results whose statement or proof uses this declaration.
- Finset.truncatedSupproof · cited by 19
- subset_lowerClosurestatement · cited by 12
- lowerClosure_singletonstatement · cited by 8
- UpperSet.sdiffproof · cited by 8
- lowerClosure_minstatement and proof · cited by 6
- Set.OrdConnected.upperClosure_inter_lowerClosurestatement and proof · cited by 5
- mem_lowerClosurestatement · cited by 5
- Finset.truncatedSup_of_memstatement and proof · cited by 4
- Finset.truncatedSup_of_notMemstatement and proof · cited by 4
- Topology.IsUpperSet.closure_eq_lowerClosurestatement and proof · cited by 3
- lowerClosure_iUnionstatement · cited by 3
- lowerClosure_imagestatement and proof · cited by 3