data.finite.defs | 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

a148d797

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

448144f7

bump to nightly-2023-11-05-06

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

acc3325f

Diff

@@ -142,7 +142,7 @@ instance {α : Type v} [Infinite α] : Infinite (ULift.{u} α) :=
 
 #print finite_or_infinite /-
 theorem finite_or_infinite (α : Sort _) : Finite α ∨ Infinite α :=
-  or_iff_not_imp_left.2 <| not_finite_iff_infinite.1
+  Classical.or_iff_not_imp_left.2 <| not_finite_iff_infinite.1
 #align finite_or_infinite finite_or_infinite
 -/

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) 2022 Kyle Miller. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Kyle Miller
 -/
-import Mathbin.Logic.Equiv.Basic
+import Logic.Equiv.Basic
 
 #align_import data.finite.defs from "leanprover-community/mathlib"@"448144f7ae193a8990cb7473c9e9a01990f64ac7"

448144f7

bump to nightly-2023-08-23-23

mathlib commit https://github.com/leanprover-community/mathlib/commit/32a7e535287f9c73f2e4d2aef306a39190f0b504

f612b9e0

Diff

@@ -164,7 +164,7 @@ protected theorem Infinite.false [Finite α] (h : Infinite α) : False :=
 #align infinite.false Infinite.false
 -/
 
-alias not_infinite_iff_finite ↔ Finite.of_not_infinite Finite.not_infinite
+alias ⟨Finite.of_not_infinite, Finite.not_infinite⟩ := not_infinite_iff_finite
 #align finite.of_not_infinite Finite.of_not_infinite
 #align finite.not_infinite Finite.not_infinite

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) 2022 Kyle Miller. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Kyle Miller
-
-! This file was ported from Lean 3 source module data.finite.defs
-! 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.Logic.Equiv.Basic
 
+#align_import data.finite.defs from "leanprover-community/mathlib"@"448144f7ae193a8990cb7473c9e9a01990f64ac7"
+
 /-!
 # Definition of the `finite` typeclass

448144f7

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -67,13 +67,17 @@ class inductive Finite (α : Sort _) : Prop
 #align finite Finite
 -/
 
+#print finite_iff_exists_equiv_fin /-
 theorem finite_iff_exists_equiv_fin {α : Sort _} : Finite α ↔ ∃ n, Nonempty (α ≃ Fin n) :=
   ⟨fun ⟨e⟩ => ⟨_, ⟨e⟩⟩, fun ⟨n, ⟨e⟩⟩ => ⟨e⟩⟩
 #align finite_iff_exists_equiv_fin finite_iff_exists_equiv_fin
+-/
 
+#print Finite.exists_equiv_fin /-
 theorem Finite.exists_equiv_fin (α : Sort _) [h : Finite α] : ∃ n : ℕ, Nonempty (α ≃ Fin n) :=
   finite_iff_exists_equiv_fin.mp h
 #align finite.exists_equiv_fin Finite.exists_equiv_fin
+-/
 
 #print Finite.of_equiv /-
 theorem Finite.of_equiv (α : Sort _) [h : Finite α] (f : α ≃ β) : Finite β := by cases' h with n e;
@@ -81,17 +85,23 @@ theorem Finite.of_equiv (α : Sort _) [h : Finite α] (f : α ≃ β) : Finite 
 #align finite.of_equiv Finite.of_equiv
 -/
 
+#print Equiv.finite_iff /-
 theorem Equiv.finite_iff (f : α ≃ β) : Finite α ↔ Finite β :=
   ⟨fun _ => Finite.of_equiv _ f, fun _ => Finite.of_equiv _ f.symm⟩
 #align equiv.finite_iff Equiv.finite_iff
+-/
 
+#print Function.Bijective.finite_iff /-
 theorem Function.Bijective.finite_iff {f : α → β} (h : Bijective f) : Finite α ↔ Finite β :=
   (Equiv.ofBijective f h).finite_iff
 #align function.bijective.finite_iff Function.Bijective.finite_iff
