data.list.nat_antidiagonal | Mathlib porting status

Changes since the initial port

The following section lists changes to this file in mathlib3 and mathlib4 that occured after the initial port. Most recent changes are shown first. Hovering over a commit will show all commits associated with the same mathlib3 commit.

Changes in mathlib3

7b78d177

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

f2f413b9

bump to nightly-2024-03-17-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

22f01ce4

Diff

@@ -44,7 +44,7 @@ def antidiagonal (n : ℕ) : List (ℕ × ℕ) :=
 theorem mem_antidiagonal {n : ℕ} {x : ℕ × ℕ} : x ∈ antidiagonal n ↔ x.1 + x.2 = n :=
   by
   rw [antidiagonal, mem_map]; constructor
-  · rintro ⟨i, hi, rfl⟩; rw [mem_range, lt_succ_iff] at hi ; exact add_tsub_cancel_of_le hi
+  · rintro ⟨i, hi, rfl⟩; rw [mem_range, lt_succ_iff] at hi; exact add_tsub_cancel_of_le hi
   · rintro rfl; refine' ⟨x.fst, _, _⟩
     · rw [mem_range, add_assoc, lt_add_iff_pos_right]; exact zero_lt_succ _
     · exact Prod.ext rfl (add_tsub_cancel_left _ _)

f2f413b9

bump to nightly-2023-09-24-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/ce64cd319bb6b3e82f31c2d38e79080d377be451

5655435f

Diff

@@ -3,8 +3,8 @@ Copyright (c) 2019 Johan Commelin. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Johan Commelin
 -/
-import Mathbin.Data.List.Nodup
-import Mathbin.Data.List.Range
+import Data.List.Nodup
+import Data.List.Range
 
 #align_import data.list.nat_antidiagonal from "leanprover-community/mathlib"@"f2f413b9d4be3a02840d0663dace76e8fe3da053"

f2f413b9

bump to nightly-2023-07-20-09

mathlib commit https://github.com/leanprover-community/mathlib/commit/8ea5598db6caeddde6cb734aa179cc2408dbd345

9c56d0dd

Diff

@@ -2,15 +2,12 @@
 Copyright (c) 2019 Johan Commelin. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Johan Commelin
-
-! This file was ported from Lean 3 source module data.list.nat_antidiagonal
-! leanprover-community/mathlib commit f2f413b9d4be3a02840d0663dace76e8fe3da053
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Data.List.Nodup
 import Mathbin.Data.List.Range
 
+#align_import data.list.nat_antidiagonal from "leanprover-community/mathlib"@"f2f413b9d4be3a02840d0663dace76e8fe3da053"
+
 /-!
 # Antidiagonals in ℕ × ℕ as lists

f2f413b9

bump to nightly-2023-06-01-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/cca40788df1b8755d5baf17ab2f27dacc2e17acb

b9c87c70

Diff

@@ -47,7 +47,7 @@ def antidiagonal (n : ℕ) : List (ℕ × ℕ) :=
 theorem mem_antidiagonal {n : ℕ} {x : ℕ × ℕ} : x ∈ antidiagonal n ↔ x.1 + x.2 = n :=
   by
   rw [antidiagonal, mem_map]; constructor
-  · rintro ⟨i, hi, rfl⟩; rw [mem_range, lt_succ_iff] at hi; exact add_tsub_cancel_of_le hi
+  · rintro ⟨i, hi, rfl⟩; rw [mem_range, lt_succ_iff] at hi ; exact add_tsub_cancel_of_le hi
   · rintro rfl; refine' ⟨x.fst, _, _⟩
     · rw [mem_range, add_assoc, lt_add_iff_pos_right]; exact zero_lt_succ _
     · exact Prod.ext rfl (add_tsub_cancel_left _ _)

f2f413b9

bump to nightly-2023-05-28-04

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

6797a637

Diff

@@ -47,13 +47,9 @@ def antidiagonal (n : ℕ) : List (ℕ × ℕ) :=
 theorem mem_antidiagonal {n : ℕ} {x : ℕ × ℕ} : x ∈ antidiagonal n ↔ x.1 + x.2 = n :=
   by
   rw [antidiagonal, mem_map]; constructor
-  · rintro ⟨i, hi, rfl⟩
-    rw [mem_range, lt_succ_iff] at hi
-    exact add_tsub_cancel_of_le hi
-  · rintro rfl
-    refine' ⟨x.fst, _, _⟩
-    · rw [mem_range, add_assoc, lt_add_iff_pos_right]
-      exact zero_lt_succ _
+  · rintro ⟨i, hi, rfl⟩; rw [mem_range, lt_succ_iff] at hi; exact add_tsub_cancel_of_le hi
+  · rintro rfl; refine' ⟨x.fst, _, _⟩
+    · rw [mem_range, add_assoc, lt_add_iff_pos_right]; exact zero_lt_succ _
     · exact Prod.ext rfl (add_tsub_cancel_left _ _)
 #align list.nat.mem_antidiagonal List.Nat.mem_antidiagonal
 -/
