algebra.euclidean_domain.instances | 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

e1bccd6e

(last sync)

chore(data/int/order/basic): Fix lemma name (#17967)

int.coe_nat_abs wasn't referring to the correct lemma. Change the name, add the lemma it should correspond to and tag both with simp and norm_cast.

Co-authored-by: Eric Wieser <wieser.eric@gmail.com>

Diff

@@ -33,7 +33,7 @@ instance int.euclidean_domain : euclidean_domain ℤ :=
   r := λ a b, a.nat_abs < b.nat_abs,
   r_well_founded := measure_wf (λ a, int.nat_abs a),
   remainder_lt := λ a b b0, int.coe_nat_lt.1 $
-    by { rw [int.nat_abs_of_nonneg (int.mod_nonneg _ b0), ← int.abs_eq_nat_abs],
+    by { rw [int.nat_abs_of_nonneg (int.mod_nonneg _ b0), int.coe_nat_abs],
       exact int.mod_lt _ b0 },
   mul_left_not_lt := λ a b b0, not_lt_of_ge $
     by {rw [← mul_one a.nat_abs, int.nat_abs_mul],

cf9386b5

(first ported)

Changes in mathlib3port

mathlib3

mathlib3port

e1bccd6e

bump to nightly-2024-04-09-08

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

659ec6f7

Diff

@@ -6,8 +6,8 @@ Authors: Louis Carlin, Mario Carneiro
 import Algebra.EuclideanDomain.Defs
 import Algebra.Field.Defs
 import Algebra.GroupWithZero.Units.Lemmas
-import Data.Nat.Order.Basic
-import Data.Int.Order.Basic
+import Algebra.Order.Group.Nat
+import Algebra.Order.Group.Int
 
 #align_import algebra.euclidean_domain.instances from "leanprover-community/mathlib"@"e1bccd6e40ae78370f01659715d3c948716e3b7e"

e1bccd6e

bump to nightly-2024-04-06-08

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

e34029c9

Diff

@@ -40,12 +40,12 @@ instance Int.euclideanDomain : EuclideanDomain ℤ :=
     remainder_lt := fun a b b0 =>
       Int.ofNat_lt.1 <|
         by
-        rw [Int.natAbs_of_nonneg (Int.emod_nonneg _ b0), Int.coe_natAbs]
+        rw [Int.natAbs_of_nonneg (Int.emod_nonneg _ b0), Int.natCast_natAbs]
         exact Int.emod_lt _ b0
     mul_left_not_lt := fun a b b0 =>
       not_lt_of_ge <| by
         rw [← mul_one a.nat_abs, Int.natAbs_mul]
-        exact mul_le_mul_of_nonneg_left (Int.natAbs_pos_of_ne_zero b0) (Nat.zero_le _) }
+        exact mul_le_mul_of_nonneg_left (Int.natAbs_pos b0) (Nat.zero_le _) }
 #align int.euclidean_domain Int.euclideanDomain
 -/
 
@@ -62,7 +62,7 @@ instance (priority := 100) Field.toEuclideanDomain {K : Type _} [Field K] : Eucl
     remainder := fun a b => a - a * b / b
     quotient_zero := div_zero
     quotient_mul_add_remainder_eq := fun a b => by
-      classical by_cases b = 0 <;> simp [h, mul_div_cancel']
+      classical by_cases b = 0 <;> simp [h, mul_div_cancel₀]
     R := fun a b => a = 0 ∧ b ≠ 0
     r_wellFounded :=
       WellFounded.intro fun a =>

e1bccd6e

bump to nightly-2024-02-01-06

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

5433bded

Diff

@@ -61,7 +61,8 @@ instance (priority := 100) Field.toEuclideanDomain {K : Type _} [Field K] : Eucl
     Quotient := (· / ·)
     remainder := fun a b => a - a * b / b
     quotient_zero := div_zero
-    quotient_mul_add_remainder_eq := fun a b => by classical
+    quotient_mul_add_remainder_eq := fun a b => by
+      classical by_cases b = 0 <;> simp [h, mul_div_cancel']
     R := fun a b => a = 0 ∧ b ≠ 0
     r_wellFounded :=
       WellFounded.intro fun a =>

e1bccd6e

bump to nightly-2024-01-31-06

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

61100fe9

Diff

@@ -61,8 +61,7 @@ instance (priority := 100) Field.toEuclideanDomain {K : Type _} [Field K] : Eucl
     Quotient := (· / ·)
     remainder := fun a b => a - a * b / b
     quotient_zero := div_zero
-    quotient_mul_add_remainder_eq := fun a b => by
-      classical by_cases b = 0 <;> simp [h, mul_div_cancel']
+    quotient_mul_add_remainder_eq := fun a b => by classical
     R := fun a b => a = 0 ∧ b ≠ 0
     r_wellFounded :=
       WellFounded.intro fun a =>

e1bccd6e

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,11 +3,11 @@ Copyright (c) 2018 Louis Carlin. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Louis Carlin, Mario Carneiro
 -/
-import Mathbin.Algebra.EuclideanDomain.Defs
-import Mathbin.Algebra.Field.Defs
-import Mathbin.Algebra.GroupWithZero.Units.Lemmas
-import Mathbin.Data.Nat.Order.Basic
-import Mathbin.Data.Int.Order.Basic
+import Algebra.EuclideanDomain.Defs
+import Algebra.Field.Defs
+import Algebra.GroupWithZero.Units.Lemmas
+import Data.Nat.Order.Basic
+import Data.Int.Order.Basic
 
 #align_import algebra.euclidean_domain.instances from "leanprover-community/mathlib"@"e1bccd6e40ae78370f01659715d3c948716e3b7e"

e1bccd6e

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,11 +2,6 @@
 Copyright (c) 2018 Louis Carlin. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Louis Carlin, Mario Carneiro
-
-! This file was ported from Lean 3 source module algebra.euclidean_domain.instances
-! leanprover-community/mathlib commit e1bccd6e40ae78370f01659715d3c948716e3b7e
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Algebra.EuclideanDomain.Defs
 import Mathbin.Algebra.Field.Defs
@@ -14,6 +9,8 @@ import Mathbin.Algebra.GroupWithZero.Units.Lemmas
 import Mathbin.Data.Nat.Order.Basic
 import Mathbin.Data.Int.Order.Basic
 
+#align_import algebra.euclidean_domain.instances from "leanprover-community/mathlib"@"e1bccd6e40ae78370f01659715d3c948716e3b7e"
+
 /-!
 # Instances for Euclidean domains

e1bccd6e

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

e1bccd6e

chore: Split Data.{Nat,Int}{.Order}.Basic in group vs ring instances (#11924)

Scatter the content of Data.Nat.Basic across:

Data.Nat.Defs for the lemmas having no dependencies
Algebra.Group.Nat for the monoid instances and the few miscellaneous lemmas needing them.
Algebra.Ring.Nat for the semiring instance and the few miscellaneous lemmas following it.

Similarly, scatter

Data.Int.Basic across Data.Int.Defs, Algebra.Group.Int, Algebra.Ring.Int
Data.Nat.Order.Basic across Data.Nat.Defs, Algebra.Order.Group.Nat, Algebra.Order.Ring.Nat
Data.Int.Order.Basic across Data.Int.Defs, Algebra.Order.Group.Int, Algebra.Order.Ring.Int

Also move a few lemmas from Data.Nat.Order.Lemmas to Data.Nat.Defs.

Before pre_11924

After post_11924

47062a71

Diff

@@ -5,8 +5,10 @@ Authors: Louis Carlin, Mario Carneiro
 -/
 import Mathlib.Algebra.EuclideanDomain.Defs
 import Mathlib.Algebra.Field.Defs
+import Mathlib.Algebra.Group.Nat
 import Mathlib.Algebra.GroupWithZero.Units.Basic
-import Mathlib.Data.Int.Order.Basic
+import Mathlib.Algebra.Order.Group.Int
+import Mathlib.Algebra.Ring.Int
 
 #align_import algebra.euclidean_domain.instances from "leanprover-community/mathlib"@"e1bccd6e40ae78370f01659715d3c948716e3b7e"

e1bccd6e

chore(Data/Nat): Use Std lemmas (#11661)

Move basic Nat lemmas from Data.Nat.Order.Basic and Data.Nat.Pow to Data.Nat.Defs. Most proofs need adapting, but that's easily solved by replacing the general mathlib lemmas by the new Std Nat-specific lemmas and using omega.

Other changes

Move the last few lemmas left in Data.Nat.Pow to Algebra.GroupPower.Order
Move the deprecated aliases from Data.Nat.Pow to Algebra.GroupPower.Order
Move the bit/bit0/bit1 lemmas from Data.Nat.Order.Basic to Data.Nat.Bits
Fix some fallout from not importing Data.Nat.Order.Basic anymore
Add a few Nat-specific lemmas to help fix the fallout (look for nolint simpNF)
Turn Nat.mul_self_le_mul_self_iff and Nat.mul_self_lt_mul_self_iff around (they were misnamed)
Make more arguments to Nat.one_lt_pow implicit

5bc68d9f

Diff

@@ -7,7 +7,6 @@ import Mathlib.Algebra.EuclideanDomain.Defs
 import Mathlib.Algebra.Field.Defs
 import Mathlib.Algebra.GroupWithZero.Units.Basic
 import Mathlib.Data.Int.Order.Basic
-import Mathlib.Data.Nat.Order.Basic
 
 #align_import algebra.euclidean_domain.instances from "leanprover-community/mathlib"@"e1bccd6e40ae78370f01659715d3c948716e3b7e"

e1bccd6e

chore: Rename mul-div cancellation lemmas (#11530)

Lemma names around cancellation of multiplication and division are a mess.

This PR renames a handful of them according to the following table (each big row contains the multiplicative statement, then the three rows contain the GroupWithZero lemma name, the Group lemma, the AddGroup lemma name).

4ea4a86a

Diff

@@ -37,7 +37,7 @@ instance (priority := 100) Field.toEuclideanDomain {K : Type*} [Field K] : Eucli
 { toCommRing := Field.toCommRing
   quotient := (· / ·), remainder := fun a b => a - a * b / b, quotient_zero := div_zero,
   quotient_mul_add_remainder_eq := fun a b => by
-    by_cases h : b = 0 <;> simp [h, mul_div_cancel']
+    by_cases h : b = 0 <;> simp [h, mul_div_cancel₀]
   r := fun a b => a = 0 ∧ b ≠ 0,
   r_wellFounded :=
     WellFounded.intro fun a =>

e1bccd6e

chore: Move GroupWithZero lemmas earlier (#10919)

Move from Algebra.GroupWithZero.Units.Lemmas to Algebra.GroupWithZero.Units.Basic the lemmas that can be moved.

8ff9aa61

Diff

@@ -5,7 +5,7 @@ Authors: Louis Carlin, Mario Carneiro
 -/
 import Mathlib.Algebra.EuclideanDomain.Defs
 import Mathlib.Algebra.Field.Defs
-import Mathlib.Algebra.GroupWithZero.Units.Lemmas
+import Mathlib.Algebra.GroupWithZero.Units.Basic
 import Mathlib.Data.Int.Order.Basic
 import Mathlib.Data.Nat.Order.Basic

e1bccd6e

refactor: Delete Algebra.GroupPower.Lemmas (#9411)

Algebra.GroupPower.Lemmas used to be a big bag of lemmas that made it there on the criterion that they needed "more imports". This was completely untrue, as all lemmas could be moved to earlier files in PRs:

There are several reasons for this:

Necessary lemmas have been moved to earlier files since lemmas were dumped in Algebra.GroupPower.Lemmas
In the Lean 3 → Lean 4 transition, Std acquired basic Int and Nat lemmas which let us shortcircuit the part of the algebraic order hierarchy on which the corresponding general lemmas rest
Some proofs were overpowered
Some earlier files were tangled and I have untangled them

This PR finishes the job by moving the last few lemmas out of Algebra.GroupPower.Lemmas, which is therefore deleted.

6eb43dc3

Diff

@@ -6,11 +6,8 @@ Authors: Louis Carlin, Mario Carneiro
 import Mathlib.Algebra.EuclideanDomain.Defs
 import Mathlib.Algebra.Field.Defs
 import Mathlib.Algebra.GroupWithZero.Units.Lemmas
-import Mathlib.Algebra.Order.Ring.Lemmas
-import Mathlib.Init.Data.Int.Order
-import Mathlib.Data.Int.Basic
-import Mathlib.Data.Nat.Order.Basic
 import Mathlib.Data.Int.Order.Basic
+import Mathlib.Data.Nat.Order.Basic
 
 #align_import algebra.euclidean_domain.instances from "leanprover-community/mathlib"@"e1bccd6e40ae78370f01659715d3c948716e3b7e"

e1bccd6e

fix: patch for std4#198 (more mul lemmas for Nat) (#6204)

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

2f63d25e

Diff

@@ -33,7 +33,7 @@ instance Int.euclideanDomain : EuclideanDomain ℤ :=
       not_lt_of_ge <| by
         rw [← mul_one a.natAbs, Int.natAbs_mul]
         rw [← Int.natAbs_pos] at b0
-        exact Nat.mul_le_mul_of_nonneg_left b0 }
+        exact Nat.mul_le_mul_left _ b0 }
 
 -- see Note [lower instance priority]
 instance (priority := 100) Field.toEuclideanDomain {K : Type*} [Field K] : EuclideanDomain K :=

e1bccd6e

chore: space after ← (#8178)

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

5fb9beab

Diff

@@ -32,7 +32,7 @@ instance Int.euclideanDomain : EuclideanDomain ℤ :=
     mul_left_not_lt := fun a b b0 =>
       not_lt_of_ge <| by
         rw [← mul_one a.natAbs, Int.natAbs_mul]
-        rw [←Int.natAbs_pos] at b0
+        rw [← Int.natAbs_pos] at b0
         exact Nat.mul_le_mul_of_nonneg_left b0 }
 
 -- see Note [lower instance priority]

e1bccd6e

perf: remove overspecified fields (#6965)

This removes redundant field values of the form add := add for smaller terms and less unfolding during unification.

A list of all files containing a structure instance of the form { a1, ... with x1 := val, ... } where some xi is a field of some aj was generated by modifying the structure instance elaboration algorithm to print such overlaps to stdout in a custom toolchain.

Using that toolchain, I went through each file on the list and attempted to remove algebraic fields that overlapped and were redundant, eg add := add and not toFun (though some other ones did creep in). If things broke (which was the case in a couple of cases), I did not push further and reverted.

It is possible that pushing harder and trying to remove all redundant overlaps will yield further improvements.

12150475

Diff

@@ -22,8 +22,6 @@ import Mathlib.Data.Int.Order.Basic
 
 instance Int.euclideanDomain : EuclideanDomain ℤ :=
   { inferInstanceAs (CommRing Int), inferInstanceAs (Nontrivial Int) with
-    add := (· + ·), mul := (· * ·), one := 1, zero := 0,
-    neg := Neg.neg,
     quotient := (· / ·), quotient_zero := Int.ediv_zero, remainder := (· % ·),
     quotient_mul_add_remainder_eq := Int.ediv_add_emod,
     r := fun a b => a.natAbs < b.natAbs,

e1bccd6e

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

@@ -38,7 +38,7 @@ instance Int.euclideanDomain : EuclideanDomain ℤ :=
         exact Nat.mul_le_mul_of_nonneg_left b0 }
 
 -- see Note [lower instance priority]
-instance (priority := 100) Field.toEuclideanDomain {K : Type _} [Field K] : EuclideanDomain K :=
+instance (priority := 100) Field.toEuclideanDomain {K : Type*} [Field K] : EuclideanDomain K :=
 { toCommRing := Field.toCommRing
   quotient := (· / ·), remainder := fun a b => a - a * b / b, quotient_zero := div_zero,
   quotient_mul_add_remainder_eq := fun a b => by

e1bccd6e

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,11 +2,6 @@
 Copyright (c) 2018 Louis Carlin. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Louis Carlin, Mario Carneiro
-
-! This file was ported from Lean 3 source module algebra.euclidean_domain.instances
-! leanprover-community/mathlib commit e1bccd6e40ae78370f01659715d3c948716e3b7e
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Algebra.EuclideanDomain.Defs
 import Mathlib.Algebra.Field.Defs
@@ -17,6 +12,8 @@ import Mathlib.Data.Int.Basic
 import Mathlib.Data.Nat.Order.Basic
 import Mathlib.Data.Int.Order.Basic
 
+#align_import algebra.euclidean_domain.instances from "leanprover-community/mathlib"@"e1bccd6e40ae78370f01659715d3c948716e3b7e"
+
 /-!
 # Instances for Euclidean domains
 * `Int.euclideanDomain`: shows that `ℤ` is a Euclidean domain.

e1bccd6e

chore: cleanup whitespace (#5988)

Grepping for [^ .:{-] [^ :] and reviewing the results. Once I started I couldn't stop. :-)

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

12343aa5

Diff

@@ -38,7 +38,7 @@ instance Int.euclideanDomain : EuclideanDomain ℤ :=
       not_lt_of_ge <| by
         rw [← mul_one a.natAbs, Int.natAbs_mul]
         rw [←Int.natAbs_pos] at b0
-        exact Nat.mul_le_mul_of_nonneg_left b0  }
+        exact Nat.mul_le_mul_of_nonneg_left b0 }
 
 -- see Note [lower instance priority]
 instance (priority := 100) Field.toEuclideanDomain {K : Type _} [Field K] : EuclideanDomain K :=

e1bccd6e

chore: change Field.toEuclideanDomain (#5266)

Modifying the definition of Field.toEuclideanDomain makes some declaration faster.

Co-authored-by: Sébastien Gouëzel

0f82593c

Diff

@@ -40,24 +40,16 @@ instance Int.euclideanDomain : EuclideanDomain ℤ :=
         rw [←Int.natAbs_pos] at b0
         exact Nat.mul_le_mul_of_nonneg_left b0  }
 
--- Porting note: this seems very slow.
 -- see Note [lower instance priority]
 instance (priority := 100) Field.toEuclideanDomain {K : Type _} [Field K] : EuclideanDomain K :=
-  { ‹Field K› with
-    add := (· + ·), mul := (· * ·), one := 1, zero := 0, neg := Neg.neg,
-    quotient := (· / ·), remainder := fun a b => a - a * b / b, quotient_zero := div_zero,
-    quotient_mul_add_remainder_eq := fun a b => by
-      -- Porting note: was `by_cases h : b = 0 <;> simp [h, mul_div_cancel']`
-      by_cases h : b = 0 <;> dsimp only
-      · dsimp only
-        rw [h, zero_mul, mul_zero, zero_div, zero_add, sub_zero]
-      · dsimp only
-        rw [mul_div_cancel' _ h]
-        simp only [ne_eq, h, not_false_iff, mul_div_cancel, sub_self, add_zero]
-    r := fun a b => a = 0 ∧ b ≠ 0,
-    r_wellFounded :=
-      WellFounded.intro fun a =>
-        (Acc.intro _) fun b ⟨hb, _⟩ => (Acc.intro _) fun c ⟨_, hnb⟩ => False.elim <| hnb hb,
-    remainder_lt := fun a b hnb => by simp [hnb],
-    mul_left_not_lt := fun a b hnb ⟨hab, hna⟩ => Or.casesOn (mul_eq_zero.1 hab) hna hnb }
+{ toCommRing := Field.toCommRing
+  quotient := (· / ·), remainder := fun a b => a - a * b / b, quotient_zero := div_zero,
+  quotient_mul_add_remainder_eq := fun a b => by
+    by_cases h : b = 0 <;> simp [h, mul_div_cancel']
+  r := fun a b => a = 0 ∧ b ≠ 0,
+  r_wellFounded :=
+    WellFounded.intro fun a =>
+      (Acc.intro _) fun b ⟨hb, _⟩ => (Acc.intro _) fun c ⟨_, hnb⟩ => False.elim <| hnb hb,
+  remainder_lt := fun a b hnb => by simp [hnb],
+  mul_left_not_lt := fun a b hnb ⟨hab, hna⟩ => Or.casesOn (mul_eq_zero.1 hab) hna hnb }
 #align field.to_euclidean_domain Field.toEuclideanDomain

e1bccd6e

chore: resync ported files (#2135)

This PR resyncs the first 28 entries of https://leanprover-community.github.io/mathlib-port-status/out-of-sync.html after sorting by diff size.

resync Mathlib/Data/Bool/Count
resync Mathlib/Order/Max
resync Mathlib/Algebra/EuclideanDomain/Instances
resync Mathlib/Data/List/Duplicate
resync Mathlib/Data/Multiset/Nodup
resync Mathlib/Data/Set/Pointwise/ListOfFn
resync Mathlib/Dynamics/FixedPoints/Basic
resync Mathlib/Order/OmegaCompletePartialOrder
resync Mathlib/Order/PropInstances
resync Mathlib/Topology/LocallyFinite
resync Mathlib/Data/Bool/Set
resync Mathlib/Data/Fintype/Card
resync Mathlib/Data/Multiset/Bind
resync Mathlib/Data/Rat/Floor
resync Mathlib/Algebra/Order/Floor
resync Mathlib/Data/Int/Basic
resync Mathlib/Data/Int/Dvd/Basic
resync Mathlib/Data/List/Sort
resync Mathlib/Data/Nat/GCD/Basic
resync Mathlib/Data/Set/Enumerate
resync Mathlib/Data/Set/Intervals/OrdConnectedComponent
resync Mathlib/GroupTheory/Subsemigroup/Basic
resync Mathlib/Topology/Connected
resync Mathlib/Topology/NhdsSet
resync Mathlib/Algebra/BigOperators/Multiset/Lemmas
resync Mathlib/Algebra/CharZero/Infinite
resync Mathlib/Data/Multiset/Range
resync Mathlib/Data/Set/Pointwise/Finite

a7eb5ab3

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Louis Carlin, Mario Carneiro
 
 ! This file was ported from Lean 3 source module algebra.euclidean_domain.instances
-! leanprover-community/mathlib commit cf9386b56953fb40904843af98b7a80757bbe7f9
+! leanprover-community/mathlib commit e1bccd6e40ae78370f01659715d3c948716e3b7e
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/

cf9386b5

fix: correct source header of Algebra.EuclideanDomain.Instances (#1249)

834a45be

Diff

@@ -3,7 +3,7 @@ Copyright (c) 2018 Louis Carlin. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Louis Carlin, Mario Carneiro
 
-! This file was ported from Lean 3 source algebra.euclidean_domain.instances
+! This file was ported from Lean 3 source module algebra.euclidean_domain.instances
 ! leanprover-community/mathlib commit cf9386b56953fb40904843af98b7a80757bbe7f9
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.

`algebra.euclidean_domain.instances` ⟷ `Mathlib.Algebra.EuclideanDomain.Instances`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Other changes

Dependencies 2 + 91

algebra.euclidean_domain.instances ⟷ Mathlib.Algebra.EuclideanDomain.Instances

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Other changes

Dependencies 2 + 91

`algebra.euclidean_domain.instances` ⟷ `Mathlib.Algebra.EuclideanDomain.Instances`