Theorems · Theorem · order theory

BooleanSubalgebra.map_inf

∀ {α : Type u_2} {β : Type u_3} [inst : BooleanAlgebra α] [inst_1 : BooleanAlgebra β] (L M : BooleanSubalgebra α)
  (f : BoundedLatticeHom α β),
  Function.Injective ⇑f → BooleanSubalgebra.map f (L ⊓ M) = BooleanSubalgebra.map f L ⊓ BooleanSubalgebra.map f M

Defined in

Mathlib.Order.BooleanSubalgebra

Cited by

0 results in Mathlib

Foundations

Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

BooleanAlgebraBooleanAlgebra