Theorems · Theorem · order theory
compl_eq_sSup_disjoint
∀ {α : Type u} [inst : Order.Frame α] {a : α}, aᶜ = sSup {w | Disjoint w a}- Defined in
- Mathlib.Order.CompleteBooleanAlgebra
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses propext, Quot.sound
- Assumes
- Order.Frame
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Set.ofPredstatement · cited by 6,101
- Compl.complstatement · cited by 2,925
- Disjointstatement · cited by 2,201
- SupSet.sSupstatement · cited by 954
- Order.Framestatement and proof · cited by 88
- IsGreatest.isLUBproof · cited by 25
- IsLUB.sSup_eqproof · cited by 17
- isGreatest_complproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- TopologicalSpace.Opens.mem_complproof · cited by 0