Theorems · Theorem · order theory

BooleanSubalgebra.map_map

∀ {α : Type u_2} {β : Type u_3} {γ : Type u_4} [inst : BooleanAlgebra α] [inst_1 : BooleanAlgebra β]
  [inst_2 : BooleanAlgebra γ] {L : BooleanSubalgebra α} (g : BoundedLatticeHom β γ) (f : BoundedLatticeHom α β),
  BooleanSubalgebra.map g (BooleanSubalgebra.map f L) = BooleanSubalgebra.map (g.comp f) L

Defined in

Mathlib.Order.BooleanSubalgebra

Cited by

0 results in Mathlib

Foundations

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

Assumes

BooleanAlgebraBooleanAlgebraBooleanAlgebra