@@ -109,9 +105,7 @@ theorem antidiagonal_succ' {n : ℕ} :
 theorem antidiagonal_succ_succ' {n : ℕ} :
     antidiagonal (n + 2) =
       (0, n + 2) :: (antidiagonal n).map (Prod.map Nat.succ Nat.succ) ++ [(n + 2, 0)] :=
-  by
-  rw [antidiagonal_succ']
-  simpa
+  by rw [antidiagonal_succ']; simpa
 #align list.nat.antidiagonal_succ_succ' List.Nat.antidiagonal_succ_succ'
 -/

f2f413b9

bump to nightly-2023-02-21-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/bd9851ca476957ea4549eb19b40e7b5ade9428cc

1107b979

Changes in mathlib4

mathlib3

mathlib4

7b78d177

chore: backports from #11997, adaptations for nightly-2024-04-07 (#12176)

These are changes from #11997, the latest adaptation PR for nightly-2024-04-07, which can be made directly on master.

Co-authored-by: Scott Morrison <scott.morrison@gmail.com> Co-authored-by: Ruben Van de Velde <65514131+Ruben-VandeVelde@users.noreply.github.com>

02293f49

Diff

@@ -68,7 +68,7 @@ theorem nodup_antidiagonal (n : ℕ) : Nodup (antidiagonal n) :=
 theorem antidiagonal_succ {n : ℕ} :
     antidiagonal (n + 1) = (0, n + 1) :: (antidiagonal n).map (Prod.map Nat.succ id) := by
   simp only [antidiagonal, range_succ_eq_map, map_cons, true_and_iff, Nat.add_succ_sub_one,
-    Nat.add_zero, id.def, eq_self_iff_true, Nat.sub_zero, map_map, Prod.map_mk]
+    Nat.add_zero, id, eq_self_iff_true, Nat.sub_zero, map_map, Prod.map_mk]
   apply congr rfl (congr rfl _)
   ext; simp
 #align list.nat.antidiagonal_succ List.Nat.antidiagonal_succ

7b78d177

chore(Algebra/BigOperators/List): Use Std lemmas (#11725)

Make Algebra.BigOperators.List.Basic, Data.List.Chain not depend on Data.Nat.Order.Basic by using Nat-specific Std lemmas rather than general mathlib ones. I leave the Data.Nat.Basic import since Algebra.BigOperators.List.Basic is algebra territory.
Make Algebra.BigOperators.List.Basic not depend on Algebra.Divisibility.Basic. I'm not too sure about that one since they already are algebra. My motivation is that they involve ring-like objects while big operators are about group-like objects, but this is in some sense a second order refactor.
As a consequence, move the divisibility and MonoidWithZero lemmas from Algebra.BigOperators.List.Basic to Algebra.BigOperators.List.Lemmas.
Move the content of Algebra.BigOperators.List.Defs to Algebra.BigOperators.List.Basic since no file imported the former without the latter and their imports are becoming very close after this PR.
Make Data.List.Count, Data.List.Dedup, Data.List.ProdSigma, Data.List.Zip not depend on Algebra.BigOperators.List.Basic.
As a consequence, move the big operators lemmas that were in there to Algebra.BigOperators.List.Basic. For the lemmas that were Nat -specific, keep a version of them stated using Nat.sum.
To help with this, add Nat.sum_eq_listSum (l : List Nat) : Nat.sum l = l.sum.

f7519d5e

Diff

@@ -39,12 +39,12 @@ theorem mem_antidiagonal {n : ℕ} {x : ℕ × ℕ} : x ∈ antidiagonal n ↔ x
   rw [antidiagonal, mem_map]; constructor
   · rintro ⟨i, hi, rfl⟩
     rw [mem_range, Nat.lt_succ_iff] at hi
-    exact add_tsub_cancel_of_le hi
+    exact Nat.add_sub_cancel' hi
   · rintro rfl
     refine' ⟨x.fst, _, _⟩
-    · rw [mem_range, add_assoc, lt_add_iff_pos_right]
-      exact zero_lt_succ _
-    · exact Prod.ext rfl (by simp only [add_tsub_cancel_left])
+    · rw [mem_range]
+      omega
+    · exact Prod.ext rfl (by simp only [Nat.add_sub_cancel_left])
 #align list.nat.mem_antidiagonal List.Nat.mem_antidiagonal
 
 /-- The length of the antidiagonal of `n` is `n + 1`. -/
@@ -68,15 +68,15 @@ theorem nodup_antidiagonal (n : ℕ) : Nodup (antidiagonal n) :=
 theorem antidiagonal_succ {n : ℕ} :
     antidiagonal (n + 1) = (0, n + 1) :: (antidiagonal n).map (Prod.map Nat.succ id) := by
   simp only [antidiagonal, range_succ_eq_map, map_cons, true_and_iff, Nat.add_succ_sub_one,
-    add_zero, id.def, eq_self_iff_true, tsub_zero, map_map, Prod.map_mk]
+    Nat.add_zero, id.def, eq_self_iff_true, Nat.sub_zero, map_map, Prod.map_mk]
   apply congr rfl (congr rfl _)
   ext; simp
 #align list.nat.antidiagonal_succ List.Nat.antidiagonal_succ
 
 theorem antidiagonal_succ' {n : ℕ} :
     antidiagonal (n + 1) = (antidiagonal n).map (Prod.map id Nat.succ) ++ [(n + 1, 0)] := by
-  simp only [antidiagonal, range_succ, add_tsub_cancel_left, map_append, append_assoc, tsub_self,
-    singleton_append, map_map, map]
+  simp only [antidiagonal, range_succ, Nat.add_sub_cancel_left, map_append, append_assoc,
+    Nat.sub_self, singleton_append, map_map, map]
   congr 1
   apply map_congr
   simp (config := { contextual := true }) [le_of_lt, Nat.succ_eq_add_one, Nat.sub_add_comm]

7b78d177

chore: bump dependencies (#10315)

Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

ba9f2e5b

Diff

@@ -38,7 +38,7 @@ def antidiagonal (n : ℕ) : List (ℕ × ℕ) :=
 theorem mem_antidiagonal {n : ℕ} {x : ℕ × ℕ} : x ∈ antidiagonal n ↔ x.1 + x.2 = n := by
   rw [antidiagonal, mem_map]; constructor
   · rintro ⟨i, hi, rfl⟩
-    rw [mem_range, lt_succ_iff] at hi
+    rw [mem_range, Nat.lt_succ_iff] at hi
     exact add_tsub_cancel_of_le hi
   · rintro rfl
     refine' ⟨x.fst, _, _⟩
@@ -97,7 +97,7 @@ theorem map_swap_antidiagonal {n : ℕ} :
   rw [antidiagonal, map_map, ← List.map_reverse, range_eq_range', reverse_range', ←
     range_eq_range', map_map]
   apply map_congr
-  simp (config := { contextual := true }) [Nat.sub_sub_self, lt_succ_iff]
+  simp (config := { contextual := true }) [Nat.sub_sub_self, Nat.lt_succ_iff]
 #align list.nat.map_swap_antidiagonal List.Nat.map_swap_antidiagonal
 
 end Nat

7b78d177

chore: fix nonterminal simps (#7497)

Fixes the nonterminal simps identified by #7496

19ca95b1

Diff

@@ -86,7 +86,8 @@ theorem antidiagonal_succ_succ' {n : ℕ} :
     antidiagonal (n + 2) =
       (0, n + 2) :: (antidiagonal n).map (Prod.map Nat.succ Nat.succ) ++ [(n + 2, 0)] := by
   rw [antidiagonal_succ']
-  simp
+  simp only [antidiagonal_succ, map_cons, Prod_map, id_eq, map_map, cons_append, cons.injEq,
+    append_cancel_right_eq, true_and]
   ext
   simp
 #align list.nat.antidiagonal_succ_succ' List.Nat.antidiagonal_succ_succ'
@@ -102,4 +103,3 @@ theorem map_swap_antidiagonal {n : ℕ} :
 end Nat
 
 end List
-

7b78d177

chore: script to replace headers with #align_import statements (#5979)

depends on: #5966

Co-authored-by: Eric Wieser <wieser.eric@gmail.com> Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

89aa3a3b

Diff

@@ -2,15 +2,12 @@
 Copyright (c) 2019 Johan Commelin. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Johan Commelin
-
-! This file was ported from Lean 3 source module data.list.nat_antidiagonal
-! leanprover-community/mathlib commit 7b78d1776212a91ecc94cf601f83bdcc46b04213
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Data.List.Nodup
 import Mathlib.Data.List.Range
 
+#align_import data.list.nat_antidiagonal from "leanprover-community/mathlib"@"7b78d1776212a91ecc94cf601f83bdcc46b04213"
+
 /-!
 # Antidiagonals in ℕ × ℕ as lists

7b78d177

chore: format by line breaks with long lines (#1529)

This was done semi-automatically with some regular expressions in vim in contrast to the fully automatic https://github.com/leanprover-community/mathlib4/pull/1523.

Co-authored-by: Moritz Firsching <firsching@google.com>

1050066f

Diff

@@ -94,8 +94,8 @@ theorem antidiagonal_succ_succ' {n : ℕ} :
   simp
 #align list.nat.antidiagonal_succ_succ' List.Nat.antidiagonal_succ_succ'
 
-theorem map_swap_antidiagonal {n : ℕ} : (antidiagonal n).map Prod.swap = (antidiagonal n).reverse :=
-  by
+theorem map_swap_antidiagonal {n : ℕ} :
+    (antidiagonal n).map Prod.swap = (antidiagonal n).reverse := by
   rw [antidiagonal, map_map, ← List.map_reverse, range_eq_range', reverse_range', ←
     range_eq_range', map_map]
   apply map_congr

7b78d177

feat: Port/data.list.nat antidiagonal (#1474)

91a95124

`data.list.nat_antidiagonal` ⟷ `Mathlib.Data.List.NatAntidiagonal`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 2 + 107

data.list.nat_antidiagonal ⟷ Mathlib.Data.List.NatAntidiagonal

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 2 + 107

`data.list.nat_antidiagonal` ⟷ `Mathlib.Data.List.NatAntidiagonal`