data.vector3 | 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

3d7987cd

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

fd4551cf

bump to nightly-2024-03-17-08

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

22f01ce4

Diff

@@ -359,8 +359,8 @@ theorem vectorAllP_iff_forall (p : α → Prop) (v : Vector3 α n) : VectorAllP
     refine' fun n a v IH =>
       (and_congr_right fun _ => IH).trans
         ⟨fun ⟨pa, h⟩ i => by refine' i.cases' _ _; exacts [pa, h], fun h => ⟨_, fun i => _⟩⟩
-    · have h0 := h fz; simp at h0 ; exact h0
-    · have hs := h (fs i); simp at hs ; exact hs
+    · have h0 := h fz; simp at h0; exact h0
+    · have hs := h (fs i); simp at hs; exact hs
 #align vector_allp_iff_forall vectorAllP_iff_forall
 -/

fd4551cf

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) 2017 Mario Carneiro. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Mario Carneiro
 -/
-import Mathbin.Data.Fin.Fin2
-import Mathbin.Tactic.Localized
+import Data.Fin.Fin2
+import Tactic.Localized
 
 #align_import data.vector3 from "leanprover-community/mathlib"@"fd4551cfe4b7484b81c2c9ba3405edae27659676"

fd4551cf

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) 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.vector3
-! leanprover-community/mathlib commit fd4551cfe4b7484b81c2c9ba3405edae27659676
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Data.Fin.Fin2
 import Mathbin.Tactic.Localized
 
+#align_import data.vector3 from "leanprover-community/mathlib"@"fd4551cfe4b7484b81c2c9ba3405edae27659676"
+
 /-!
 # Alternate definition of `vector` in terms of `fin2`

fd4551cf

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -58,13 +58,11 @@ def cons (a : α) (v : Vector3 α n) : Vector3 α (succ n) := fun i => by refine
 #align vector3.cons Vector3.cons
 -/
 
--- mathport name: vector.list
 /- We do not want to make the following notation global, because then these expressions will be
 overloaded, and only the expected type will be able to disambiguate the meaning. Worse: Lean will
 try to insert a coercion from `vector3 α _` to `list α`, if a list is expected. -/
 scoped notation3"["(l ", "* => foldr (h t => Vector3.cons h t) Vector3.nil)"]" => l
 
