Theorems · Definition · order theory

LatticeHom.copy

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

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

Defined in

Mathlib.Order.Hom.Lattice

Cited by

2 results in Mathlib

Foundations

Depth 10 from the axioms · uses no axioms

Assumes

LatticeLattice