Theorems · Definition · order theory
InfTopHom.dual
{α : Type u_2} →
{β : Type u_3} →
[inst : Min α] → [inst_1 : Top α] → [inst_2 : Min β] → [inst_3 : Top β] → InfTopHom α β ≃ SupBotHom αᵒᵈ βᵒᵈReinterpret a finitary infimum homomorphism as a finitary supremum homomorphism between the dual lattices.
- Defined in
- Mathlib.Order.Hom.BoundedLattice
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
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
- Equiv.symmproof · cited by 3,681
- OrderDualstatement and proof · cited by 927
- Topstatement and proof · cited by 93
- InfTopHomstatement and proof · cited by 60
- SupBotHomstatement and proof · cited by 54
- InfTopHom.toInfHomproof · cited by 10
- InfHom.dualproof · cited by 6
- SupBotHom.toSupHomproof · cited by 3
- InfTopHom.map_top'proof · cited by 0
Cited by6
Results whose statement or proof uses this declaration.
- SemilatInfCat.dualproof · cited by 7
- InfTopHom.dual_idstatement · cited by 0
- SemilatInfCat.dual_mapstatement · cited by 0
- InfTopHom.symm_dual_compstatement · cited by 0
- InfTopHom.symm_dual_idstatement · cited by 0
- InfTopHom.dual_compstatement · cited by 0