+-/
 
+#print Finite.ofBijective /-
 theorem Finite.ofBijective [Finite α] {f : α → β} (h : Bijective f) : Finite β :=
   h.finite_iff.mp ‹_›
 #align finite.of_bijective Finite.ofBijective
+-/
 
 instance [Finite α] : Finite (PLift α) :=
   Finite.of_equiv α Equiv.plift.symm
@@ -121,9 +131,11 @@ theorem not_infinite_iff_finite : ¬Infinite α ↔ Finite α :=
 #align not_infinite_iff_finite not_infinite_iff_finite
 -/
 
+#print Equiv.infinite_iff /-
 theorem Equiv.infinite_iff (e : α ≃ β) : Infinite α ↔ Infinite β :=
   not_finite_iff_infinite.symm.trans <| e.finite_iff.Not.trans not_finite_iff_infinite
 #align equiv.infinite_iff Equiv.infinite_iff
+-/
 
 instance [Infinite α] : Infinite (PLift α) :=
   Equiv.plift.infinite_iff.2 ‹_›

448144f7

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -67,22 +67,10 @@ class inductive Finite (α : Sort _) : Prop
 #align finite Finite
 -/
 
-/- warning: finite_iff_exists_equiv_fin -> finite_iff_exists_equiv_fin is a dubious translation:
-lean 3 declaration is
-  forall {α : Sort.{u1}}, Iff (Finite.{u1} α) (Exists.{1} Nat (fun (n : Nat) => Nonempty.{max 1 (max u1 1) (imax 1 u1)} (Equiv.{u1, 1} α (Fin n))))
-but is expected to have type
-  forall {α : Sort.{u1}}, Iff (Finite.{u1} α) (Exists.{1} Nat (fun (n : Nat) => Nonempty.{max 1 u1} (Equiv.{u1, 1} α (Fin n))))
-Case conversion may be inaccurate. Consider using '#align finite_iff_exists_equiv_fin finite_iff_exists_equiv_finₓ'. -/
 theorem finite_iff_exists_equiv_fin {α : Sort _} : Finite α ↔ ∃ n, Nonempty (α ≃ Fin n) :=
   ⟨fun ⟨e⟩ => ⟨_, ⟨e⟩⟩, fun ⟨n, ⟨e⟩⟩ => ⟨e⟩⟩
 #align finite_iff_exists_equiv_fin finite_iff_exists_equiv_fin
 
-/- warning: finite.exists_equiv_fin -> Finite.exists_equiv_fin is a dubious translation:
-lean 3 declaration is
-  forall (α : Sort.{u1}) [h : Finite.{u1} α], Exists.{1} Nat (fun (n : Nat) => Nonempty.{max 1 (max u1 1) (imax 1 u1)} (Equiv.{u1, 1} α (Fin n)))
-but is expected to have type
-  forall (α : Sort.{u1}) [h : Finite.{u1} α], Exists.{1} Nat (fun (n : Nat) => Nonempty.{max 1 u1} (Equiv.{u1, 1} α (Fin n)))
-Case conversion may be inaccurate. Consider using '#align finite.exists_equiv_fin Finite.exists_equiv_finₓ'. -/
 theorem Finite.exists_equiv_fin (α : Sort _) [h : Finite α] : ∃ n : ℕ, Nonempty (α ≃ Fin n) :=
   finite_iff_exists_equiv_fin.mp h
 #align finite.exists_equiv_fin Finite.exists_equiv_fin
@@ -93,32 +81,14 @@ theorem Finite.of_equiv (α : Sort _) [h : Finite α] (f : α ≃ β) : Finite 
 #align finite.of_equiv Finite.of_equiv
 -/
 
