ring_theory.localization.cardinality | 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

3b09a260

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

38df578a

bump to nightly-2024-02-01-06

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

5433bded

Diff

@@ -39,7 +39,17 @@ variable {R : Type u} [CommRing R] (S : Submonoid R) {L : Type u} [CommRing L] [
 
 #print IsLocalization.card_le /-
 /-- A localization always has cardinality less than or equal to the base ring. -/
-theorem card_le : (#L) ≤ (#R) := by classical
+theorem card_le : (#L) ≤ (#R) := by
+  classical
+  cases fintypeOrInfinite R
+  · exact Cardinal.mk_le_of_surjective (IsArtinianRing.localization_surjective S _)
+  erw [← Cardinal.mul_eq_self <| Cardinal.aleph0_le_mk R]
+  set f : R × R → L := fun aa => IsLocalization.mk' _ aa.1 (if h : aa.2 ∈ S then ⟨aa.2, h⟩ else 1)
+  refine' @Cardinal.mk_le_of_surjective _ _ f fun a => _
+  obtain ⟨x, y, h⟩ := IsLocalization.mk'_surjective S a
+  use(x, y)
+  dsimp [f]
+  rwa [dif_pos <| show ↑y ∈ S from y.2, SetLike.eta]
 #align is_localization.card_le IsLocalization.card_le
 -/

38df578a

bump to nightly-2024-01-31-06

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

61100fe9

Diff

@@ -39,17 +39,7 @@ variable {R : Type u} [CommRing R] (S : Submonoid R) {L : Type u} [CommRing L] [
 
 #print IsLocalization.card_le /-
 /-- A localization always has cardinality less than or equal to the base ring. -/
-theorem card_le : (#L) ≤ (#R) := by
-  classical
-  cases fintypeOrInfinite R
-  · exact Cardinal.mk_le_of_surjective (IsArtinianRing.localization_surjective S _)
-  erw [← Cardinal.mul_eq_self <| Cardinal.aleph0_le_mk R]
-  set f : R × R → L := fun aa => IsLocalization.mk' _ aa.1 (if h : aa.2 ∈ S then ⟨aa.2, h⟩ else 1)
-  refine' @Cardinal.mk_le_of_surjective _ _ f fun a => _
-  obtain ⟨x, y, h⟩ := IsLocalization.mk'_surjective S a
-  use(x, y)
-  dsimp [f]
-  rwa [dif_pos <| show ↑y ∈ S from y.2, SetLike.eta]
+theorem card_le : (#L) ≤ (#R) := by classical
 #align is_localization.card_le IsLocalization.card_le
 -/

38df578a

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) 2022 Eric Rodriguez. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Eric Rodriguez
 -/
-import Mathbin.SetTheory.Cardinal.Ordinal
-import Mathbin.RingTheory.Artinian
+import SetTheory.Cardinal.Ordinal
+import RingTheory.Artinian
 
 #align_import ring_theory.localization.cardinality from "leanprover-community/mathlib"@"38df578a6450a8c5142b3727e3ae894c2300cae0"

38df578a

bump to nightly-2023-08-02-01

mathlib commit https://github.com/leanprover-community/mathlib/commit/63721b2c3eba6c325ecf8ae8cca27155a4f6306f

7aca3f15

Diff

@@ -47,7 +47,7 @@ theorem card_le : (#L) ≤ (#R) := by
   set f : R × R → L := fun aa => IsLocalization.mk' _ aa.1 (if h : aa.2 ∈ S then ⟨aa.2, h⟩ else 1)
   refine' @Cardinal.mk_le_of_surjective _ _ f fun a => _
   obtain ⟨x, y, h⟩ := IsLocalization.mk'_surjective S a
-  use (x, y)
+  use(x, y)
   dsimp [f]
   rwa [dif_pos <| show ↑y ∈ S from y.2, SetLike.eta]
 #align is_localization.card_le IsLocalization.card_le

38df578a

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) 2022 Eric Rodriguez. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Eric Rodriguez
-
-! This file was ported from Lean 3 source module ring_theory.localization.cardinality
-! leanprover-community/mathlib commit 38df578a6450a8c5142b3727e3ae894c2300cae0
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.SetTheory.Cardinal.Ordinal
 import Mathbin.RingTheory.Artinian
 
+#align_import ring_theory.localization.cardinality from "leanprover-community/mathlib"@"38df578a6450a8c5142b3727e3ae894c2300cae0"
+
 /-!
 # Cardinality of localizations

38df578a

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -40,8 +40,6 @@ namespace IsLocalization
 variable {R : Type u} [CommRing R] (S : Submonoid R) {L : Type u} [CommRing L] [Algebra R L]
   [IsLocalization S L]
 
-include S
-
 #print IsLocalization.card_le /-
 /-- A localization always has cardinality less than or equal to the base ring. -/
 theorem card_le : (#L) ≤ (#R) := by
@@ -60,10 +58,12 @@ theorem card_le : (#L) ≤ (#R) := by
 
 variable (L)
 
+#print IsLocalization.card /-
 /-- If you do not localize at any zero-divisors, localization preserves cardinality. -/
 theorem card (hS : S ≤ R⁰) : (#R) = (#L) :=
   (Cardinal.mk_le_of_injective (IsLocalization.injective L hS)).antisymm (card_le S)
 #align is_localization.card IsLocalization.card
+-/
 
 end IsLocalization

38df578a

bump to nightly-2023-06-04-18

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

3fb4268b

Diff

@@ -46,15 +46,15 @@ include S
 /-- A localization always has cardinality less than or equal to the base ring. -/
 theorem card_le : (#L) ≤ (#R) := by
   classical
-    cases fintypeOrInfinite R
-    · exact Cardinal.mk_le_of_surjective (IsArtinianRing.localization_surjective S _)
-    erw [← Cardinal.mul_eq_self <| Cardinal.aleph0_le_mk R]
-    set f : R × R → L := fun aa => IsLocalization.mk' _ aa.1 (if h : aa.2 ∈ S then ⟨aa.2, h⟩ else 1)
-    refine' @Cardinal.mk_le_of_surjective _ _ f fun a => _
-    obtain ⟨x, y, h⟩ := IsLocalization.mk'_surjective S a
-    use (x, y)
-    dsimp [f]
-    rwa [dif_pos <| show ↑y ∈ S from y.2, SetLike.eta]
+  cases fintypeOrInfinite R
+  · exact Cardinal.mk_le_of_surjective (IsArtinianRing.localization_surjective S _)
+  erw [← Cardinal.mul_eq_self <| Cardinal.aleph0_le_mk R]
+  set f : R × R → L := fun aa => IsLocalization.mk' _ aa.1 (if h : aa.2 ∈ S then ⟨aa.2, h⟩ else 1)
+  refine' @Cardinal.mk_le_of_surjective _ _ f fun a => _
+  obtain ⟨x, y, h⟩ := IsLocalization.mk'_surjective S a
+  use (x, y)
+  dsimp [f]
+  rwa [dif_pos <| show ↑y ∈ S from y.2, SetLike.eta]
 #align is_localization.card_le IsLocalization.card_le
 -/

38df578a

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -31,7 +31,7 @@ submonoid, then your localization is trivial (see `is_localization.unique_of_zer
 -/
 
 
-open Cardinal nonZeroDivisors
+open scoped Cardinal nonZeroDivisors
 
 universe u v

38df578a

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -60,12 +60,6 @@ theorem card_le : (#L) ≤ (#R) := by
 
 variable (L)
 
-/- warning: is_localization.card -> IsLocalization.card is a dubious translation:
-lean 3 declaration is
-  forall {R : Type.{u1}} [_inst_1 : CommRing.{u1} R] (S : Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (NonAssocRing.toNonAssocSemiring.{u1} R (Ring.toNonAssocRing.{u1} R (CommRing.toRing.{u1} R _inst_1)))))) (L : Type.{u1}) [_inst_2 : CommRing.{u1} L] [_inst_3 : Algebra.{u1, u1} R L (CommRing.toCommSemiring.{u1} R _inst_1) (Ring.toSemiring.{u1} L (CommRing.toRing.{u1} L _inst_2))] [_inst_4 : IsLocalization.{u1, u1} R (CommRing.toCommSemiring.{u1} R _inst_1) S L (CommRing.toCommSemiring.{u1} L _inst_2) _inst_3], (LE.le.{u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (NonAssocRing.toNonAssocSemiring.{u1} R (Ring.toNonAssocRing.{u1} R (CommRing.toRing.{u1} R _inst_1)))))) (Preorder.toHasLe.{u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (NonAssocRing.toNonAssocSemiring.{u1} R (Ring.toNonAssocRing.{u1} R (CommRing.toRing.{u1} R _inst_1)))))) (PartialOrder.toPreorder.{u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (NonAssocRing.toNonAssocSemiring.{u1} R (Ring.toNonAssocRing.{u1} R (CommRing.toRing.{u1} R _inst_1)))))) (SetLike.partialOrder.{u1, u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (NonAssocRing.toNonAssocSemiring.{u1} R (Ring.toNonAssocRing.{u1} R (CommRing.toRing.{u1} R _inst_1)))))) R (Submonoid.setLike.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (NonAssocRing.toNonAssocSemiring.{u1} R (Ring.toNonAssocRing.{u1} R (CommRing.toRing.{u1} R _inst_1))))))))) S (nonZeroDivisors.{u1} R (Semiring.toMonoidWithZero.{u1} R (Ring.toSemiring.{u1} R (CommRing.toRing.{u1} R _inst_1))))) -> (Eq.{succ (succ u1)} Cardinal.{u1} (Cardinal.mk.{u1} R) (Cardinal.mk.{u1} L))
-but is expected to have type
-  forall {R : Type.{u1}} [_inst_1 : CommRing.{u1} R] (S : Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (Semiring.toNonAssocSemiring.{u1} R (CommSemiring.toSemiring.{u1} R (CommRing.toCommSemiring.{u1} R _inst_1)))))) (L : Type.{u1}) [_inst_2 : CommRing.{u1} L] [_inst_3 : Algebra.{u1, u1} R L (CommRing.toCommSemiring.{u1} R _inst_1) (CommSemiring.toSemiring.{u1} L (CommRing.toCommSemiring.{u1} L _inst_2))] [_inst_4 : IsLocalization.{u1, u1} R (CommRing.toCommSemiring.{u1} R _inst_1) S L (CommRing.toCommSemiring.{u1} L _inst_2) _inst_3], (LE.le.{u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (Semiring.toNonAssocSemiring.{u1} R (CommSemiring.toSemiring.{u1} R (CommRing.toCommSemiring.{u1} R _inst_1)))))) (Preorder.toLE.{u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (Semiring.toNonAssocSemiring.{u1} R (CommSemiring.toSemiring.{u1} R (CommRing.toCommSemiring.{u1} R _inst_1)))))) (PartialOrder.toPreorder.{u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (Semiring.toNonAssocSemiring.{u1} R (CommSemiring.toSemiring.{u1} R (CommRing.toCommSemiring.{u1} R _inst_1)))))) (OmegaCompletePartialOrder.toPartialOrder.{u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (Semiring.toNonAssocSemiring.{u1} R (CommSemiring.toSemiring.{u1} R (CommRing.toCommSemiring.{u1} R _inst_1)))))) (CompleteLattice.instOmegaCompletePartialOrder.{u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (Semiring.toNonAssocSemiring.{u1} R (CommSemiring.toSemiring.{u1} R (CommRing.toCommSemiring.{u1} R _inst_1)))))) (Submonoid.instCompleteLatticeSubmonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (Semiring.toNonAssocSemiring.{u1} R (CommSemiring.toSemiring.{u1} R (CommRing.toCommSemiring.{u1} R _inst_1)))))))))) S (nonZeroDivisors.{u1} R (Semiring.toMonoidWithZero.{u1} R (CommSemiring.toSemiring.{u1} R (CommRing.toCommSemiring.{u1} R _inst_1))))) -> (Eq.{succ (succ u1)} Cardinal.{u1} (Cardinal.mk.{u1} R) (Cardinal.mk.{u1} L))
-Case conversion may be inaccurate. Consider using '#align is_localization.card IsLocalization.cardₓ'. -/
 /-- If you do not localize at any zero-divisors, localization preserves cardinality. -/
 theorem card (hS : S ≤ R⁰) : (#R) = (#L) :=
   (Cardinal.mk_le_of_injective (IsLocalization.injective L hS)).antisymm (card_le S)

38df578a

bump to nightly-2023-05-24-03

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

2c55cf2c

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Eric Rodriguez
 
 ! This file was ported from Lean 3 source module ring_theory.localization.cardinality
-! leanprover-community/mathlib commit 3b09a2601bb7690643936643e99bba0fedfbf6ed
+! leanprover-community/mathlib commit 38df578a6450a8c5142b3727e3ae894c2300cae0
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -14,6 +14,9 @@ import Mathbin.RingTheory.Artinian
 /-!
 # Cardinality of localizations
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 In this file, we establish the cardinality of localizations. In most cases, a localization has
 cardinality equal to the base ring. If there are zero-divisors, however, this is no longer true -
 for example, `zmod 6` localized at `{2, 4}` is equal to `zmod 3`, and if you have zero in your

3b09a260

bump to nightly-2023-05-23-03

mathlib commit https://github.com/leanprover-community/mathlib/commit/75e7fca56381d056096ce5d05e938f63a6567828

ed98987c

Diff

@@ -39,6 +39,7 @@ variable {R : Type u} [CommRing R] (S : Submonoid R) {L : Type u} [CommRing L] [
 
 include S
 
+#print IsLocalization.card_le /-
 /-- A localization always has cardinality less than or equal to the base ring. -/
 theorem card_le : (#L) ≤ (#R) := by
   classical
@@ -52,9 +53,16 @@ theorem card_le : (#L) ≤ (#R) := by
     dsimp [f]
     rwa [dif_pos <| show ↑y ∈ S from y.2, SetLike.eta]
 #align is_localization.card_le IsLocalization.card_le
+-/
 
 variable (L)
 
+/- warning: is_localization.card -> IsLocalization.card is a dubious translation:
+lean 3 declaration is
+  forall {R : Type.{u1}} [_inst_1 : CommRing.{u1} R] (S : Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (NonAssocRing.toNonAssocSemiring.{u1} R (Ring.toNonAssocRing.{u1} R (CommRing.toRing.{u1} R _inst_1)))))) (L : Type.{u1}) [_inst_2 : CommRing.{u1} L] [_inst_3 : Algebra.{u1, u1} R L (CommRing.toCommSemiring.{u1} R _inst_1) (Ring.toSemiring.{u1} L (CommRing.toRing.{u1} L _inst_2))] [_inst_4 : IsLocalization.{u1, u1} R (CommRing.toCommSemiring.{u1} R _inst_1) S L (CommRing.toCommSemiring.{u1} L _inst_2) _inst_3], (LE.le.{u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (NonAssocRing.toNonAssocSemiring.{u1} R (Ring.toNonAssocRing.{u1} R (CommRing.toRing.{u1} R _inst_1)))))) (Preorder.toHasLe.{u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (NonAssocRing.toNonAssocSemiring.{u1} R (Ring.toNonAssocRing.{u1} R (CommRing.toRing.{u1} R _inst_1)))))) (PartialOrder.toPreorder.{u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (NonAssocRing.toNonAssocSemiring.{u1} R (Ring.toNonAssocRing.{u1} R (CommRing.toRing.{u1} R _inst_1)))))) (SetLike.partialOrder.{u1, u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (NonAssocRing.toNonAssocSemiring.{u1} R (Ring.toNonAssocRing.{u1} R (CommRing.toRing.{u1} R _inst_1)))))) R (Submonoid.setLike.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (NonAssocRing.toNonAssocSemiring.{u1} R (Ring.toNonAssocRing.{u1} R (CommRing.toRing.{u1} R _inst_1))))))))) S (nonZeroDivisors.{u1} R (Semiring.toMonoidWithZero.{u1} R (Ring.toSemiring.{u1} R (CommRing.toRing.{u1} R _inst_1))))) -> (Eq.{succ (succ u1)} Cardinal.{u1} (Cardinal.mk.{u1} R) (Cardinal.mk.{u1} L))
+but is expected to have type
+  forall {R : Type.{u1}} [_inst_1 : CommRing.{u1} R] (S : Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (Semiring.toNonAssocSemiring.{u1} R (CommSemiring.toSemiring.{u1} R (CommRing.toCommSemiring.{u1} R _inst_1)))))) (L : Type.{u1}) [_inst_2 : CommRing.{u1} L] [_inst_3 : Algebra.{u1, u1} R L (CommRing.toCommSemiring.{u1} R _inst_1) (CommSemiring.toSemiring.{u1} L (CommRing.toCommSemiring.{u1} L _inst_2))] [_inst_4 : IsLocalization.{u1, u1} R (CommRing.toCommSemiring.{u1} R _inst_1) S L (CommRing.toCommSemiring.{u1} L _inst_2) _inst_3], (LE.le.{u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (Semiring.toNonAssocSemiring.{u1} R (CommSemiring.toSemiring.{u1} R (CommRing.toCommSemiring.{u1} R _inst_1)))))) (Preorder.toLE.{u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (Semiring.toNonAssocSemiring.{u1} R (CommSemiring.toSemiring.{u1} R (CommRing.toCommSemiring.{u1} R _inst_1)))))) (PartialOrder.toPreorder.{u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (Semiring.toNonAssocSemiring.{u1} R (CommSemiring.toSemiring.{u1} R (CommRing.toCommSemiring.{u1} R _inst_1)))))) (OmegaCompletePartialOrder.toPartialOrder.{u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (Semiring.toNonAssocSemiring.{u1} R (CommSemiring.toSemiring.{u1} R (CommRing.toCommSemiring.{u1} R _inst_1)))))) (CompleteLattice.instOmegaCompletePartialOrder.{u1} (Submonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (Semiring.toNonAssocSemiring.{u1} R (CommSemiring.toSemiring.{u1} R (CommRing.toCommSemiring.{u1} R _inst_1)))))) (Submonoid.instCompleteLatticeSubmonoid.{u1} R (MulZeroOneClass.toMulOneClass.{u1} R (NonAssocSemiring.toMulZeroOneClass.{u1} R (Semiring.toNonAssocSemiring.{u1} R (CommSemiring.toSemiring.{u1} R (CommRing.toCommSemiring.{u1} R _inst_1)))))))))) S (nonZeroDivisors.{u1} R (Semiring.toMonoidWithZero.{u1} R (CommSemiring.toSemiring.{u1} R (CommRing.toCommSemiring.{u1} R _inst_1))))) -> (Eq.{succ (succ u1)} Cardinal.{u1} (Cardinal.mk.{u1} R) (Cardinal.mk.{u1} L))
+Case conversion may be inaccurate. Consider using '#align is_localization.card IsLocalization.cardₓ'. -/
 /-- If you do not localize at any zero-divisors, localization preserves cardinality. -/
 theorem card (hS : S ≤ R⁰) : (#R) = (#L) :=
   (Cardinal.mk_le_of_injective (IsLocalization.injective L hS)).antisymm (card_le S)

3b09a260

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

3b09a260

chore: more backporting of simp changes from #10995 (#11001)

Co-authored-by: Patrick Massot <patrickmassot@free.fr> Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

d9589c14

Diff

@@ -44,7 +44,7 @@ theorem card_le : #L ≤ #R := by
     refine' @Cardinal.mk_le_of_surjective _ _ f fun a => _
     obtain ⟨x, y, h⟩ := IsLocalization.mk'_surjective S a
     use (x, y)
-    dsimp
+    dsimp [f]
     rwa [dif_pos <| show ↑y ∈ S from y.2, SetLike.eta]
 #align is_localization.card_le IsLocalization.card_le

3b09a260

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,15 +2,12 @@
 Copyright (c) 2022 Eric Rodriguez. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Eric Rodriguez
-
-! This file was ported from Lean 3 source module ring_theory.localization.cardinality
-! leanprover-community/mathlib commit 3b09a2601bb7690643936643e99bba0fedfbf6ed
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.SetTheory.Cardinal.Ordinal
 import Mathlib.RingTheory.Artinian
 
+#align_import ring_theory.localization.cardinality from "leanprover-community/mathlib"@"3b09a2601bb7690643936643e99bba0fedfbf6ed"
+
 /-!
 # Cardinality of localizations

3b09a260

fix: precedence of # (#5623)

d450fcd7

Diff

@@ -38,7 +38,7 @@ variable {R : Type u} [CommRing R] (S : Submonoid R) {L : Type u} [CommRing L] [
   [IsLocalization S L]
 
 /-- A localization always has cardinality less than or equal to the base ring. -/
-theorem card_le : (#L) ≤ (#R) := by
+theorem card_le : #L ≤ #R := by
   classical
     cases fintypeOrInfinite R
     · exact Cardinal.mk_le_of_surjective (IsArtinianRing.localization_surjective S _)
@@ -54,7 +54,7 @@ theorem card_le : (#L) ≤ (#R) := by
 variable (L)
 
 /-- If you do not localize at any zero-divisors, localization preserves cardinality. -/
-theorem card (hS : S ≤ R⁰) : (#R) = (#L) :=
+theorem card (hS : S ≤ R⁰) : #R = #L :=
   (Cardinal.mk_le_of_injective (IsLocalization.injective L hS)).antisymm (card_le S)
 #align is_localization.card IsLocalization.card

3b09a260

feat: port RingTheory.Localization.Cardinality (#4192)

c6afc89a

`ring_theory.localization.cardinality` ⟷ `Mathlib.RingTheory.Localization.Cardinality`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 8 + 553

ring_theory.localization.cardinality ⟷ Mathlib.RingTheory.Localization.Cardinality

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 8 + 553

`ring_theory.localization.cardinality` ⟷ `Mathlib.RingTheory.Localization.Cardinality`