data.nat.set | 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

cf9386b5

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

448144f7

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,7 +3,7 @@ Copyright (c) 2020 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
 -/
-import Mathbin.Data.Set.Image
+import Data.Set.Image
 
 #align_import data.nat.set from "leanprover-community/mathlib"@"448144f7ae193a8990cb7473c9e9a01990f64ac7"

448144f7

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,14 +2,11 @@
 Copyright (c) 2020 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
-
-! This file was ported from Lean 3 source module data.nat.set
-! leanprover-community/mathlib commit 448144f7ae193a8990cb7473c9e9a01990f64ac7
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Data.Set.Image
 
+#align_import data.nat.set from "leanprover-community/mathlib"@"448144f7ae193a8990cb7473c9e9a01990f64ac7"
+
 /-!
 ### Recursion on the natural numbers and `set.range`

448144f7

bump to nightly-2023-06-13-21

mathlib commit https://github.com/leanprover-community/mathlib/commit/9fb8964792b4237dac6200193a0d533f1b3f7423

829520ac

Diff

@@ -24,8 +24,10 @@ section Set
 
 open Set
 
+#print Nat.zero_union_range_succ /-
 theorem zero_union_range_succ : {0} ∪ range succ = univ := by ext n; cases n <;> simp
 #align nat.zero_union_range_succ Nat.zero_union_range_succ
+-/
 
 #print Nat.range_succ /-
 @[simp]
@@ -36,10 +38,13 @@ protected theorem range_succ : range succ = {i | 0 < i} := by
 
 variable {α : Type _}
 
+#print Nat.range_of_succ /-
 theorem range_of_succ (f : ℕ → α) : {f 0} ∪ range (f ∘ succ) = range f := by
   rw [← image_singleton, range_comp, ← image_union, zero_union_range_succ, image_univ]
 #align nat.range_of_succ Nat.range_of_succ
+-/
 
+#print Nat.range_rec /-
 theorem range_rec {α : Type _} (x : α) (f : ℕ → α → α) :
     (Set.range fun n => Nat.rec x f n : Set α) =
       {x} ∪ Set.range fun n => Nat.rec (f 0 x) (f ∘ succ) n :=
@@ -51,11 +56,14 @@ theorem range_rec {α : Type _} (x : α) (f : ℕ → α → α) :
   · dsimp at ihn ⊢
     rw [ihn]
 #align nat.range_rec Nat.range_rec
+-/
 
+#print Nat.range_casesOn /-
 theorem range_casesOn {α : Type _} (x : α) (f : ℕ → α) :
     (Set.range fun n => Nat.casesOn n x f : Set α) = {x} ∪ Set.range f :=
   (range_of_succ _).symm
 #align nat.range_cases_on Nat.range_casesOn
+-/
 
 end Set

448144f7

bump to nightly-2023-06-04-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/5f25c089cb34db4db112556f23c50d12da81b297

3fb4268b

Diff

@@ -29,7 +29,7 @@ theorem zero_union_range_succ : {0} ∪ range succ = univ := by ext n; cases n <
 
 #print Nat.range_succ /-
 @[simp]
-protected theorem range_succ : range succ = { i | 0 < i } := by
+protected theorem range_succ : range succ = {i | 0 < i} := by
   ext (_ | i) <;> simp [succ_pos, succ_ne_zero]
 #align nat.range_succ Nat.range_succ
 -/
@@ -44,7 +44,7 @@ theorem range_rec {α : Type _} (x : α) (f : ℕ → α → α) :
     (Set.range fun n => Nat.rec x f n : Set α) =
       {x} ∪ Set.range fun n => Nat.rec (f 0 x) (f ∘ succ) n :=
   by
-  convert(range_of_succ _).symm
+  convert (range_of_succ _).symm
   ext n
   induction' n with n ihn
   · rfl

448144f7

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -48,7 +48,7 @@ theorem range_rec {α : Type _} (x : α) (f : ℕ → α → α) :
   ext n
   induction' n with n ihn
   · rfl
-  · dsimp at ihn⊢
+  · dsimp at ihn ⊢
     rw [ihn]
 #align nat.range_rec Nat.range_rec

448144f7

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -24,12 +24,6 @@ section Set
 
 open Set
 
