Theorems · Definition · order theory
UpperSet.compl
{α : Type u_1} → [inst : LE α] → UpperSet α → LowerSet αThe complement of an upper set as a lower set.
- Defined in
- Mathlib.Order.UpperLower.CompleteLattice
- Cited by
- 17 results in Mathlib
- Foundations
- Depth 12 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.
- SetLike.coeproof · cited by 8,199
- Compl.complproof · cited by 2,925
- UpperSetstatement and proof · cited by 245
- LowerSetstatement · cited by 230
Cited by18
Results whose statement or proof uses this declaration.
- upperSetIsoLowerSetproof · cited by 2
- UpperSet.compl_iInfstatement and proof · cited by 1
- UpperSet.compl_iSupstatement and proof · cited by 1
- LowerSet.compl_complstatement · cited by 0
- upperSetIsoLowerSet_applystatement · cited by 0
- UpperSet.compl_botstatement · cited by 0
- UpperSet.compl_complstatement · cited by 0
- UpperSet.compl_iInf₂statement and proof · cited by 0
- UpperSet.compl_iSup₂statement and proof · cited by 0
- UpperSet.compl_infstatement · cited by 0
- UpperSet.compl_le_complstatement · cited by 0
- UpperSet.compl_mapstatement and proof · cited by 0