Theorems · Definition · order theory
SupBotHom.dual
{α : Type u_2} →
{β : Type u_3} →
[inst : Max α] → [inst_1 : Bot α] → [inst_2 : Max β] → [inst_3 : Bot β] → SupBotHom α β ≃ InfTopHom αᵒᵈ βᵒᵈReinterpret a finitary supremum homomorphism as a finitary infimum 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
- Botstatement and proof · cited by 96
- InfTopHomstatement and proof · cited by 60
- SupBotHomstatement and proof · cited by 54
- InfTopHom.toInfHomproof · cited by 10
- SupHom.dualproof · cited by 6
- SupBotHom.toSupHomproof · cited by 3
- SupBotHom.map_bot'proof · cited by 0
Cited by6
Results whose statement or proof uses this declaration.
- SemilatSupCat.dualproof · cited by 4
- SupBotHom.symm_dual_compstatement · cited by 0
- SupBotHom.symm_dual_idstatement · cited by 0
- SupBotHom.dual_compstatement · cited by 0
- SupBotHom.dual_idstatement · cited by 0
- SemilatSupCat.dual_mapstatement · cited by 0