Theorems · Definition · order theory
InfHom.dual
{α : Type u_2} → {β : Type u_3} → [inst : Min α] → [inst_1 : Min β] → InfHom α β ≃ SupHom αᵒᵈ βᵒᵈReinterpret an infimum homomorphism as a supremum homomorphism between the dual lattices.
- Defined in
- Mathlib.Order.Hom.Lattice
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Equivstatement · cited by 8,337
- OrderDualstatement and proof · cited by 927
- InfHomstatement and proof · cited by 69
- SupHomstatement and proof · cited by 68
- InfHom.map_inf'proof · cited by 0
Cited by8
Results whose statement or proof uses this declaration.
- LatticeHom.dualproof · cited by 8
- InfTopHom.dualproof · cited by 5
- InfHom.dual_apply_toFunstatement and proof · cited by 0
- InfHom.dual_compstatement · cited by 0
- InfHom.dual_idstatement · cited by 0
- InfHom.dual_symm_apply_toFunstatement and proof · cited by 0
- InfHom.symm_dual_idstatement · cited by 0
- InfHom.symm_dual_compstatement · cited by 0