Mathlib Map

Theorems · Definition · order theory

sSupHom.copy

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

Copy of a sSupHom 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 11 from the axioms · uses no axioms
Assumes
SupSetSupSet
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

CompleteLatticeHom.copy · cited by 2CompleteLatticeHom.copyFrameHom.copy · cited by 2FrameHom.copysSupHom.coe_copy · cited by 0sSupHom.coe_copysSupHom.copy_eq · cited by 0sSupHom.copy_eqDFunLike.coe · cited by 62936DFunLike.coeSupSet · cited by 154SupSetsSupHom · cited by 40sSupHomsSupHom.copyCITED BYCITES

Cites3

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

  • DFunLike.coestatement and proof · cited by 62,936
  • SupSetstatement and proof · cited by 154
  • sSupHomstatement and proof · cited by 40

Cited by4

Results whose statement or proof uses this declaration.