--- mathport name: vector.cons
 notation a "::" b => cons a b
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
@@ -141,10 +139,12 @@ def consElim {C : Vector3 α (succ n) → Sort u} (H : ∀ (a : α) (t : Vector3
 -/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print Vector3.consElim_cons /-
 @[simp]
 theorem consElim_cons {C H a t} : @consElim α n C H (a::t) = H a t :=
   rfl
 #align vector3.cons_elim_cons Vector3.consElim_cons
+-/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
 #print Vector3.recOn /-
@@ -156,17 +156,21 @@ protected def recOn {C : ∀ {n}, Vector3 α n → Sort u} {n} (v : Vector3 α n
 #align vector3.rec_on Vector3.recOn
 -/
 
+#print Vector3.recOn_nil /-
 @[simp]
 theorem recOn_nil {C H0 Hs} : @Vector3.recOn α (@C) 0 [] H0 @Hs = H0 :=
   rfl
 #align vector3.rec_on_nil Vector3.recOn_nil
+-/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print Vector3.recOn_cons /-
 @[simp]
 theorem recOn_cons {C H0 Hs n a v} :
     @Vector3.recOn α (@C) (succ n) (a::v) H0 @Hs = Hs a v (@Vector3.recOn α (@C) n v H0 @Hs) :=
   rfl
 #align vector3.rec_on_cons Vector3.recOn_cons
+-/
 
 #print Vector3.append /-
 /-- Append two vectors -/
@@ -176,7 +180,6 @@ def append (v : Vector3 α m) (w : Vector3 α n) : Vector3 α (n + m) :=
 #align vector3.append Vector3.append
 -/
 
--- mathport name: «expr +-+ »
 local infixl:65 " +-+ " => Vector3.append
 
 #print Vector3.append_nil /-

fd4551cf

bump to nightly-2023-06-11-03

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

6960a941

Diff

@@ -4,7 +4,7 @@ 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.vector3
-! leanprover-community/mathlib commit 3d7987cda72abc473c7cdbbb075170e9ac620042
+! leanprover-community/mathlib commit fd4551cfe4b7484b81c2c9ba3405edae27659676
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -14,6 +14,9 @@ import Mathbin.Tactic.Localized
 /-!
 # Alternate definition of `vector` in terms of `fin2`
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 This file provides a locale `vector3` which overrides the `[a, b, c]` notation to create a `vector3`
 instead of a `list`.

3d7987cd

bump to nightly-2023-06-09-09

mathlib commit https://github.com/leanprover-community/mathlib/commit/7e5137f579de09a059a5ce98f364a04e221aabf0

6e005415

Diff

@@ -27,27 +27,33 @@ universe u
 
 variable {α : Type _} {m n : ℕ}
 
+#print Vector3 /-
 /-- Alternate definition of `vector` based on `fin2`. -/
 def Vector3 (α : Type u) (n : ℕ) : Type u :=
   Fin2 n → α
 #align vector3 Vector3
+-/
 
 instance [Inhabited α] : Inhabited (Vector3 α n) :=
   Pi.inhabited _
 
 namespace Vector3
 
+#print Vector3.nil /-
 /-- The empty vector -/
 @[match_pattern]
 def nil : Vector3 α 0 :=
   fun.
 #align vector3.nil Vector3.nil
+-/
 
+#print Vector3.cons /-
 /-- The vector cons operation -/
 @[match_pattern]
 def cons (a : α) (v : Vector3 α n) : Vector3 α (succ n) := fun i => by refine' i.cases' _ _;
   exact a; exact v
 #align vector3.cons Vector3.cons
+-/
 
 -- mathport name: vector.list
 /- We do not want to make the following notation global, because then these expressions will be
@@ -59,57 +65,77 @@ scoped notation3"["(l ", "* => foldr (h t => Vector3.cons h t) Vector3.nil)"]" =
 notation a "::" b => cons a b
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print Vector3.cons_fz /-
 @[simp]
 theorem cons_fz (a : α) (v : Vector3 α n) : (a::v) fz = a :=
   rfl
 #align vector3.cons_fz Vector3.cons_fz
+-/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print Vector3.cons_fs /-
 @[simp]
 theorem cons_fs (a : α) (v : Vector3 α n) (i) : (a::v) (fs i) = v i :=
   rfl
 #align vector3.cons_fs Vector3.cons_fs
+-/
 
+#print Vector3.nth /-
 /-- Get the `i`th element of a vector -/
 @[reducible]
 def nth (i : Fin2 n) (v : Vector3 α n) : α :=
   v i
 #align vector3.nth Vector3.nth
+-/
 
+#print Vector3.ofFn /-
 /-- Construct a vector from a function on `fin2`. -/
 @[reducible]
 def ofFn (f : Fin2 n → α) : Vector3 α n :=
   f
 #align vector3.of_fn Vector3.ofFn
+-/
 
+#print Vector3.head /-
 /-- Get the head of a nonempty vector. -/
 def head (v : Vector3 α (succ n)) : α :=
   v fz
 #align vector3.head Vector3.head
+-/
 
+#print Vector3.tail /-
 /-- Get the tail of a nonempty vector. -/
 def tail (v : Vector3 α (succ n)) : Vector3 α n := fun i => v (fs i)
 #align vector3.tail Vector3.tail
+-/
 
+#print Vector3.eq_nil /-
 theorem eq_nil (v : Vector3 α 0) : v = [] :=
   funext fun i => nomatch i
 #align vector3.eq_nil Vector3.eq_nil
+-/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print Vector3.cons_head_tail /-
 theorem cons_head_tail (v : Vector3 α (succ n)) : (head v::tail v) = v :=
   funext fun i => Fin2.cases' rfl (fun _ => rfl) i
 #align vector3.cons_head_tail Vector3.cons_head_tail
+-/
 
+#print Vector3.nilElim /-
 /-- Eliminator for an empty vector. -/
 def nilElim {C : Vector3 α 0 → Sort u} (H : C []) (v : Vector3 α 0) : C v := by
   rw [eq_nil v] <;> apply H
 #align vector3.nil_elim Vector3.nilElim
+-/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print Vector3.consElim /-
 /-- Recursion principle for a nonempty vector. -/
 def consElim {C : Vector3 α (succ n) → Sort u} (H : ∀ (a : α) (t : Vector3 α n), C (a::t))
     (v : Vector3 α (succ n)) : C v := by rw [← cons_head_tail v] <;> apply H
 #align vector3.cons_elim Vector3.consElim
+-/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
 @[simp]
@@ -118,12 +144,14 @@ theorem consElim_cons {C H a t} : @consElim α n C H (a::t) = H a t :=
 #align vector3.cons_elim_cons Vector3.consElim_cons
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print Vector3.recOn /-
 /-- Recursion principle with the vector as first argument. -/
 @[elab_as_elim]
 protected def recOn {C : ∀ {n}, Vector3 α n → Sort u} {n} (v : Vector3 α n) (H0 : C [])
     (Hs : ∀ {n} (a) (w : Vector3 α n), C w → C (a::w)) : C v :=
   Nat.recOn n (fun v => v.nilElim H0) (fun n IH v => v.consElim fun a t => Hs _ _ (IH _)) v
 #align vector3.rec_on Vector3.recOn
+-/
 
 @[simp]
 theorem recOn_nil {C H0 Hs} : @Vector3.recOn α (@C) 0 [] H0 @Hs = H0 :=
@@ -137,55 +165,70 @@ theorem recOn_cons {C H0 Hs n a v} :
   rfl
 #align vector3.rec_on_cons Vector3.recOn_cons
 
+#print Vector3.append /-
 /-- Append two vectors -/
 def append (v : Vector3 α m) (w : Vector3 α n) : Vector3 α (n + m) :=
   Nat.recOn m (fun _ => w)
     (fun m IH v => v.consElim fun a t => @Fin2.cases' (n + m) (fun _ => α) a (IH t)) v
 #align vector3.append Vector3.append
+-/
 
 -- mathport name: «expr +-+ »
 local infixl:65 " +-+ " => Vector3.append
 
+#print Vector3.append_nil /-
 @[simp]
 theorem append_nil (w : Vector3 α n) : [] +-+ w = w :=
   rfl
 #align vector3.append_nil Vector3.append_nil
+-/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print Vector3.append_cons /-
 @[simp]
 theorem append_cons (a : α) (v : Vector3 α m) (w : Vector3 α n) : (a::v) +-+ w = a::v +-+ w :=
   rfl
 #align vector3.append_cons Vector3.append_cons
+-/
 
+#print Vector3.append_left /-
 @[simp]
 theorem append_left :
     ∀ {m} (i : Fin2 m) (v : Vector3 α m) {n} (w : Vector3 α n), (v +-+ w) (left n i) = v i
   | _, @fz m, v, n, w => v.consElim fun a t => by simp [*, left]
   | _, @fs m i, v, n, w => v.consElim fun a t => by simp [*, left]
 #align vector3.append_left Vector3.append_left
+-/
 
+#print Vector3.append_add /-
 @[simp]
 theorem append_add :
     ∀ {m} (v : Vector3 α m) {n} (w : Vector3 α n) (i : Fin2 n), (v +-+ w) (add i m) = w i
   | 0, v, n, w, i => rfl
   | succ m, v, n, w, i => v.consElim fun a t => by simp [*, add]
 #align vector3.append_add Vector3.append_add
+-/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print Vector3.insert /-
 /-- Insert `a` into `v` at index `i`. -/
 def insert (a : α) (v : Vector3 α n) (i : Fin2 (succ n)) : Vector3 α (succ n) := fun j =>
   (a::v) (insertPerm i j)
 #align vector3.insert Vector3.insert
+-/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print Vector3.insert_fz /-
 @[simp]
 theorem insert_fz (a : α) (v : Vector3 α n) : insert a v fz = a::v := by
   refine' funext fun j => j.cases' _ _ <;> intros <;> rfl
 #align vector3.insert_fz Vector3.insert_fz
+-/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print Vector3.insert_fs /-
 @[simp]
 theorem insert_fs (a : α) (b : α) (v : Vector3 α n) (i : Fin2 (succ n)) :
     insert a (b::v) (fs i) = b::insert a v i :=
@@ -193,9 +236,11 @@ theorem insert_fs (a : α) (b : α) (v : Vector3 α n) (i : Fin2 (succ n)) :
     refine' j.cases' _ fun j => _ <;> simp [insert, insert_perm]
     refine' Fin2.cases' _ _ (insert_perm i j) <;> simp [insert_perm]
 #align vector3.insert_fs Vector3.insert_fs
+-/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print Vector3.append_insert /-
 theorem append_insert (a : α) (t : Vector3 α m) (v : Vector3 α n) (i : Fin2 (succ n))
     (e : succ n + m = succ (n + m)) :
     insert a (t +-+ v) (Eq.recOn e (i.add m)) = Eq.recOn e (t +-+ insert a v i) :=
@@ -211,6 +256,7 @@ theorem append_insert (a : α) (t : Vector3 α m) (v : Vector3 α n) (i : Fin2 (
         Eq.recOn (congr_arg succ e') (fs (i.add k)))]
   simp; rw [IH]; exact Eq.drecOn e' rfl
 #align vector3.append_insert Vector3.append_insert
+-/
 
 end Vector3
 
@@ -221,67 +267,88 @@ open Vector3
 open scoped Vector3
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print VectorEx /-
 /-- "Curried" exists, i.e. `∃ x₁ ... xₙ, f [x₁, ..., xₙ]`. -/
 def VectorEx : ∀ k, (Vector3 α k → Prop) → Prop
   | 0, f => f []
   | succ k, f => ∃ x : α, VectorEx k fun v => f (x::v)
 #align vector_ex VectorEx
+-/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print VectorAll /-
 /-- "Curried" forall, i.e. `∀ x₁ ... xₙ, f [x₁, ..., xₙ]`. -/
 def VectorAll : ∀ k, (Vector3 α k → Prop) → Prop
   | 0, f => f []
   | succ k, f => ∀ x : α, VectorAll k fun v => f (x::v)
 #align vector_all VectorAll
+-/
 
+#print exists_vector_zero /-
 theorem exists_vector_zero (f : Vector3 α 0 → Prop) : Exists f ↔ f [] :=
   ⟨fun ⟨v, fv⟩ => by rw [← eq_nil v] <;> exact fv, fun f0 => ⟨[], f0⟩⟩
 #align exists_vector_zero exists_vector_zero
+-/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print exists_vector_succ /-
 theorem exists_vector_succ (f : Vector3 α (succ n) → Prop) : Exists f ↔ ∃ x v, f (x::v) :=
   ⟨fun ⟨v, fv⟩ => ⟨_, _, by rw [cons_head_tail v] <;> exact fv⟩, fun ⟨x, v, fxv⟩ => ⟨_, fxv⟩⟩
 #align exists_vector_succ exists_vector_succ
+-/
 
+#print vectorEx_iff_exists /-
 theorem vectorEx_iff_exists : ∀ {n} (f : Vector3 α n → Prop), VectorEx n f ↔ Exists f
   | 0, f => (exists_vector_zero f).symm
   | succ n, f => Iff.trans (exists_congr fun x => vectorEx_iff_exists _) (exists_vector_succ f).symm
 #align vector_ex_iff_exists vectorEx_iff_exists
+-/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print vectorAll_iff_forall /-
 theorem vectorAll_iff_forall : ∀ {n} (f : Vector3 α n → Prop), VectorAll n f ↔ ∀ v, f v
   | 0, f => ⟨fun f0 v => v.nilElim f0, fun al => al []⟩
   | succ n, f =>
     (forall_congr' fun x => vectorAll_iff_forall fun v => f (x::v)).trans
       ⟨fun al v => v.consElim al, fun al x v => al (x::v)⟩
 #align vector_all_iff_forall vectorAll_iff_forall
+-/
 
+#print VectorAllP /-
 /-- `vector_allp p v` is equivalent to `∀ i, p (v i)`, but unfolds directly to a conjunction,
   i.e. `vector_allp p [0, 1, 2] = p 0 ∧ p 1 ∧ p 2`. -/
-def VectorAllp (p : α → Prop) (v : Vector3 α n) : Prop :=
+def VectorAllP (p : α → Prop) (v : Vector3 α n) : Prop :=
   Vector3.recOn v True fun n a v IH =>
     @Vector3.recOn _ (fun n v => Prop) _ v (p a) fun n b v' _ => p a ∧ IH
-#align vector_allp VectorAllp
+#align vector_allp VectorAllP
+-/
 
+#print vectorAllP_nil /-
 @[simp]
-theorem vectorAllp_nil (p : α → Prop) : VectorAllp p [] = True :=
+theorem vectorAllP_nil (p : α → Prop) : VectorAllP p [] = True :=
   rfl
-#align vector_allp_nil vectorAllp_nil
+#align vector_allp_nil vectorAllP_nil
+-/
 
+#print vectorAllP_singleton /-
 @[simp]
-theorem vectorAllp_singleton (p : α → Prop) (x : α) : VectorAllp p [x] = p x :=
+theorem vectorAllP_singleton (p : α → Prop) (x : α) : VectorAllP p [x] = p x :=
   rfl
-#align vector_allp_singleton vectorAllp_singleton
+#align vector_allp_singleton vectorAllP_singleton
+-/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
+#print vectorAllP_cons /-
 @[simp]
-theorem vectorAllp_cons (p : α → Prop) (x : α) (v : Vector3 α n) :
-    VectorAllp p (x::v) ↔ p x ∧ VectorAllp p v :=
+theorem vectorAllP_cons (p : α → Prop) (x : α) (v : Vector3 α n) :
+    VectorAllP p (x::v) ↔ p x ∧ VectorAllP p v :=
   Vector3.recOn v (and_true_iff _).symm fun n a v IH => Iff.rfl
-#align vector_allp_cons vectorAllp_cons
+#align vector_allp_cons vectorAllP_cons
+-/
 
-theorem vectorAllp_iff_forall (p : α → Prop) (v : Vector3 α n) : VectorAllp p v ↔ ∀ i, p (v i) :=
+#print vectorAllP_iff_forall /-
+theorem vectorAllP_iff_forall (p : α → Prop) (v : Vector3 α n) : VectorAllP p v ↔ ∀ i, p (v i) :=
   by
   refine' v.rec_on _ _
   · exact ⟨fun _ => Fin2.elim0, fun _ => trivial⟩
@@ -291,12 +358,15 @@ theorem vectorAllp_iff_forall (p : α → Prop) (v : Vector3 α n) : VectorAllp
         ⟨fun ⟨pa, h⟩ i => by refine' i.cases' _ _; exacts [pa, h], fun h => ⟨_, fun i => _⟩⟩
     · have h0 := h fz; simp at h0 ; exact h0
     · have hs := h (fs i); simp at hs ; exact hs
-#align vector_allp_iff_forall vectorAllp_iff_forall
+#align vector_allp_iff_forall vectorAllP_iff_forall
+-/
 
-theorem VectorAllp.imp {p q : α → Prop} (h : ∀ x, p x → q x) {v : Vector3 α n}
-    (al : VectorAllp p v) : VectorAllp q v :=
-  (vectorAllp_iff_forall _ _).2 fun i => h _ <| (vectorAllp_iff_forall _ _).1 al _
-#align vector_allp.imp VectorAllp.imp
+#print VectorAllP.imp /-
+theorem VectorAllP.imp {p q : α → Prop} (h : ∀ x, p x → q x) {v : Vector3 α n}
+    (al : VectorAllP p v) : VectorAllP q v :=
+  (vectorAllP_iff_forall _ _).2 fun i => h _ <| (vectorAllP_iff_forall _ _).1 al _
+#align vector_allp.imp VectorAllP.imp
+-/
 
 end Vector3

3d7987cd

bump to nightly-2023-06-04-18

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

3fb4268b

Diff

@@ -53,7 +53,7 @@ def cons (a : α) (v : Vector3 α n) : Vector3 α (succ n) := fun i => by refine
 /- We do not want to make the following notation global, because then these expressions will be
 overloaded, and only the expected type will be able to disambiguate the meaning. Worse: Lean will
 try to insert a coercion from `vector3 α _` to `list α`, if a list is expected. -/
-scoped notation3"["(l", "* => foldr (h t => Vector3.cons h t) Vector3.nil)"]" => l
+scoped notation3"["(l ", "* => foldr (h t => Vector3.cons h t) Vector3.nil)"]" => l
 
 -- mathport name: vector.cons
 notation a "::" b => cons a b

3d7987cd

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -288,9 +288,9 @@ theorem vectorAllp_iff_forall (p : α → Prop) (v : Vector3 α n) : VectorAllp
   · simp;
     refine' fun n a v IH =>
       (and_congr_right fun _ => IH).trans
-        ⟨fun ⟨pa, h⟩ i => by refine' i.cases' _ _; exacts[pa, h], fun h => ⟨_, fun i => _⟩⟩
-    · have h0 := h fz; simp at h0; exact h0
-    · have hs := h (fs i); simp at hs; exact hs
+        ⟨fun ⟨pa, h⟩ i => by refine' i.cases' _ _; exacts [pa, h], fun h => ⟨_, fun i => _⟩⟩
+    · have h0 := h fz; simp at h0 ; exact h0
+    · have hs := h (fs i); simp at hs ; exact hs
 #align vector_allp_iff_forall vectorAllp_iff_forall
 
 theorem VectorAllp.imp {p q : α → Prop} (h : ∀ x, p x → q x) {v : Vector3 α n}

3d7987cd

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -218,7 +218,7 @@ section Vector3
 
 open Vector3
 
-open Vector3
+open scoped Vector3
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:177:8: unsupported: ambiguous notation -/
 /-- "Curried" exists, i.e. `∃ x₁ ... xₙ, f [x₁, ..., xₙ]`. -/

3d7987cd

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -45,11 +45,8 @@ def nil : Vector3 α 0 :=
 
 /-- The vector cons operation -/
 @[match_pattern]
-def cons (a : α) (v : Vector3 α n) : Vector3 α (succ n) := fun i =>
-  by
-  refine' i.cases' _ _
-  exact a
-  exact v
+def cons (a : α) (v : Vector3 α n) : Vector3 α (succ n) := fun i => by refine' i.cases' _ _;
+  exact a; exact v
 #align vector3.cons Vector3.cons
 
 -- mathport name: vector.list
@@ -288,18 +285,12 @@ theorem vectorAllp_iff_forall (p : α → Prop) (v : Vector3 α n) : VectorAllp
   by
   refine' v.rec_on _ _
   · exact ⟨fun _ => Fin2.elim0, fun _ => trivial⟩
-  · simp
+  · simp;
     refine' fun n a v IH =>
       (and_congr_right fun _ => IH).trans
-        ⟨fun ⟨pa, h⟩ i => by
-          refine' i.cases' _ _
-          exacts[pa, h], fun h => ⟨_, fun i => _⟩⟩
-    · have h0 := h fz
-      simp at h0
-      exact h0
-    · have hs := h (fs i)
-      simp at hs
-      exact hs
+        ⟨fun ⟨pa, h⟩ i => by refine' i.cases' _ _; exacts[pa, h], fun h => ⟨_, fun i => _⟩⟩
+    · have h0 := h fz; simp at h0; exact h0
+    · have hs := h (fs i); simp at hs; exact hs
 #align vector_allp_iff_forall vectorAllp_iff_forall
 
 theorem VectorAllp.imp {p q : α → Prop} (h : ∀ x, p x → q x) {v : Vector3 α n}

3d7987cd

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

3d7987cd

chore: adapt to multiple goal linter 1 (#12338)

A PR accompanying #12339.

Zulip discussion

45f93f3f

Diff

@@ -45,8 +45,8 @@ def nil : Vector3 α 0 :=
 @[match_pattern]
 def cons (a : α) (v : Vector3 α n) : Vector3 α (succ n) := fun i => by
   refine' i.cases' _ _
-  exact a
-  exact v
+  · exact a
+  · exact v
 #align vector3.cons Vector3.cons
 
 section
@@ -203,7 +203,8 @@ theorem insert_fs (a : α) (b : α) (v : Vector3 α n) (i : Fin2 (succ n)) :
 theorem append_insert (a : α) (t : Vector3 α m) (v : Vector3 α n) (i : Fin2 (succ n))
     (e : succ n + m = succ (n + m)) :
     insert a (t +-+ v) (Eq.recOn e (i.add m)) = Eq.recOn e (t +-+ insert a v i) := by
-  refine' Vector3.recOn t (fun e => _) (@fun k b t IH _ => _) e; rfl
+  refine' Vector3.recOn t (fun e => _) (@fun k b t IH _ => _) e
+  · rfl
   have e' := succ_add n k
   change
     insert a (b :: t +-+ v) (Eq.recOn (congr_arg succ e') (fs (add i k))) =

3d7987cd

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

@@ -38,7 +38,7 @@ namespace Vector3
 /-- The empty vector -/
 @[match_pattern]
 def nil : Vector3 α 0 :=
-  fun.
+  nofun
 #align vector3.nil Vector3.nil
 
 /-- The vector cons operation -/

3d7987cd

style: homogenise porting notes (#11145)

Homogenises porting notes via capitalisation and addition of whitespace.

It makes the following changes:

converts "--porting note" into "-- Porting note";
converts "porting note" into "Porting note".

8be0b69c

Diff

@@ -112,13 +112,13 @@ theorem cons_head_tail (v : Vector3 α (succ n)) : (head v :: tail v) = v :=
 #align vector3.cons_head_tail Vector3.cons_head_tail
 
 /-- Eliminator for an empty vector. -/
-@[elab_as_elim]  -- porting note: add `elab_as_elim`
+@[elab_as_elim]  -- Porting note: add `elab_as_elim`
 def nilElim {C : Vector3 α 0 → Sort u} (H : C []) (v : Vector3 α 0) : C v := by
   rw [eq_nil v]; apply H
 #align vector3.nil_elim Vector3.nilElim
 
 /-- Recursion principle for a nonempty vector. -/
-@[elab_as_elim]  -- porting note: add `elab_as_elim`
+@[elab_as_elim]  -- Porting note: add `elab_as_elim`
 def consElim {C : Vector3 α (succ n) → Sort u} (H : ∀ (a : α) (t : Vector3 α n), C (a :: t))
     (v : Vector3 α (succ n)) : C v := by rw [← cons_head_tail v]; apply H
 #align vector3.cons_elim Vector3.consElim

3d7987cd

chore: classify dsimp cannot prove this porting notes (#10676)

Classifies by adding issue number (#10675) to porting notes claiming dsimp cannot prove this.

90d86d7c

Diff

@@ -266,7 +266,7 @@ theorem vectorAllP_nil (p : α → Prop) : VectorAllP p [] = True :=
   rfl
 #align vector_allp_nil vectorAllP_nil
 
-@[simp, nolint simpNF] -- Porting note: dsimp cannot prove this
+@[simp, nolint simpNF] -- Porting note (#10675): dsimp cannot prove this
 theorem vectorAllP_singleton (p : α → Prop) (x : α) : VectorAllP p (cons x []) = p x :=
   rfl
 #align vector_allp_singleton vectorAllP_singleton

3d7987cd

doc: @[inherit_doc] on notations (#9942)

Make all the notations that unambiguously should inherit the docstring of their definition actually inherit it.

Also write a few docstrings by hand. I only wrote the ones I was competent to write and which I was sure of. Some docstrings come from mathlib3 as they were lost during the early port.

This PR is only intended as a first pass There are many more docstrings to add.

08f7e99d

Diff

@@ -69,6 +69,7 @@ scoped macro_rules | `([$l,*]) => `(expand_foldr% (h t => cons h t) nil [$(.ofEl
 end
 
 -- Overloading the usual `::` notation for `List.cons` with `Vector3.cons`.
+@[inherit_doc]
 scoped notation a " :: " b => cons a b
 
 @[simp]

3d7987cd

chore: reduce imports (#9830)

This uses the improved shake script from #9772 to reduce imports across mathlib. The corresponding noshake.json file has been added to #9772.

Co-authored-by: Mario Carneiro <di.gama@gmail.com>

f4c4ca61

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Mario Carneiro
 -/
 import Mathlib.Data.Fin.Fin2
-import Mathlib.Init.Align
+import Mathlib.Init.Logic
 import Mathlib.Mathport.Notation
 import Mathlib.Tactic.TypeStar

3d7987cd

chore(*): reduce dependencies on Mathlib.Tactic.* (#9816)

Drop import Mathlib.Tactic.Basic in Mathlib.Init.Logic and Mathlib.Logic.Basic.
Fix compile, sometimes golf broken proofs instead of re-adding imports.

8c01465a

Diff

@@ -6,6 +6,7 @@ Authors: Mario Carneiro
 import Mathlib.Data.Fin.Fin2
 import Mathlib.Init.Align
 import Mathlib.Mathport.Notation
+import Mathlib.Tactic.TypeStar
 
 #align_import data.vector3 from "leanprover-community/mathlib"@"3d7987cda72abc473c7cdbbb075170e9ac620042"

3d7987cd

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

@@ -22,7 +22,7 @@ open Fin2 Nat
 
 universe u
 
-variable {α : Type _} {m n : ℕ}
+variable {α : Type*} {m n : ℕ}
 
 /-- Alternate definition of `Vector` based on `Fin2`. -/
 def Vector3 (α : Type u) (n : ℕ) : Type u :=

3d7987cd

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.vector3
-! leanprover-community/mathlib commit 3d7987cda72abc473c7cdbbb075170e9ac620042
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Data.Fin.Fin2
 import Mathlib.Init.Align
 import Mathlib.Mathport.Notation
 
+#align_import data.vector3 from "leanprover-community/mathlib"@"3d7987cda72abc473c7cdbbb075170e9ac620042"
+
 /-!
 # Alternate definition of `Vector` in terms of `Fin2`

3d7987cd

chore: tidy various files (#5233)

697ac1d3

Diff

@@ -282,18 +282,14 @@ theorem vectorAllP_iff_forall (p : α → Prop) (v : Vector3 α n) :
     VectorAllP p v ↔ ∀ i, p (v i) := by
   refine' v.recOn _ _
   · exact ⟨fun _ => Fin2.elim0, fun _ => trivial⟩
-  · simp
-    refine' @fun n a v IH =>
+  · simp only [vectorAllP_cons]
+    refine' fun {n} a v IH =>
       (and_congr_right fun _ => IH).trans
         ⟨fun ⟨pa, h⟩ i => by
           refine' i.cases' _ _
           exacts [pa, h], fun h => ⟨_, fun i => _⟩⟩
-    · have h0 := h fz
-      simp at h0
-      exact h0
-    · have hs := h (fs i)
-      simp at hs
-      exact hs
+    · simpa using h fz
+    · simpa using h (fs i)
 #align vector_allp_iff_forall vectorAllP_iff_forall
 
 theorem VectorAllP.imp {p q : α → Prop} (h : ∀ x, p x → q x) {v : Vector3 α n}

3d7987cd

chore: formatting issues (#4947)

Co-authored-by: Scott Morrison <scott.morrison@anu.edu.au> Co-authored-by: Parcly Taxel <reddeloostw@gmail.com>

5068808d

Diff

@@ -125,7 +125,7 @@ def consElim {C : Vector3 α (succ n) → Sort u} (H : ∀ (a : α) (t : Vector3
 #align vector3.cons_elim Vector3.consElim
 
 @[simp]
-theorem consElim_cons {C H a t} : @consElim α n C H (a::t) = H a t :=
+theorem consElim_cons {C H a t} : @consElim α n C H (a :: t) = H a t :=
   rfl
 #align vector3.cons_elim_cons Vector3.consElim_cons

3d7987cd

chore: add space after exacts (#4945)

Too often tempted to change these during other PRs, so doing a mass edit here.

Co-authored-by: Scott Morrison <scott.morrison@anu.edu.au>

bf799bb9

Diff

@@ -287,7 +287,7 @@ theorem vectorAllP_iff_forall (p : α → Prop) (v : Vector3 α n) :
       (and_congr_right fun _ => IH).trans
         ⟨fun ⟨pa, h⟩ i => by
           refine' i.cases' _ _
-          exacts[pa, h], fun h => ⟨_, fun i => _⟩⟩
+          exacts [pa, h], fun h => ⟨_, fun i => _⟩⟩
     · have h0 := h fz
       simp at h0
       exact h0

3d7987cd

feat: port Data.Vector3 (#1204)

Co-authored-by: Eric Wieser <wieser.eric@gmail.com> Co-authored-by: Jeremy Tan Jie Rui <reddeloostw@gmail.com> Co-authored-by: Parcly Taxel <reddeloostw@gmail.com> Co-authored-by: Matthew Ballard <matt@mrb.email>

419351fa

`data.vector3` ⟷ `Mathlib.Data.Vector3`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 1

data.vector3 ⟷ Mathlib.Data.Vector3

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 1

`data.vector3` ⟷ `Mathlib.Data.Vector3`