Theorems · Definition · order theory
IsCompactlyGenerated.BooleanGenerators.booleanAlgebra_of_sSup_eq_top
Deprecated since 2026-07-18Use IsCompactlyGenerated.BooleanGenerators.booleanAlgebraOfSSupEqTop instead.
{α : Type u_1} →
[inst : CompleteLattice α] →
{S : Set α} → [IsCompactlyGenerated α] → IsCompactlyGenerated.BooleanGenerators S → sSup S = ⊤ → BooleanAlgebra αAlias of IsCompactlyGenerated.BooleanGenerators.booleanAlgebraOfSSupEqTop.
A compactly generated complete lattice generated by Boolean generators is a Boolean algebra.
- Defined in
- Mathlib.Order.BooleanGenerators
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 89 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Setstatement · cited by 53,352
- Top.topstatement · cited by 9,680
- CompleteLatticestatement · cited by 1,048
- SupSet.sSupstatement · cited by 954
- BooleanAlgebrastatement · cited by 300
- IsCompactlyGeneratedstatement · cited by 37
- IsCompactlyGenerated.BooleanGeneratorsstatement · cited by 11
- IsCompactlyGenerated.BooleanGenerators.booleanAlgebraOfSSupEqTopproof · cited by 0
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.