Skip to content

Commit

Permalink
feat(order/galois_connection): add 2 lemmas (#17221)
Browse files Browse the repository at this point in the history
add `galois_connection.u_eq_top` and `galois_connection.l_eq_bot`
  • Loading branch information
urkud committed Oct 28, 2022
1 parent 39cbe8d commit 1417a74
Showing 1 changed file with 12 additions and 8 deletions.
20 changes: 12 additions & 8 deletions src/order/galois_connection.lean
Original file line number Diff line number Diff line change
Expand Up @@ -200,20 +200,24 @@ end
end partial_order

section order_top
variables [partial_order α] [preorder β] [order_top α] [order_top β] {l : α → β} {u : β → α}
(gc : galois_connection l u)
include gc
variables [partial_order α] [preorder β] [order_top α]

lemma u_eq_top {l : α → β} {u : β → α} (gc : galois_connection l u) {x} : u x = ⊤ ↔ l ⊤ ≤ x :=
top_le_iff.symm.trans gc.le_iff_le.symm

lemma u_top : u ⊤ = ⊤ := top_unique $ gc.le_u le_top
lemma u_top [order_top β] {l : α → β} {u : β → α} (gc : galois_connection l u) : u ⊤ = ⊤ :=
gc.u_eq_top.2 le_top

end order_top

section order_bot
variables [preorder α] [partial_order β] [order_bot α] [order_bot β] {l : α → β} {u : β → α}
(gc : galois_connection l u)
include gc
variables [preorder α] [partial_order β] [order_bot β]

lemma l_eq_bot {l : α → β} {u : β → α} (gc : galois_connection l u) {x} : l x = ⊥ ↔ x ≤ u ⊥ :=
gc.dual.u_eq_top

lemma l_bot : l ⊥ = ⊥ := gc.dual.u_top
lemma l_bot [order_bot α] {l : α → β} {u : β → α} (gc : galois_connection l u) : l ⊥ = ⊥ :=
gc.dual.u_top

end order_bot

Expand Down

0 comments on commit 1417a74

Please sign in to comment.