Theorems · Theorem · order theory
LowerSet.compl_compl
∀ {α : Type u_1} [inst : LE α] (s : LowerSet α), s.compl.compl = s- Defined in
- Mathlib.Order.UpperLower.CompleteLattice
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LE
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SetLike.coeproof · cited by 8,199
- LowerSetstatement and proof · cited by 230
- compl_complproof · cited by 229
- LowerSet.extproof · cited by 29
- LowerSet.complstatement · cited by 17
- UpperSet.complstatement · cited by 17
Cited by1
Results whose statement or proof uses this declaration.
- upperSetIsoLowerSetproof · cited by 2