data.fin.fin2 | 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

c4658a64

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

448144f7

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,13 +2,10 @@
 Copyright (c) 2017 Mario Carneiro. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Mario Carneiro
-
-! This file was ported from Lean 3 source module data.fin.fin2
-! leanprover-community/mathlib commit 448144f7ae193a8990cb7473c9e9a01990f64ac7
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 
+#align_import data.fin.fin2 from "leanprover-community/mathlib"@"448144f7ae193a8990cb7473c9e9a01990f64ac7"
+
 /-!
 # Inductive type variant of `fin`

448144f7

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -158,7 +158,6 @@ def ofNat' : ∀ {n} (m) [IsLT m n], Fin2 n
 #align fin2.of_nat' Fin2.ofNat'
 -/
 
--- mathport name: «expr& »
 local prefix:arg "&" => ofNat'
 
 instance : Inhabited (Fin2 1) :=

448144f7

bump to nightly-2023-05-11-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/28b2a92f2996d28e580450863c130955de0ed398

66e23fb2

Diff

@@ -72,7 +72,7 @@ def elim0 {C : Fin2 0 → Sort u} : ∀ i : Fin2 0, C i :=
 /-- Converts a `fin2` into a natural. -/
 def toNat : ∀ {n}, Fin2 n → ℕ
   | _, @fz n => 0
-  | _, @fs n i => succ (to_nat i)
+  | _, @fs n i => succ (toNat i)
 #align fin2.to_nat Fin2.toNat
 -/

448144f7

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

c4658a64

