Theorems · Theorem · order theory
GaloisConnection.l_sup
∀ {α : Type u} {β : Type v} {a₁ a₂ : α} [inst : SemilatticeSup α] [inst_1 : SemilatticeSup β] {l : α → β} {u : β → α},
GaloisConnection l u → l (a₁ ⊔ a₂) = l a₁ ⊔ l a₂- Defined in
- Mathlib.Order.GaloisConnection.Basic
- Cited by
- 81 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- SemilatticeSupSemilatticeSup
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SemilatticeSupstatement and proof · cited by 785
- IsLUBproof · cited by 280
- GaloisConnectionstatement and proof · cited by 253
- IsLUB.uniqueproof · cited by 21
- Set.image_pairproof · cited by 14
- GaloisConnection.isLUB_l_imageproof · cited by 5
- isLUB_pairproof · cited by 5
Cited by81
Results whose statement or proof uses this declaration.
- Submodule.span_unionproof · cited by 23
- Submodule.map_supproof · cited by 16
- GaloisInsertion.l_sup_uproof · cited by 11
- AddSubmonoid.closure_unionproof · cited by 10
- Submonoid.closure_unionproof · cited by 10
- GaloisCoinsertion.u_sup_lproof · cited by 9
- Algebra.adjoin_unionproof · cited by 7
- Subgroup.map_supproof · cited by 7
- AddSubgroup.closure_unionproof · cited by 7
- Subgroup.closure_unionproof · cited by 6
- IntermediateField.adjoin_unionproof · cited by 5
- Filter.map_supproof · cited by 5