Theorems · Theorem · order theory
BooleanSubalgebra.mem_closure_iff_sup_sdiff
∀ {α : Type u_2} [inst : BooleanAlgebra α] {s : Set α},
IsSublattice s → ⊥ ∈ s → ⊤ ∈ s → ∀ {a : α}, a ∈ BooleanSubalgebra.closure s ↔ ∃ t, a = t.sup fun x => ↑x.1 \ ↑x.2- Defined in
- Mathlib.Order.BooleanSubalgebra
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- BooleanAlgebra
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites35
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- Top.topstatement and proof · cited by 9,680
- SetLike.coeproof · cited by 8,199
- Set.Elemstatement and proof · cited by 7,166
- Bot.botstatement and proof · cited by 4,720
- Compl.complproof · cited by 2,925
- Finset.supstatement and proof · cited by 530
- BooleanAlgebrastatement and proof · cited by 300
- compl_complproof · cited by 229
- inf_of_le_rightproof · cited by 128
- Finset.inductionproof · cited by 108
Cited by1
Results whose statement or proof uses this declaration.
- BooleanSubalgebra.closure_sdiff_sup_inductionproof · cited by 1