Theorems · Theorem · order theory
BooleanSubalgebra.map_iSup
∀ {ι : Sort u_1} {α : Type u_2} {β : Type u_3} [inst : BooleanAlgebra α] [inst_1 : BooleanAlgebra β]
(f : BoundedLatticeHom α β) (L : ι → BooleanSubalgebra α),
BooleanSubalgebra.map f (⨆ i, L i) = ⨆ i, BooleanSubalgebra.map f (L i)- Defined in
- Mathlib.Order.BooleanSubalgebra
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 67 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- BooleanAlgebraBooleanAlgebra
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- iSupstatement · cited by 2,415
- BooleanAlgebrastatement and proof · cited by 300
- BoundedLatticeHomstatement and proof · cited by 185
- BooleanSubalgebrastatement and proof · cited by 104
- GaloisConnection.l_iSupproof · cited by 78
- BooleanSubalgebra.mapstatement · cited by 20
- BooleanSubalgebra.gc_map_comapproof · cited by 6
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.