Theorems · Theorem · order theory
IsLowerSet.compl
∀ {α : Type u_1} [inst : LE α] {s : Set α}, IsLowerSet s → IsUpperSet sᶜ- Defined in
- Mathlib.Order.UpperLower.Basic
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 5 from the axioms · uses no axioms
- Assumes
- LE
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
- Compl.complstatement and proof · cited by 2,925
- IsLowerSetstatement and proof · cited by 167
- IsUpperSetstatement · cited by 148
Cited by7
Results whose statement or proof uses this declaration.
- isLowerSet_complproof · cited by 6
- isUpperSet_complproof · cited by 5
- IsLowerSet.dirSupInaccOnproof · cited by 2
- IsLowerSet.eq_univ_or_Iioproof · cited by 2
- IsLowerSet.dirSupInaccproof · cited by 1
- IsLowerSet.isOpenproof · cited by 1
- IsLowerSet.null_frontierproof · cited by 1