-/- warning: nat.zero_union_range_succ -> Nat.zero_union_range_succ is a dubious translation:
-lean 3 declaration is
-  Eq.{1} (Set.{0} Nat) (Union.union.{0} (Set.{0} Nat) (Set.hasUnion.{0} Nat) (Singleton.singleton.{0, 0} Nat (Set.{0} Nat) (Set.hasSingleton.{0} Nat) (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (Set.range.{0, 1} Nat Nat Nat.succ)) (Set.univ.{0} Nat)
-but is expected to have type
-  Eq.{1} (Set.{0} Nat) (Union.union.{0} (Set.{0} Nat) (Set.instUnionSet.{0} Nat) (Singleton.singleton.{0, 0} Nat (Set.{0} Nat) (Set.instSingletonSet.{0} Nat) (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (Set.range.{0, 1} Nat Nat Nat.succ)) (Set.univ.{0} Nat)
-Case conversion may be inaccurate. Consider using '#align nat.zero_union_range_succ Nat.zero_union_range_succₓ'. -/
 theorem zero_union_range_succ : {0} ∪ range succ = univ := by ext n; cases n <;> simp
 #align nat.zero_union_range_succ Nat.zero_union_range_succ
 
@@ -42,22 +36,10 @@ protected theorem range_succ : range succ = { i | 0 < i } := by
 
 variable {α : Type _}
 
-/- warning: nat.range_of_succ -> Nat.range_of_succ is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} (f : Nat -> α), Eq.{succ u1} (Set.{u1} α) (Union.union.{u1} (Set.{u1} α) (Set.hasUnion.{u1} α) (Singleton.singleton.{u1, u1} α (Set.{u1} α) (Set.hasSingleton.{u1} α) (f (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero))))) (Set.range.{u1, 1} α Nat (Function.comp.{1, 1, succ u1} Nat Nat α f Nat.succ))) (Set.range.{u1, 1} α Nat f)
-but is expected to have type
-  forall {α : Type.{u1}} (f : Nat -> α), Eq.{succ u1} (Set.{u1} α) (Union.union.{u1} (Set.{u1} α) (Set.instUnionSet.{u1} α) (Singleton.singleton.{u1, u1} α (Set.{u1} α) (Set.instSingletonSet.{u1} α) (f (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0)))) (Set.range.{u1, 1} α Nat (Function.comp.{1, 1, succ u1} Nat Nat α f Nat.succ))) (Set.range.{u1, 1} α Nat f)
-Case conversion may be inaccurate. Consider using '#align nat.range_of_succ Nat.range_of_succₓ'. -/
 theorem range_of_succ (f : ℕ → α) : {f 0} ∪ range (f ∘ succ) = range f := by
   rw [← image_singleton, range_comp, ← image_union, zero_union_range_succ, image_univ]
 #align nat.range_of_succ Nat.range_of_succ
 
-/- warning: nat.range_rec -> Nat.range_rec is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} (x : α) (f : Nat -> α -> α), Eq.{succ u1} (Set.{u1} α) (Set.range.{u1, 1} α Nat (fun (n : Nat) => Nat.rec.{succ u1} (fun (_x : Nat) => α) x f n)) (Union.union.{u1} (Set.{u1} α) (Set.hasUnion.{u1} α) (Singleton.singleton.{u1, u1} α (Set.{u1} α) (Set.hasSingleton.{u1} α) x) (Set.range.{u1, 1} α Nat (fun (n : Nat) => Nat.rec.{succ u1} (fun (_x : Nat) => α) (f (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero))) x) (Function.comp.{1, 1, succ u1} Nat Nat (α -> α) f Nat.succ) n)))
-but is expected to have type
-  forall {α : Type.{u1}} (x : α) (f : Nat -> α -> α), Eq.{succ u1} (Set.{u1} α) (Set.range.{u1, 1} α Nat (fun (n : Nat) => Nat.rec.{succ u1} (fun (_x : Nat) => α) x f n)) (Union.union.{u1} (Set.{u1} α) (Set.instUnionSet.{u1} α) (Singleton.singleton.{u1, u1} α (Set.{u1} α) (Set.instSingletonSet.{u1} α) x) (Set.range.{u1, 1} α Nat (fun (n : Nat) => Nat.rec.{succ u1} (fun (_x : Nat) => α) (f (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0)) x) (Function.comp.{1, 1, succ u1} Nat Nat (α -> α) f Nat.succ) n)))
-Case conversion may be inaccurate. Consider using '#align nat.range_rec Nat.range_recₓ'. -/
 theorem range_rec {α : Type _} (x : α) (f : ℕ → α → α) :
     (Set.range fun n => Nat.rec x f n : Set α) =
       {x} ∪ Set.range fun n => Nat.rec (f 0 x) (f ∘ succ) n :=
@@ -70,12 +52,6 @@ theorem range_rec {α : Type _} (x : α) (f : ℕ → α → α) :
     rw [ihn]
 #align nat.range_rec Nat.range_rec
 