chore: move Mathlib to v4.7.0-rc1 (#11162)

This is a very large PR, but it has been reviewed piecemeal already in PRs to the bump/v4.7.0 branch as we update to intermediate nightlies.

Co-authored-by: Scott Morrison <scott.morrison@gmail.com> Co-authored-by: Kyle Miller <kmill31415@gmail.com> Co-authored-by: damiano <adomani@gmail.com>

fa48894a

Diff

@@ -54,7 +54,7 @@ protected def cases' {n} {C : Fin2 (succ n) → Sort u} (H1 : C fz) (H2 : ∀ n,
 #align fin2.cases' Fin2.cases'
 
 /-- Ex falso. The dependent eliminator for the empty `Fin2 0` type. -/
-def elim0 {C : Fin2 0 → Sort u} : ∀ i : Fin2 0, C i := fun.
+def elim0 {C : Fin2 0 → Sort u} : ∀ i : Fin2 0, C i := nofun
 #align fin2.elim0 Fin2.elim0
 
 /-- Converts a `Fin2` into a natural. -/

c4658a64

chore: prepare Lean version bump with explicit simp (#10999)

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

38bce757

Diff

@@ -3,7 +3,6 @@ Copyright (c) 2017 Mario Carneiro. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Mario Carneiro
 -/
-import Std.Tactic.NoMatch
 import Mathlib.Init.Data.Nat.Notation
 import Mathlib.Mathport.Rename
 import Mathlib.Data.Fintype.Basic

c4658a64

feat: provide an instance of Fintype (Fin2 n) (#10805)

This enables use of the fin_cases tactic on premises i : Fin2 _

dd9c1eb3

Diff

@@ -6,6 +6,7 @@ Authors: Mario Carneiro
 import Std.Tactic.NoMatch
 import Mathlib.Init.Data.Nat.Notation
 import Mathlib.Mathport.Rename
+import Mathlib.Data.Fintype.Basic
 
 #align_import data.fin.fin2 from "leanprover-community/mathlib"@"c4658a649d216f57e99621708b09dcb3dcccbd23"
 
@@ -131,4 +132,11 @@ def ofNat' : ∀ {n} (m) [IsLT m n], Fin2 n
 instance : Inhabited (Fin2 1) :=
   ⟨fz⟩
 
+instance instFintype : ∀ n, Fintype (Fin2 n)
+  | 0   => ⟨∅, Fin2.elim0⟩
+  | n+1 =>
+    let ⟨elems, compl⟩ := instFintype n
+    { elems    := elems.map ⟨Fin2.fs, @fs.inj _⟩ |>.cons .fz (by simp)
+      complete := by rintro (_|i) <;> simp [compl] }
+
 end Fin2

c4658a64

feat: Linter that checks that Prop classes are Props (#6148)

930dd29d

Diff

@@ -107,7 +107,7 @@ def remapLeft {m n} (f : Fin2 m → Fin2 n) : ∀ k, Fin2 (m + k) → Fin2 (n +
 
 /-- This is a simple type class inference prover for proof obligations
   of the form `m < n` where `m n : ℕ`. -/
-class IsLT (m n : ℕ) where
+class IsLT (m n : ℕ) : Prop where
   /-- The unique field of `Fin2.IsLT`, a proof that `m < n`. -/
   h : m < n
 #align fin2.is_lt Fin2.IsLT
@@ -121,9 +121,9 @@ instance IsLT.succ (m n) [l : IsLT m n] : IsLT (succ m) (succ n) :=
 /-- Use type class inference to infer the boundedness proof, so that we can directly convert a
 `Nat` into a `Fin2 n`. This supports notation like `&1 : Fin 3`. -/
 def ofNat' : ∀ {n} (m) [IsLT m n], Fin2 n
-  | 0, _, ⟨h⟩ => absurd h (Nat.not_lt_zero _)
-  | succ _, 0, ⟨_⟩ => fz
-  | succ n, succ m, ⟨h⟩ => fs (@ofNat' n m ⟨lt_of_succ_lt_succ h⟩)
+  | 0, _, h => absurd h.h (Nat.not_lt_zero _)
+  | succ _, 0, _ => fz
+  | succ n, succ m, h => fs (@ofNat' n m ⟨lt_of_succ_lt_succ h.h⟩)
 #align fin2.of_nat' Fin2.ofNat'
 
 @[inherit_doc] local prefix:arg "&" => ofNat'

c4658a64

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,16 +2,13 @@
 Copyright (c) 2017 Mario Carneiro. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Mario Carneiro
-
-! This file was ported from Lean 3 source module data.fin.fin2
-! leanprover-community/mathlib commit c4658a649d216f57e99621708b09dcb3dcccbd23
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Std.Tactic.NoMatch
 import Mathlib.Init.Data.Nat.Notation
 import Mathlib.Mathport.Rename
 
+#align_import data.fin.fin2 from "leanprover-community/mathlib"@"c4658a649d216f57e99621708b09dcb3dcccbd23"
+
 /-!
 # Inductive type variant of `Fin`

c4658a64

chore: add missing #align statements (#1902)

This PR is the result of a slight variant on the following "algorithm"

take all mathlib 3 names, remove _ and make all uppercase letters into lowercase
take all mathlib 4 names, remove _ and make all uppercase letters into lowercase
look for matches, and create pairs (original_lean3_name, OriginalLean4Name)
for pairs that do not have an align statement:
- use Lean 4 to lookup the file + position of the Lean 4 name
- add an #align statement just before the next empty line
manually fix some tiny mistakes (e.g., empty lines in proofs might cause the #align statement to have been inserted too early)

b72bb858

Diff

@@ -10,6 +10,7 @@ Authors: Mario Carneiro
 -/
 import Std.Tactic.NoMatch
 import Mathlib.Init.Data.Nat.Notation
+import Mathlib.Mathport.Rename
 
 /-!
 # Inductive type variant of `Fin`
@@ -42,6 +43,7 @@ inductive Fin2 : ℕ → Type
   | fz {n} : Fin2 (succ n)
   /-- `n` as a member of `Fin (succ n)` -/
   | fs {n} : Fin2 n → Fin2 (succ n)
+#align fin2 Fin2
 
 namespace Fin2
 
@@ -52,30 +54,36 @@ protected def cases' {n} {C : Fin2 (succ n) → Sort u} (H1 : C fz) (H2 : ∀ n,
     ∀ i : Fin2 (succ n), C i
   | fz => H1
   | fs n => H2 n
+#align fin2.cases' Fin2.cases'
 
 /-- Ex falso. The dependent eliminator for the empty `Fin2 0` type. -/
 def elim0 {C : Fin2 0 → Sort u} : ∀ i : Fin2 0, C i := fun.
+#align fin2.elim0 Fin2.elim0
 
 /-- Converts a `Fin2` into a natural. -/
 def toNat : ∀ {n}, Fin2 n → ℕ
   | _, @fz _ => 0
   | _, @fs _ i => succ (toNat i)
+#align fin2.to_nat Fin2.toNat
 
 /-- Converts a natural into a `Fin2` if it is in range -/
 def optOfNat : ∀ {n}, ℕ → Option (Fin2 n)
   | 0, _ => none
   | succ _, 0 => some fz
   | succ m, succ k => fs <$> @optOfNat m k
+#align fin2.opt_of_nat Fin2.optOfNat
 
 /-- `i + k : Fin2 (n + k)` when `i : Fin2 n` and `k : ℕ` -/
 def add {n} (i : Fin2 n) : ∀ k, Fin2 (n + k)
   | 0 => i
   | succ k => fs (add i k)
+#align fin2.add Fin2.add
 
 /-- `left k` is the embedding `Fin2 n → Fin2 (k + n)` -/
 def left (k) : ∀ {n}, Fin2 n → Fin2 (k + n)
   | _, @fz _ => fz
   | _, @fs _ i => fs (left k i)
+#align fin2.left Fin2.left
 
 /-- `insertPerm a` is a permutation of `Fin2 n` with the following properties:
   * `insertPerm a i = i+1` if `i < a`
@@ -89,6 +97,7 @@ def insertPerm : ∀ {n}, Fin2 n → Fin2 n → Fin2 n
     match insertPerm i j with
     | fz => fz
     | fs k => fs (fs k)
+#align fin2.insert_perm Fin2.insertPerm
 
 /-- `remapLeft f k : Fin2 (m + k) → Fin2 (n + k)` applies the function
   `f : Fin2 m → Fin2 n` to inputs less than `m`, and leaves the right part
@@ -97,12 +106,14 @@ def remapLeft {m n} (f : Fin2 m → Fin2 n) : ∀ k, Fin2 (m + k) → Fin2 (n +
   | 0, i => f i
   | succ _, @fz _ => fz
   | succ _, @fs _ i => fs (remapLeft f _ i)
+#align fin2.remap_left Fin2.remapLeft
 
 /-- This is a simple type class inference prover for proof obligations
   of the form `m < n` where `m n : ℕ`. -/
 class IsLT (m n : ℕ) where
   /-- The unique field of `Fin2.IsLT`, a proof that `m < n`. -/
   h : m < n
+#align fin2.is_lt Fin2.IsLT
 
 instance IsLT.zero (n) : IsLT 0 (succ n) :=
   ⟨succ_pos _⟩
@@ -116,6 +127,7 @@ def ofNat' : ∀ {n} (m) [IsLT m n], Fin2 n
   | 0, _, ⟨h⟩ => absurd h (Nat.not_lt_zero _)
   | succ _, 0, ⟨_⟩ => fz
   | succ n, succ m, ⟨h⟩ => fs (@ofNat' n m ⟨lt_of_succ_lt_succ h⟩)
+#align fin2.of_nat' Fin2.ofNat'
 
 @[inherit_doc] local prefix:arg "&" => ofNat'

c4658a64

chore: fix more casing errors per naming scheme (#1232)

I've avoided anything under Tactic or test.

In correcting the names, I found Option.isNone_iff_eq_none duplicated between Std and Mathlib, so the Mathlib one has been removed.

Co-authored-by: Reid Barton <rwbarton@gmail.com>

31a56f75

Diff

@@ -23,7 +23,7 @@ equalities.
 * `Fin2 n`: Inductive type variant of `Fin n`. `fz` corresponds to `0` and `fs n` corresponds to
   `n`.
 * `Fin2.toNat`, `Fin2.optOfNat`, `Fin2.ofNat'`: Conversions to and from `ℕ`. `ofNat' m` takes a
-  proof that `m < n` through the class `Fin2.IsLt`.
+  proof that `m < n` through the class `Fin2.IsLT`.
 * `Fin2.add k`: Takes `i : Fin2 n` to `i + k : Fin2 (n + k)`.
 * `Fin2.left`: Embeds `Fin2 n` into `Fin2 (n + k)`.
 * `Fin2.insertPerm a`: Permutation of `Fin2 n` which cycles `0, ..., a - 1` and leaves
@@ -100,19 +100,19 @@ def remapLeft {m n} (f : Fin2 m → Fin2 n) : ∀ k, Fin2 (m + k) → Fin2 (n +
 
 /-- This is a simple type class inference prover for proof obligations
   of the form `m < n` where `m n : ℕ`. -/
-class IsLt (m n : ℕ) where
-  /-- The unique field of `Fin2.IsLt`, a proof that `m < n`. -/
+class IsLT (m n : ℕ) where
+  /-- The unique field of `Fin2.IsLT`, a proof that `m < n`. -/
   h : m < n
 
-instance IsLt.zero (n) : IsLt 0 (succ n) :=
+instance IsLT.zero (n) : IsLT 0 (succ n) :=
   ⟨succ_pos _⟩
 
-instance IsLt.succ (m n) [l : IsLt m n] : IsLt (succ m) (succ n) :=
+instance IsLT.succ (m n) [l : IsLT m n] : IsLT (succ m) (succ n) :=
   ⟨succ_lt_succ l.h⟩
 
 /-- Use type class inference to infer the boundedness proof, so that we can directly convert a
 `Nat` into a `Fin2 n`. This supports notation like `&1 : Fin 3`. -/
-def ofNat' : ∀ {n} (m) [IsLt m n], Fin2 n
+def ofNat' : ∀ {n} (m) [IsLT m n], Fin2 n
   | 0, _, ⟨h⟩ => absurd h (Nat.not_lt_zero _)
   | succ _, 0, ⟨_⟩ => fz
   | succ n, succ m, ⟨h⟩ => fs (@ofNat' n m ⟨lt_of_succ_lt_succ h⟩)

c4658a64

chore: fix casing per naming scheme (#1183)

Fix a lot of wrong casing mostly in the docstrings but also sometimes in def/theorem names. E.g. fin 2 --> Fin 2, add_monoid_hom --> AddMonoidHom

Remove \n from to_additive docstrings that were inserted by mathport.

Move files and directories with Gcd and Smul to GCD and SMul

71723d8b

Diff

@@ -28,7 +28,7 @@ equalities.
 * `Fin2.left`: Embeds `Fin2 n` into `Fin2 (n + k)`.
 * `Fin2.insertPerm a`: Permutation of `Fin2 n` which cycles `0, ..., a - 1` and leaves
   `a, ..., n - 1` unchanged.
-* `Fin2.remapLeft f`: Function `Fin2 (m + k) → Fin2 (n + k)` by applying `f : fin m → fin n` to
+* `Fin2.remapLeft f`: Function `Fin2 (m + k) → Fin2 (n + k)` by applying `f : Fin m → Fin n` to
   `0, ..., m - 1` and sending `m + i` to `n + i`.
 -/
 
@@ -36,16 +36,16 @@ open Nat
 
 universe u
 
-/-- An alternate definition of `fin n` defined as an inductive type instead of a subtype of `ℕ`. -/
+/-- An alternate definition of `Fin n` defined as an inductive type instead of a subtype of `ℕ`. -/
 inductive Fin2 : ℕ → Type
-  /-- `0` as a member of `fin (succ n)` (`fin 0` is empty) -/
+  /-- `0` as a member of `Fin (succ n)` (`Fin 0` is empty) -/
   | fz {n} : Fin2 (succ n)
-  /-- `n` as a member of `fin (succ n)` -/
+  /-- `n` as a member of `Fin (succ n)` -/
   | fs {n} : Fin2 n → Fin2 (succ n)
 
 namespace Fin2
 
-/-- Define a dependent function on `fin2 (succ n)` by giving its value at
+/-- Define a dependent function on `Fin2 (succ n)` by giving its value at
 zero (`H1`) and by giving a dependent function on the rest (`H2`). -/
 @[elab_as_elim]
 protected def cases' {n} {C : Fin2 (succ n) → Sort u} (H1 : C fz) (H2 : ∀ n, C (fs n)) :
@@ -53,34 +53,34 @@ protected def cases' {n} {C : Fin2 (succ n) → Sort u} (H1 : C fz) (H2 : ∀ n,
   | fz => H1
   | fs n => H2 n
 
-/-- Ex falso. The dependent eliminator for the empty `fin2 0` type. -/
+/-- Ex falso. The dependent eliminator for the empty `Fin2 0` type. -/
 def elim0 {C : Fin2 0 → Sort u} : ∀ i : Fin2 0, C i := fun.
 
-/-- Converts a `fin2` into a natural. -/
+/-- Converts a `Fin2` into a natural. -/
 def toNat : ∀ {n}, Fin2 n → ℕ
   | _, @fz _ => 0
   | _, @fs _ i => succ (toNat i)
 
-/-- Converts a natural into a `fin2` if it is in range -/
+/-- Converts a natural into a `Fin2` if it is in range -/
 def optOfNat : ∀ {n}, ℕ → Option (Fin2 n)
   | 0, _ => none
   | succ _, 0 => some fz
   | succ m, succ k => fs <$> @optOfNat m k
 
-/-- `i + k : fin2 (n + k)` when `i : fin2 n` and `k : ℕ` -/
+/-- `i + k : Fin2 (n + k)` when `i : Fin2 n` and `k : ℕ` -/
 def add {n} (i : Fin2 n) : ∀ k, Fin2 (n + k)
   | 0 => i
   | succ k => fs (add i k)
 
-/-- `left k` is the embedding `fin2 n → fin2 (k + n)` -/
+/-- `left k` is the embedding `Fin2 n → Fin2 (k + n)` -/
 def left (k) : ∀ {n}, Fin2 n → Fin2 (k + n)
   | _, @fz _ => fz
   | _, @fs _ i => fs (left k i)
 
-/-- `insert_perm a` is a permutation of `fin2 n` with the following properties:
-  * `insert_perm a i = i+1` if `i < a`
-  * `insert_perm a a = 0`
-  * `insert_perm a i = i` if `i > a` -/
+/-- `insertPerm a` is a permutation of `Fin2 n` with the following properties:
+  * `insertPerm a i = i+1` if `i < a`
+  * `insertPerm a a = 0`
+  * `insertPerm a i = i` if `i > a` -/
 def insertPerm : ∀ {n}, Fin2 n → Fin2 n → Fin2 n
   | _, @fz _, @fz _ => fz
   | _, @fz _, @fs _ j => fs j
@@ -90,9 +90,9 @@ def insertPerm : ∀ {n}, Fin2 n → Fin2 n → Fin2 n
     | fz => fz
     | fs k => fs (fs k)
 
-/-- `remap_left f k : fin2 (m + k) → fin2 (n + k)` applies the function
-  `f : fin2 m → fin2 n` to inputs less than `m`, and leaves the right part
-  on the right (that is, `remap_left f k (m + i) = n + i`). -/
+/-- `remapLeft f k : Fin2 (m + k) → Fin2 (n + k)` applies the function
+  `f : Fin2 m → Fin2 n` to inputs less than `m`, and leaves the right part
+  on the right (that is, `remapLeft f k (m + i) = n + i`). -/
 def remapLeft {m n} (f : Fin2 m → Fin2 n) : ∀ k, Fin2 (m + k) → Fin2 (n + k)
   | 0, i => f i
   | succ _, @fz _ => fz
@@ -111,7 +111,7 @@ instance IsLt.succ (m n) [l : IsLt m n] : IsLt (succ m) (succ n) :=
   ⟨succ_lt_succ l.h⟩
 
 /-- Use type class inference to infer the boundedness proof, so that we can directly convert a
-`nat` into a `fin2 n`. This supports notation like `&1 : fin 3`. -/
+`Nat` into a `Fin2 n`. This supports notation like `&1 : Fin 3`. -/
 def ofNat' : ∀ {n} (m) [IsLt m n], Fin2 n
   | 0, _, ⟨h⟩ => absurd h (Nat.not_lt_zero _)
   | succ _, 0, ⟨_⟩ => fz

c4658a64

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) 2017 Mario Carneiro. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Mario Carneiro
+
+! This file was ported from Lean 3 source module data.fin.fin2
+! leanprover-community/mathlib commit c4658a649d216f57e99621708b09dcb3dcccbd23
+! Please do not edit these lines, except to modify the commit id
+! if you have ported upstream changes.
 -/
 import Std.Tactic.NoMatch
 import Mathlib.Init.Data.Nat.Notation

`data.fin.fin2` ⟷ `Mathlib.Data.Fin.Fin2`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies

data.fin.fin2 ⟷ Mathlib.Data.Fin.Fin2

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies

`data.fin.fin2` ⟷ `Mathlib.Data.Fin.Fin2`