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: bump Std #11833

Closed
wants to merge 2 commits into from
Closed

[Merged by Bors] - chore: bump Std #11833

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
837e0da
chore: bump Std
kim-em Apr 1, 2024
4703de9
fix
kim-em Apr 1, 2024
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/Combinatorics/Enumerative/Composition.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -715,8 +715,8 @@ theorem get_splitWrtCompositionAux (l : List α) (ns : List ℕ) {i : ℕ} (hi)
· rw [Nat.add_zero, List.take_zero, sum_nil]
simpa using get_zero hi
· simp only [splitWrtCompositionAux._eq_2, get_cons_succ, IH, take,
sum_cons, Nat.add_eq, add_zero, splitAt_eq_take_drop, ← drop_take, drop_drop]
rw [Nat.succ_eq_add_one, add_comm i 1, add_comm]
sum_cons, Nat.add_eq, add_zero, splitAt_eq_take_drop, drop_take, drop_drop]
rw [Nat.succ_eq_add_one, add_comm (sum _) n, Nat.add_sub_add_left]
#align list.nth_le_split_wrt_composition_aux List.get_splitWrtCompositionAux

/-- The `i`-th sublist in the splitting of a list `l` along a composition `c`, is the slice of `l`
Expand Down
5 changes: 0 additions & 5 deletions Mathlib/Data/List/Forall2.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,11 +29,6 @@ mk_iff_of_inductive_prop List.Forall₂ List.forall₂_iff

#align list.forall₂.nil List.Forall₂.nil
#align list.forall₂.cons List.Forall₂.cons

@[simp]
theorem forall₂_cons {a b l₁ l₂} : Forall₂ R (a :: l₁) (b :: l₂) ↔ R a b ∧ Forall₂ R l₁ l₂ :=
⟨fun h => by cases' h with h₁ h₂; constructor <;> assumption, fun ⟨h₁, h₂⟩ =>
Forall₂.cons h₁ h₂⟩
#align list.forall₂_cons List.forall₂_cons

theorem Forall₂.imp (H : ∀ a b, R a b → S a b) {l₁ l₂} (h : Forall₂ R l₁ l₂) : Forall₂ S l₁ l₂ := by
Expand Down
2 changes: 1 addition & 1 deletion lake-manifest.json
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,7 @@
[{"url": "https://github.com/leanprover/std4",
"type": "git",
"subDir": null,
"rev": "e5306c3b0edefe722370b7387ee9bcd4631d6c17",
"rev": "67c40f89be2c17c6f4b0b6056d2de8591c0f92d3",
"name": "std",
"manifestFile": "lake-manifest.json",
"inputRev": "main",
Expand Down
Loading