Theorems · Definition · order theory
TopHom.copy
{α : Type u_2} →
{β : Type u_3} → [inst : Top α] → [inst_1 : Top β] → (f : TopHom α β) → (f' : α → β) → f' = ⇑f → TopHom α βCopy of a TopHom with a new toFun equal to the old one. Useful to fix definitional
equalities.
- Defined in
- Mathlib.Order.Hom.Bounded
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
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
- Topstatement and proof · cited by 93
- TopHomstatement and proof · cited by 37
Cited by4
Results whose statement or proof uses this declaration.
- InfTopHom.copyproof · cited by 2
- BoundedOrderHom.copyproof · cited by 2
- TopHom.coe_copystatement · cited by 0
- TopHom.copy_eqstatement · cited by 0