Theorems · Theorem · order theory
UpperSet.compl_sup
∀ {α : Type u_1} [inst : LE α] (s t : UpperSet α), (s ⊔ t).compl = s.compl ⊔ t.compl- 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.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- UpperSetstatement and proof · cited by 245
- LowerSetstatement · cited by 230
- LowerSet.extproof · cited by 29
- UpperSet.complstatement · cited by 17
- compl_infproof · cited by 12
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.