max/lean4-htt
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions 2

chore: remove @[simp] from Option.bind_map (#5354)

Browse source
This commit is contained in:
Kim Morrison 2024-09-16 14:44:38 +10:00 • committed by GitHub
parent 9568f305d8
commit 7740a38a71
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
2 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
src/Init/Data/List/Nat/TakeDrop.lean
View file

@ -479,7 +479,7 @@ theorem false_of_mem_take_findIdx {xs : List α} {p : α → Bool} (h : x ∈ xs
· simp only [take_succ_cons, findIdx?_cons]
split
· simp
· simp [ih, Option.guard_comp]
· simp [ih, Option.guard_comp, Option.bind_map]
@[simp] theorem min_findIdx_findIdx {xs : List α} {p q : α → Bool} :
min (xs.findIdx p) (xs.findIdx q) = xs.findIdx (fun a => p a || q a) := by

2
src/Init/Data/Option/Lemmas.lean
View file

@ -248,7 +248,7 @@ theorem isSome_filter_of_isSome (p : α → Bool) (o : Option α) (h : (o.filter
theorem bind_map_comm {α β} {x : Option (Option α)} {f : α → β} :
x.bind (Option.map f) = (x.map (Option.map f)).bind id := by cases x <;> simp
@[simp] theorem bind_map {f : α → β} {g : β → Option γ} {x : Option α} :
theorem bind_map {f : α → β} {g : β → Option γ} {x : Option α} :
(x.map f).bind g = x.bind (g ∘ f) := by cases x <;> simp
@[simp] theorem map_bind {f : α → Option β} {g : β → γ} {x : Option α} :