-/- warning: nat.range_cases_on -> Nat.range_casesOn is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} (x : α) (f : Nat -> α), Eq.{succ u1} (Set.{u1} α) (Set.range.{u1, 1} α Nat (fun (n : Nat) => Nat.casesOn.{succ u1} (fun (_x : Nat) => α) n x f)) (Union.union.{u1} (Set.{u1} α) (Set.hasUnion.{u1} α) (Singleton.singleton.{u1, u1} α (Set.{u1} α) (Set.hasSingleton.{u1} α) x) (Set.range.{u1, 1} α Nat f))
-but is expected to have type
-  forall {α : Type.{u1}} (x : α) (f : Nat -> α), Eq.{succ u1} (Set.{u1} α) (Set.range.{u1, 1} α Nat (fun (n : Nat) => Nat.casesOn.{succ u1} (fun (_x : Nat) => α) n x f)) (Union.union.{u1} (Set.{u1} α) (Set.instUnionSet.{u1} α) (Singleton.singleton.{u1, u1} α (Set.{u1} α) (Set.instSingletonSet.{u1} α) x) (Set.range.{u1, 1} α Nat f))
-Case conversion may be inaccurate. Consider using '#align nat.range_cases_on Nat.range_casesOnₓ'. -/
 theorem range_casesOn {α : Type _} (x : α) (f : ℕ → α) :
     (Set.range fun n => Nat.casesOn n x f : Set α) = {x} ∪ Set.range f :=
   (range_of_succ _).symm