-/- warning: equiv.finite_iff -> Equiv.finite_iff is a dubious translation:
-lean 3 declaration is
-  forall {α : Sort.{u1}} {β : Sort.{u2}}, (Equiv.{u1, u2} α β) -> (Iff (Finite.{u1} α) (Finite.{u2} β))
-but is expected to have type
-  forall {α : Sort.{u2}} {β : Sort.{u1}}, (Equiv.{u2, u1} α β) -> (Iff (Finite.{u2} α) (Finite.{u1} β))
-Case conversion may be inaccurate. Consider using '#align equiv.finite_iff Equiv.finite_iffₓ'. -/
 theorem Equiv.finite_iff (f : α ≃ β) : Finite α ↔ Finite β :=
   ⟨fun _ => Finite.of_equiv _ f, fun _ => Finite.of_equiv _ f.symm⟩
 #align equiv.finite_iff Equiv.finite_iff
 
-/- warning: function.bijective.finite_iff -> Function.Bijective.finite_iff is a dubious translation:
-lean 3 declaration is
-  forall {α : Sort.{u1}} {β : Sort.{u2}} {f : α -> β}, (Function.Bijective.{u1, u2} α β f) -> (Iff (Finite.{u1} α) (Finite.{u2} β))
-but is expected to have type
-  forall {α : Sort.{u2}} {β : Sort.{u1}} {f : α -> β}, (Function.Bijective.{u2, u1} α β f) -> (Iff (Finite.{u2} α) (Finite.{u1} β))
-Case conversion may be inaccurate. Consider using '#align function.bijective.finite_iff Function.Bijective.finite_iffₓ'. -/
 theorem Function.Bijective.finite_iff {f : α → β} (h : Bijective f) : Finite α ↔ Finite β :=
   (Equiv.ofBijective f h).finite_iff
 #align function.bijective.finite_iff Function.Bijective.finite_iff
 
-/- warning: finite.of_bijective -> Finite.ofBijective is a dubious translation:
-lean 3 declaration is
-  forall {α : Sort.{u1}} {β : Sort.{u2}} [_inst_1 : Finite.{u1} α] {f : α -> β}, (Function.Bijective.{u1, u2} α β f) -> (Finite.{u2} β)
-but is expected to have type
-  forall {α : Sort.{u2}} {β : Sort.{u1}} [_inst_1 : Finite.{u2} α] {f : α -> β}, (Function.Bijective.{u2, u1} α β f) -> (Finite.{u1} β)
-Case conversion may be inaccurate. Consider using '#align finite.of_bijective Finite.ofBijectiveₓ'. -/
 theorem Finite.ofBijective [Finite α] {f : α → β} (h : Bijective f) : Finite β :=
   h.finite_iff.mp ‹_›
 #align finite.of_bijective Finite.ofBijective
@@ -151,12 +121,6 @@ theorem not_infinite_iff_finite : ¬Infinite α ↔ Finite α :=
 #align not_infinite_iff_finite not_infinite_iff_finite
 -/
 
-/- warning: equiv.infinite_iff -> Equiv.infinite_iff is a dubious translation:
-lean 3 declaration is
-  forall {α : Sort.{u1}} {β : Sort.{u2}}, (Equiv.{u1, u2} α β) -> (Iff (Infinite.{u1} α) (Infinite.{u2} β))
-but is expected to have type
-  forall {α : Sort.{u2}} {β : Sort.{u1}}, (Equiv.{u2, u1} α β) -> (Iff (Infinite.{u2} α) (Infinite.{u1} β))
-Case conversion may be inaccurate. Consider using '#align equiv.infinite_iff Equiv.infinite_iffₓ'. -/
 theorem Equiv.infinite_iff (e : α ≃ β) : Infinite α ↔ Infinite β :=
   not_finite_iff_infinite.symm.trans <| e.finite_iff.Not.trans not_finite_iff_infinite
 #align equiv.infinite_iff Equiv.infinite_iff

448144f7

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -88,9 +88,7 @@ theorem Finite.exists_equiv_fin (α : Sort _) [h : Finite α] : ∃ n : ℕ, Non
 #align finite.exists_equiv_fin Finite.exists_equiv_fin
 
 #print Finite.of_equiv /-
