Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

[Merged by Bors] - chore: label one porting note and fix another #11411

Closed
wants to merge 1 commit into from
Closed

[Merged by Bors] - chore: label one porting note and fix another #11411

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions Mathlib/Data/Finset/Basic.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3754,9 +3754,9 @@ theorem biUnion_insert [DecidableEq α] {a : α} : (insert a s).biUnion t = t a
exists_eq_left]
#align finset.bUnion_insert Finset.biUnion_insert

-- ext <| λ x, by simp [or_and_distrib_right, exists_or_distrib]
theorem biUnion_congr (hs : s₁ = s₂) (ht : ∀ a ∈ s₁, t₁ a = t₂ a) : s₁.biUnion t₁ = s₂.biUnion t₂ :=
ext fun x => by
ext fun x ↦ by
-- Porting note: this entire proof was `simp [or_and_distrib_right, exists_or_distrib]`
simp_rw [mem_biUnion]
apply exists_congr
simp (config := { contextual := true }) only [hs, and_congr_right_iff, ht, implies_true]
Expand Down
4 changes: 1 addition & 3 deletions Mathlib/Order/Hom/Bounded.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -129,9 +129,7 @@ instance (priority := 100) OrderIsoClass.toTopHomClass [LE α] [OrderTop α]
-- See note [lower instance priority]
instance (priority := 100) OrderIsoClass.toBotHomClass [LE α] [OrderBot α]
[PartialOrder β] [OrderBot β] [OrderIsoClass F α β] : BotHomClass F α β :=
{ --⟨λ f, le_bot_iff.1 <| (le_map_inv_iff f).1 bot_le⟩
show OrderHomClass F α β from inferInstance with
map_bot := fun f => le_bot_iff.1 <| (le_map_inv_iff f).1 bot_le }
{ map_bot := fun f => le_bot_iff.1 <| (le_map_inv_iff f).1 bot_le }
#align order_iso_class.to_bot_hom_class OrderIsoClass.toBotHomClass

-- See note [lower instance priority]
Expand Down
Loading