448144f7

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -30,10 +30,7 @@ lean 3 declaration is
 but is expected to have type
   Eq.{1} (Set.{0} Nat) (Union.union.{0} (Set.{0} Nat) (Set.instUnionSet.{0} Nat) (Singleton.singleton.{0, 0} Nat (Set.{0} Nat) (Set.instSingletonSet.{0} Nat) (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (Set.range.{0, 1} Nat Nat Nat.succ)) (Set.univ.{0} Nat)
 Case conversion may be inaccurate. Consider using '#align nat.zero_union_range_succ Nat.zero_union_range_succₓ'. -/
-theorem zero_union_range_succ : {0} ∪ range succ = univ :=
-  by
-  ext n
-  cases n <;> simp
+theorem zero_union_range_succ : {0} ∪ range succ = univ := by ext n; cases n <;> simp
 #align nat.zero_union_range_succ Nat.zero_union_range_succ
 
 #print Nat.range_succ /-

448144f7

bump to nightly-2023-03-17-00

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

c85864d4

Diff

@@ -65,7 +65,7 @@ theorem range_rec {α : Type _} (x : α) (f : ℕ → α → α) :
     (Set.range fun n => Nat.rec x f n : Set α) =
       {x} ∪ Set.range fun n => Nat.rec (f 0 x) (f ∘ succ) n :=
   by
-  convert (range_of_succ _).symm
+  convert(range_of_succ _).symm
   ext n
   induction' n with n ihn
   · rfl

448144f7

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

cf9386b5

chore: banish Type _ and Sort _ (#6499)

We remove all possible occurences of Type _ and Sort _ in favor of Type* and Sort*.

This has nice performance benefits.

32de3f67

Diff

@@ -28,13 +28,13 @@ protected theorem range_succ : range succ = { i | 0 < i } := by
   ext (_ | i) <;> simp [succ_pos, succ_ne_zero, Set.mem_setOf]
 #align nat.range_succ Nat.range_succ
 
-variable {α : Type _}
+variable {α : Type*}
 
 theorem range_of_succ (f : ℕ → α) : {f 0} ∪ range (f ∘ succ) = range f := by
   rw [← image_singleton, range_comp, ← image_union, zero_union_range_succ, image_univ]
 #align nat.range_of_succ Nat.range_of_succ
 
-theorem range_rec {α : Type _} (x : α) (f : ℕ → α → α) :
+theorem range_rec {α : Type*} (x : α) (f : ℕ → α → α) :
     (Set.range fun n => Nat.rec x f n : Set α) =
       {x} ∪ Set.range fun n => Nat.rec (f 0 x) (f ∘ succ) n := by
   convert (range_of_succ (fun n => Nat.rec x f n : ℕ → α)).symm using 4
@@ -46,7 +46,7 @@ theorem range_rec {α : Type _} (x : α) (f : ℕ → α → α) :
     rw [ihn]
 #align nat.range_rec Nat.range_rec
 
-theorem range_casesOn {α : Type _} (x : α) (f : ℕ → α) :
+theorem range_casesOn {α : Type*} (x : α) (f : ℕ → α) :
     (Set.range fun n => Nat.casesOn n x f : Set α) = {x} ∪ Set.range f :=
   (range_of_succ _).symm
 #align nat.range_cases_on Nat.range_casesOn

cf9386b5

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,14 +2,11 @@
 Copyright (c) 2020 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
-
-! This file was ported from Lean 3 source module data.nat.set
-! leanprover-community/mathlib commit cf9386b56953fb40904843af98b7a80757bbe7f9
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Data.Set.Image
 
+#align_import data.nat.set from "leanprover-community/mathlib"@"cf9386b56953fb40904843af98b7a80757bbe7f9"
+
 /-!
 ### Recursion on the natural numbers and `Set.range`
 -/

cf9386b5

chore: clean up spacing around at and goals (#5387)

Changes are of the form

some_tactic at h⊢ -> some_tactic at h ⊢
some_tactic at h -> some_tactic at h

2a870323

Diff

@@ -45,7 +45,7 @@ theorem range_rec {α : Type _} (x : α) (f : ℕ → α → α) :
   rename_i n
   induction' n with n ihn
   · rfl
-  · dsimp at ihn⊢
+  · dsimp at ihn ⊢
     rw [ihn]
 #align nat.range_rec Nat.range_rec

cf9386b5

feat: improvements to congr! and convert (#2606)

There is now configuration for congr!, convert, and convert_to to control parts of the congruence algorithm, in particular transparency settings when applying congruence lemmas.
congr! now applies congruence lemmas with reducible transparency by default. This prevents it from unfolding definitions when applying congruence lemmas. It also now tries both the LHS-biased and RHS-biased simp congruence lemmas, with a configuration option to set which it should try first.
There is now a new HEq congruence lemma generator that gives each hypothesis access to the proofs of previous hypotheses. This means that if you have an equality ⊢ ⟨a, x⟩ = ⟨b, y⟩ of sigma types, congr! turns this into goals ⊢ a = b and ⊢ a = b → HEq x y (note that congr! will also auto-introduce a = b for you in the second goal). This congruence lemma generator applies to more cases than the simp congruence lemma generator does.
congr! (and hence convert) are more careful about applying lemmas that don't force definitions to unfold. There were a number of cases in mathlib where the implementation of congr was being abused to unfold definitions.
With set_option trace.congr! true you can see what congr! sees when it is deciding on congruence lemmas.
There is also a bug fix in convert_to to do using 1 when there is no using clause, to match its documentation.

Note that congr! is more capable than congr at finding a way to equate left-hand sides and right-hand sides, so you will frequently need to limit its depth with a using clause. However, there is also a new heuristic to prevent considering unlikely-to-be-provable type equalities (controlled by the typeEqs option), which can help limit the depth automatically.

There is also a predefined configuration that you can invoke with, for example, convert (config := .unfoldSameFun) h, that causes it to behave more like congr, including using default transparency when unfolding.

61ca0ea8

Diff

@@ -40,10 +40,9 @@ theorem range_of_succ (f : ℕ → α) : {f 0} ∪ range (f ∘ succ) = range f
 theorem range_rec {α : Type _} (x : α) (f : ℕ → α → α) :
     (Set.range fun n => Nat.rec x f n : Set α) =
       {x} ∪ Set.range fun n => Nat.rec (f 0 x) (f ∘ succ) n := by
-  convert (range_of_succ (fun n => Nat.rec x f n : ℕ → α)).symm
+  convert (range_of_succ (fun n => Nat.rec x f n : ℕ → α)).symm using 4
   dsimp
-  apply congr_arg Set.range
-  ext n
+  rename_i n
   induction' n with n ihn
   · rfl
   · dsimp at ihn⊢

cf9386b5

chore: add source headers to ported theory files (#1094)

The script used to do this is included. The yaml file was obtained from https://raw.githubusercontent.com/wiki/leanprover-community/mathlib/mathlib4-port-status.md

f168625e

Diff

@@ -2,6 +2,11 @@
 Copyright (c) 2020 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
+
+! This file was ported from Lean 3 source module data.nat.set
+! leanprover-community/mathlib commit cf9386b56953fb40904843af98b7a80757bbe7f9
+! Please do not edit these lines, except to modify the commit id
+! if you have ported upstream changes.
 -/
 import Mathlib.Data.Set.Image

`data.nat.set` ⟷ `Mathlib.Data.Nat.Set`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 37

data.nat.set ⟷ Mathlib.Data.Nat.Set

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 37

`data.nat.set` ⟷ `Mathlib.Data.Nat.Set`