Theorems · Theorem · order theory

Sublattice.map_equiv_eq_comap_symm

∀ {α : Type u_2} {β : Type u_3} [inst : Lattice α] [inst_1 : Lattice β] (f : α ≃o β) (L : Sublattice α),
  Sublattice.map { toFun := ⇑f, map_sup' := ⋯, map_inf' := ⋯ } L =
    Sublattice.comap { toFun := ⇑f.symm, map_sup' := ⋯, map_inf' := ⋯ } L

Defined in

Mathlib.Order.Sublattice

Cited by

1 results in Mathlib

Foundations

Depth 25 from the axioms · uses propext, Quot.sound

Assumes

LatticeLattice