-theorem Finite.of_equiv (α : Sort _) [h : Finite α] (f : α ≃ β) : Finite β :=
-  by
-  cases' h with n e
+theorem Finite.of_equiv (α : Sort _) [h : Finite α] (f : α ≃ β) : Finite β := by cases' h with n e;
   exact Finite.intro (f.symm.trans e)
 #align finite.of_equiv Finite.of_equiv
 -/

448144f7

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

a148d797

chore(Init/Fin): deprecate Fin.eq_of_veq and Fin.veq_of_eq (#10626)

We have Fin.eq_of_val_eq and Fin.val_eq_of_eq in Lean core now. Also slightly shake the tree.

9a944835

Diff

@@ -4,7 +4,6 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Kyle Miller
 -/
 import Mathlib.Logic.Equiv.Defs
-import Mathlib.Tactic.Cases
 
 #align_import data.finite.defs from "leanprover-community/mathlib"@"a148d797a1094ab554ad4183a4ad6f130358ef64"
 
@@ -91,9 +90,8 @@ theorem Finite.exists_equiv_fin (α : Sort*) [h : Finite α] : ∃ n : ℕ, None
   finite_iff_exists_equiv_fin.mp h
 #align finite.exists_equiv_fin Finite.exists_equiv_fin
 
-theorem Finite.of_equiv (α : Sort*) [h : Finite α] (f : α ≃ β) : Finite β := by
-  cases' h with n e
-  exact Finite.intro (f.symm.trans e)
+theorem Finite.of_equiv (α : Sort*) [h : Finite α] (f : α ≃ β) : Finite β :=
+  let ⟨e⟩ := h; ⟨f.symm.trans e⟩
 #align finite.of_equiv Finite.of_equiv
 
 theorem Equiv.finite_iff (f : α ≃ β) : Finite α ↔ Finite β :=

a148d797

docs: improve Finite docstring (#9667)

369ad8f0

Diff

@@ -50,11 +50,34 @@ open Function
 
 variable {α β : Sort*}
 
-/-- A type is `Finite` if it is in bijective correspondence to some
-`Fin n`.
-
-While this could be defined as `Nonempty (Fintype α)`, it is defined
-in this way to allow there to be `Finite` instances for propositions.
+/-- A type is `Finite` if it is in bijective correspondence to some `Fin n`.
+
+This is similar to `Fintype`, but `Finite` is a proposition rather than data.
+A particular benefit to this is that `Finite` instances are definitionally equal to one another
+(due to proof irrelevance) rather than being merely propositionally equal,
+and, furthermore, `Finite` instances generally avoid the need for `Decidable` instances.
+One other notable difference is that `Finite` allows there to be `Finite p` instances
+for all `p : Prop`, which is not allowed by `Fintype` due to universe constraints.
+An application of this is that `Finite (x ∈ s → β x)` follows from the general instance for pi
+types, assuming `[∀ x, Finite (β x)]`.
+Implementation note: this is a reason `Finite α` is not defined as `Nonempty (Fintype α)`.
+
+Every `Fintype` instance provides a `Finite` instance via `Finite.of_fintype`.
+Conversely, one can noncomputably create a `Fintype` instance from a `Finite` instance
+via `Fintype.ofFinite`. In a proof one might write
+```lean
+  have := Fintype.ofFinite α
+```
+to obtain such an instance.
+
+Do not write noncomputable `Fintype` instances; instead write `Finite` instances
+and use this `Fintype.ofFinite` interface.
+The `Fintype` instances should be relied upon to be computable for evaluation purposes.
+
+Theorems should use `Finite` instead of `Fintype`, unless definitions in the theorem statement
+require `Fintype`.
+Definitions should prefer `Finite` as well, unless it is important that the definitions
+are meant to be computable in the reduction or `#eval` sense.
 -/
 class inductive Finite (α : Sort*) : Prop
   | intro {n : ℕ} : α ≃ Fin n → Finite _

a148d797

chore: Move Int and Nat cast lemmas (#9503)

Part of #9411

e1b05c51

Diff

@@ -3,7 +3,8 @@ Copyright (c) 2022 Kyle Miller. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Kyle Miller
 -/
-import Mathlib.Logic.Equiv.Basic
+import Mathlib.Logic.Equiv.Defs
+import Mathlib.Tactic.Cases
 
 #align_import data.finite.defs from "leanprover-community/mathlib"@"a148d797a1094ab554ad4183a4ad6f130358ef64"

a148d797

feat: patch for new alias command (#6172)

19e0ba92

Diff

@@ -134,6 +134,6 @@ protected theorem Infinite.false [Finite α] (_ : Infinite α) : False :=
   @Infinite.not_finite α ‹_› ‹_›
 #align infinite.false Infinite.false
 
-alias not_infinite_iff_finite ↔ Finite.of_not_infinite Finite.not_infinite
+alias ⟨Finite.of_not_infinite, Finite.not_infinite⟩ := not_infinite_iff_finite
 #align finite.of_not_infinite Finite.of_not_infinite
 #align finite.not_infinite Finite.not_infinite

a148d797

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

@@ -34,7 +34,7 @@ instead.
 ## Implementation notes
 
 The definition of `Finite α` is not just `Nonempty (Fintype α)` since `Fintype` requires
-that `α : Type _`, and the definition in this module allows for `α : Sort*`. This means
+that `α : Type*`, and the definition in this module allows for `α : Sort*`. This means
 we can write the instance `Finite.prop`.
 
 ## Tags
@@ -47,7 +47,7 @@ universe u v
 
 open Function
 
-variable {α β : Sort _}
+variable {α β : Sort*}
 
 /-- A type is `Finite` if it is in bijective correspondence to some
 `Fin n`.
@@ -55,19 +55,19 @@ variable {α β : Sort _}
 While this could be defined as `Nonempty (Fintype α)`, it is defined
 in this way to allow there to be `Finite` instances for propositions.
 -/
-class inductive Finite (α : Sort _) : Prop
+class inductive Finite (α : Sort*) : Prop
   | intro {n : ℕ} : α ≃ Fin n → Finite _
 #align finite Finite
 
-theorem finite_iff_exists_equiv_fin {α : Sort _} : Finite α ↔ ∃ n, Nonempty (α ≃ Fin n) :=
+theorem finite_iff_exists_equiv_fin {α : Sort*} : Finite α ↔ ∃ n, Nonempty (α ≃ Fin n) :=
   ⟨fun ⟨e⟩ => ⟨_, ⟨e⟩⟩, fun ⟨_, ⟨e⟩⟩ => ⟨e⟩⟩
 #align finite_iff_exists_equiv_fin finite_iff_exists_equiv_fin
 
-theorem Finite.exists_equiv_fin (α : Sort _) [h : Finite α] : ∃ n : ℕ, Nonempty (α ≃ Fin n) :=
+theorem Finite.exists_equiv_fin (α : Sort*) [h : Finite α] : ∃ n : ℕ, Nonempty (α ≃ Fin n) :=
   finite_iff_exists_equiv_fin.mp h
 #align finite.exists_equiv_fin Finite.exists_equiv_fin
 
-theorem Finite.of_equiv (α : Sort _) [h : Finite α] (f : α ≃ β) : Finite β := by
+theorem Finite.of_equiv (α : Sort*) [h : Finite α] (f : α ≃ β) : Finite β := by
   cases' h with n e
   exact Finite.intro (f.symm.trans e)
 #align finite.of_equiv Finite.of_equiv
@@ -92,7 +92,7 @@ instance {α : Type v} [Finite α] : Finite (ULift.{u} α) :=
 
 /-- A type is said to be infinite if it is not finite. Note that `Infinite α` is equivalent to
 `IsEmpty (Fintype α)` or `IsEmpty (Finite α)`. -/
-class Infinite (α : Sort _) : Prop where
+class Infinite (α : Sort*) : Prop where
   /-- assertion that `α` is `¬Finite`-/
   not_finite : ¬Finite α
 #align infinite Infinite
@@ -117,12 +117,12 @@ instance [Infinite α] : Infinite (PLift α) :=
 instance {α : Type v} [Infinite α] : Infinite (ULift.{u} α) :=
   Equiv.ulift.infinite_iff.2 ‹_›
 
-theorem finite_or_infinite (α : Sort _) : Finite α ∨ Infinite α :=
+theorem finite_or_infinite (α : Sort*) : Finite α ∨ Infinite α :=
   or_iff_not_imp_left.2 not_finite_iff_infinite.1
 #align finite_or_infinite finite_or_infinite
 
 /-- `Infinite α` is not `Finite`-/
-theorem not_finite (α : Sort _) [Infinite α] [Finite α] : False :=
+theorem not_finite (α : Sort*) [Infinite α] [Finite α] : False :=
   @Infinite.not_finite α ‹_› ‹_›
 #align not_finite not_finite

a148d797

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) 2022 Kyle Miller. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Kyle Miller
-
-! This file was ported from Lean 3 source module data.finite.defs
-! leanprover-community/mathlib commit a148d797a1094ab554ad4183a4ad6f130358ef64
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Logic.Equiv.Basic
 
+#align_import data.finite.defs from "leanprover-community/mathlib"@"a148d797a1094ab554ad4183a4ad6f130358ef64"
+
 /-!
 # Definition of the `Finite` typeclass

a148d797

chore: fix many typos (#4983)

These are all doc fixes

54b72114

Diff

@@ -36,7 +36,7 @@ instead.
 
 ## Implementation notes
 
-The definition of `Finite α` is not just `NonEmpty (Fintype α)` since `Fintype` requires
+The definition of `Finite α` is not just `Nonempty (Fintype α)` since `Fintype` requires
 that `α : Type _`, and the definition in this module allows for `α : Sort*`. This means
 we can write the instance `Finite.prop`.
 
@@ -55,7 +55,7 @@ variable {α β : Sort _}
 /-- A type is `Finite` if it is in bijective correspondence to some
 `Fin n`.
 
-While this could be defined as `NonEmpty (Fintype α)`, it is defined
+While this could be defined as `Nonempty (Fintype α)`, it is defined
 in this way to allow there to be `Finite` instances for propositions.
 -/
 class inductive Finite (α : Sort _) : Prop

a148d797

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

@@ -138,3 +138,5 @@ protected theorem Infinite.false [Finite α] (_ : Infinite α) : False :=
 #align infinite.false Infinite.false
 
 alias not_infinite_iff_finite ↔ Finite.of_not_infinite Finite.not_infinite
+#align finite.of_not_infinite Finite.of_not_infinite
+#align finite.not_infinite Finite.not_infinite

a148d797

chore: Rename Type* to Type _ (#1866)

A bunch of docstrings were still mentioning Type*. This changes them to Type _.

50036b41

Diff

@@ -37,7 +37,7 @@ instead.
 ## Implementation notes
 
 The definition of `Finite α` is not just `NonEmpty (Fintype α)` since `Fintype` requires
-that `α : Type*`, and the definition in this module allows for `α : Sort*`. This means
+that `α : Type _`, and the definition in this module allows for `α : Sort*`. This means
 we can write the instance `Finite.prop`.
 
 ## Tags

a148d797

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) 2022 Kyle Miller. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Kyle Miller
+
+! This file was ported from Lean 3 source module data.finite.defs
+! leanprover-community/mathlib commit a148d797a1094ab554ad4183a4ad6f130358ef64
+! Please do not edit these lines, except to modify the commit id
+! if you have ported upstream changes.
 -/
 import Mathlib.Logic.Equiv.Basic

`data.finite.defs` ⟷ `Mathlib.Data.Finite.Defs`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 17

data.finite.defs ⟷ Mathlib.Data.Finite.Defs

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 17

`data.finite.defs` ⟷ `Mathlib.Data.Finite.Defs`