Theorems · Theorem · order theory
GaloisConnection.u_eq_top
∀ {α : Type u} {β : Type v} [inst : PartialOrder α] [inst_1 : Preorder β] [inst_2 : OrderTop α] {l : α → β} {u : β → α},
GaloisConnection l u → ∀ {x : β}, u x = ⊤ ↔ l ⊤ ≤ x- Defined in
- Mathlib.Order.GaloisConnection.Defs
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 9 from the axioms · uses no axioms
- Assumes
- PartialOrderPreorderOrderTop
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.
- Top.topstatement · cited by 9,680
- Preorderstatement and proof · cited by 7,952
- PartialOrderstatement and proof · cited by 6,410
- OrderTopstatement and proof · cited by 493
- GaloisConnectionstatement and proof · cited by 253
- top_le_iffproof · cited by 175
- GaloisConnection.le_iff_leproof · cited by 17
Cited by4
Results whose statement or proof uses this declaration.
- GaloisConnection.u_topproof · cited by 31
- Cardinal.toENat_eq_topproof · cited by 4
- GaloisConnection.u_l_topproof · cited by 2
- Filter.ker_eq_univproof · cited by 1