Theorems · Definition · order theory

CompleteLatticeHom.copy

{α : Type u_2} →
  {β : Type u_3} →
    [inst : CompleteLattice α] →
      [inst_1 : CompleteLattice β] → (f : CompleteLatticeHom α β) → (f' : α → β) → f' = ⇑f → CompleteLatticeHom α β

Copy of a CompleteLatticeHom with a new toFun equal to the old one. Useful to fix definitional equalities.

Defined in

Mathlib.Order.Hom.CompleteLattice

Cited by

2 results in Mathlib

Foundations

Depth 15 from the axioms · uses no axioms

Assumes

CompleteLatticeCompleteLattice