Theorems · Theorem · order theory
OrderIso.map_sup
∀ {α : Type u_2} {β : Type u_3} [inst : SemilatticeSup α] [inst_1 : SemilatticeSup β] (f : α ≃o β) (x y : α),
f (x ⊔ y) = f x ⊔ f y- Defined in
- Mathlib.Order.Hom.Basic
- Cited by
- 37 results in Mathlib
- Foundations
- Depth 26 from the axioms · uses propext, Quot.sound
- Assumes
- SemilatticeSupSemilatticeSup
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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
- OrderIsostatement and proof · cited by 874
- SemilatticeSupstatement and proof · cited by 785
- OrderIso.symmproof · cited by 475
- LE.le.antisymm'proof · cited by 104
- sup_le_iffproof · cited by 58
- OrderIso.symm_apply_applyproof · cited by 41
- OrderIso.le_iff_leproof · cited by 29
- OrderIso.toOrderEmbeddingproof · cited by 22
- OrderEmbedding.le_map_supproof · cited by 1
Cited by37
Results whose statement or proof uses this declaration.
- add_supproof · cited by 6
- mul_supproof · cited by 6
- neg_supproof · cited by 3
- sup_mulproof · cited by 3
- sup_addproof · cited by 3
- inv_supproof · cited by 3
- Codisjoint.map_orderIsoproof · cited by 2
- sup_divproof · cited by 1
- div_supproof · cited by 1
- NumberField.Units.regOfFamily_div_regOfFamilyproof · cited by 1
- sub_supproof · cited by 1
- sup_subproof · cited by 1