data.finsupp.pwo | 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

59694bd0

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

f16e7a22

bump to nightly-2024-01-11-06

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

c7c71e9e

Diff

@@ -29,15 +29,15 @@ Dickson, order, partial well order
 -/
 
 
-#print Finsupp.isPwo /-
+#print Finsupp.isPWO /-
 /-- A version of **Dickson's lemma** any subset of functions `σ →₀ α` is partially well
 ordered, when `σ` is `finite` and `α` is a linear well order.
 This version uses finsupps on a finite type as it is intended for use with `mv_power_series`.
 -/
-theorem Finsupp.isPwo {α σ : Type _} [Zero α] [LinearOrder α] [IsWellOrder α (· < ·)] [Finite σ]
-    (S : Set (σ →₀ α)) : S.IsPwo :=
+theorem Finsupp.isPWO {α σ : Type _} [Zero α] [LinearOrder α] [IsWellOrder α (· < ·)] [Finite σ]
+    (S : Set (σ →₀ α)) : S.IsPWO :=
   Finsupp.equivFunOnFinite.symm_image_image S ▸
-    Set.PartiallyWellOrderedOn.image_of_monotone_on (Pi.isPwo _) fun a b ha hb => id
-#align finsupp.is_pwo Finsupp.isPwo
+    Set.PartiallyWellOrderedOn.image_of_monotone_on (Pi.isPWO _) fun a b ha hb => id
+#align finsupp.is_pwo Finsupp.isPWO
 -/

f16e7a22

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 Alex J. Best. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Alex J. Best
 -/
-import Mathbin.Data.Finsupp.Order
-import Mathbin.Order.WellFoundedSet
+import Data.Finsupp.Order
+import Order.WellFoundedSet
 
 #align_import data.finsupp.pwo from "leanprover-community/mathlib"@"f16e7a22e11fc09c71f25446ac1db23a24e8a0bd"

f16e7a22

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 Alex J. Best. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Alex J. Best
-
-! This file was ported from Lean 3 source module data.finsupp.pwo
-! leanprover-community/mathlib commit f16e7a22e11fc09c71f25446ac1db23a24e8a0bd
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Data.Finsupp.Order
 import Mathbin.Order.WellFoundedSet
 
+#align_import data.finsupp.pwo from "leanprover-community/mathlib"@"f16e7a22e11fc09c71f25446ac1db23a24e8a0bd"
+
 /-!
 # Partial well ordering on finsupps

f16e7a22

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -32,6 +32,7 @@ Dickson, order, partial well order
 -/
 
 
+#print Finsupp.isPwo /-
 /-- A version of **Dickson's lemma** any subset of functions `σ →₀ α` is partially well
 ordered, when `σ` is `finite` and `α` is a linear well order.
 This version uses finsupps on a finite type as it is intended for use with `mv_power_series`.
@@ -41,4 +42,5 @@ theorem Finsupp.isPwo {α σ : Type _} [Zero α] [LinearOrder α] [IsWellOrder 
   Finsupp.equivFunOnFinite.symm_image_image S ▸
     Set.PartiallyWellOrderedOn.image_of_monotone_on (Pi.isPwo _) fun a b ha hb => id
 #align finsupp.is_pwo Finsupp.isPwo
+-/

f16e7a22

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -32,12 +32,6 @@ Dickson, order, partial well order
 -/
 
 
-/- warning: finsupp.is_pwo -> Finsupp.isPwo is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {σ : Type.{u2}} [_inst_1 : Zero.{u1} α] [_inst_2 : LinearOrder.{u1} α] [_inst_3 : IsWellOrder.{u1} α (LT.lt.{u1} α (Preorder.toHasLt.{u1} α (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (LinearOrder.toLattice.{u1} α _inst_2))))))] [_inst_4 : Finite.{succ u2} σ] (S : Set.{max u2 u1} (Finsupp.{u2, u1} σ α _inst_1)), Set.IsPwo.{max u2 u1} (Finsupp.{u2, u1} σ α _inst_1) (Finsupp.preorder.{u2, u1} σ α _inst_1 (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (LinearOrder.toLattice.{u1} α _inst_2))))) S
-but is expected to have type
-  forall {α : Type.{u2}} {σ : Type.{u1}} [_inst_1 : Zero.{u2} α] [_inst_2 : LinearOrder.{u2} α] [_inst_3 : IsWellOrder.{u2} α (fun (x._@.Mathlib.Data.Finsupp.Pwo._hyg.21 : α) (x._@.Mathlib.Data.Finsupp.Pwo._hyg.23 : α) => LT.lt.{u2} α (Preorder.toLT.{u2} α (PartialOrder.toPreorder.{u2} α (SemilatticeInf.toPartialOrder.{u2} α (Lattice.toSemilatticeInf.{u2} α (DistribLattice.toLattice.{u2} α (instDistribLattice.{u2} α _inst_2)))))) x._@.Mathlib.Data.Finsupp.Pwo._hyg.21 x._@.Mathlib.Data.Finsupp.Pwo._hyg.23)] [_inst_4 : Finite.{succ u1} σ] (S : Set.{max u2 u1} (Finsupp.{u1, u2} σ α _inst_1)), Set.IsPwo.{max u2 u1} (Finsupp.{u1, u2} σ α _inst_1) (Finsupp.preorder.{u1, u2} σ α _inst_1 (PartialOrder.toPreorder.{u2} α (SemilatticeInf.toPartialOrder.{u2} α (Lattice.toSemilatticeInf.{u2} α (DistribLattice.toLattice.{u2} α (instDistribLattice.{u2} α _inst_2)))))) S
-Case conversion may be inaccurate. Consider using '#align finsupp.is_pwo Finsupp.isPwoₓ'. -/
 /-- A version of **Dickson's lemma** any subset of functions `σ →₀ α` is partially well
 ordered, when `σ` is `finite` and `α` is a linear well order.
 This version uses finsupps on a finite type as it is intended for use with `mv_power_series`.

f16e7a22

bump to nightly-2023-05-16-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/0b9eaaa7686280fad8cce467f5c3c57ee6ce77f8

9cb92e8c

Diff

@@ -34,7 +34,7 @@ Dickson, order, partial well order
 
 /- warning: finsupp.is_pwo -> Finsupp.isPwo is a dubious translation:
 lean 3 declaration is
-  forall {α : Type.{u1}} {σ : Type.{u2}} [_inst_1 : Zero.{u1} α] [_inst_2 : LinearOrder.{u1} α] [_inst_3 : IsWellOrder.{u1} α (LT.lt.{u1} α (Preorder.toLT.{u1} α (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (LinearOrder.toLattice.{u1} α _inst_2))))))] [_inst_4 : Finite.{succ u2} σ] (S : Set.{max u2 u1} (Finsupp.{u2, u1} σ α _inst_1)), Set.IsPwo.{max u2 u1} (Finsupp.{u2, u1} σ α _inst_1) (Finsupp.preorder.{u2, u1} σ α _inst_1 (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (LinearOrder.toLattice.{u1} α _inst_2))))) S
+  forall {α : Type.{u1}} {σ : Type.{u2}} [_inst_1 : Zero.{u1} α] [_inst_2 : LinearOrder.{u1} α] [_inst_3 : IsWellOrder.{u1} α (LT.lt.{u1} α (Preorder.toHasLt.{u1} α (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (LinearOrder.toLattice.{u1} α _inst_2))))))] [_inst_4 : Finite.{succ u2} σ] (S : Set.{max u2 u1} (Finsupp.{u2, u1} σ α _inst_1)), Set.IsPwo.{max u2 u1} (Finsupp.{u2, u1} σ α _inst_1) (Finsupp.preorder.{u2, u1} σ α _inst_1 (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (LinearOrder.toLattice.{u1} α _inst_2))))) S
 but is expected to have type
   forall {α : Type.{u2}} {σ : Type.{u1}} [_inst_1 : Zero.{u2} α] [_inst_2 : LinearOrder.{u2} α] [_inst_3 : IsWellOrder.{u2} α (fun (x._@.Mathlib.Data.Finsupp.Pwo._hyg.21 : α) (x._@.Mathlib.Data.Finsupp.Pwo._hyg.23 : α) => LT.lt.{u2} α (Preorder.toLT.{u2} α (PartialOrder.toPreorder.{u2} α (SemilatticeInf.toPartialOrder.{u2} α (Lattice.toSemilatticeInf.{u2} α (DistribLattice.toLattice.{u2} α (instDistribLattice.{u2} α _inst_2)))))) x._@.Mathlib.Data.Finsupp.Pwo._hyg.21 x._@.Mathlib.Data.Finsupp.Pwo._hyg.23)] [_inst_4 : Finite.{succ u1} σ] (S : Set.{max u2 u1} (Finsupp.{u1, u2} σ α _inst_1)), Set.IsPwo.{max u2 u1} (Finsupp.{u1, u2} σ α _inst_1) (Finsupp.preorder.{u1, u2} σ α _inst_1 (PartialOrder.toPreorder.{u2} α (SemilatticeInf.toPartialOrder.{u2} α (Lattice.toSemilatticeInf.{u2} α (DistribLattice.toLattice.{u2} α (instDistribLattice.{u2} α _inst_2)))))) S
 Case conversion may be inaccurate. Consider using '#align finsupp.is_pwo Finsupp.isPwoₓ'. -/

f16e7a22

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

59694bd0

chore(*): rename IsPwo to IsPWO (#9582)

Rename Set.IsPwo → Set.IsPWO and Set.IsWf → Set.IsWF.

400ca883

Diff

@@ -17,7 +17,7 @@ It is in a separate file for now so as to not add imports to the file `Order.Wel
 
 ## Main statements
 
-* `Finsupp.isPwo` - finitely supported functions from a fintype are partially well ordered when
+* `Finsupp.isPWO` - finitely supported functions from a fintype are partially well ordered when
   the codomain is a linear order that is well ordered
 
 ## Tags
@@ -30,8 +30,8 @@ Dickson, order, partial well order
 ordered, when `σ` is `Finite` and `α` is a linear well order.
 This version uses finsupps on a finite type as it is intended for use with `MVPowerSeries`.
 -/
-theorem Finsupp.isPwo {α σ : Type*} [Zero α] [LinearOrder α] [IsWellOrder α (· < ·)] [Finite σ]
-    (S : Set (σ →₀ α)) : S.IsPwo :=
+theorem Finsupp.isPWO {α σ : Type*} [Zero α] [LinearOrder α] [IsWellOrder α (· < ·)] [Finite σ]
+    (S : Set (σ →₀ α)) : S.IsPWO :=
   Finsupp.equivFunOnFinite.symm_image_image S ▸
-    Set.PartiallyWellOrderedOn.image_of_monotone_on (Pi.isPwo _) fun _a _b _ha _hb => id
-#align finsupp.is_pwo Finsupp.isPwo
+    Set.PartiallyWellOrderedOn.image_of_monotone_on (Pi.isPWO _) fun _a _b _ha _hb => id
+#align finsupp.is_pwo Finsupp.isPWO

59694bd0

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

@@ -30,7 +30,7 @@ Dickson, order, partial well order
 ordered, when `σ` is `Finite` and `α` is a linear well order.
 This version uses finsupps on a finite type as it is intended for use with `MVPowerSeries`.
 -/
-theorem Finsupp.isPwo {α σ : Type _} [Zero α] [LinearOrder α] [IsWellOrder α (· < ·)] [Finite σ]
+theorem Finsupp.isPwo {α σ : Type*} [Zero α] [LinearOrder α] [IsWellOrder α (· < ·)] [Finite σ]
     (S : Set (σ →₀ α)) : S.IsPwo :=
   Finsupp.equivFunOnFinite.symm_image_image S ▸
     Set.PartiallyWellOrderedOn.image_of_monotone_on (Pi.isPwo _) fun _a _b _ha _hb => id

59694bd0

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 Alex J. Best. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Alex J. Best
-
-! This file was ported from Lean 3 source module data.finsupp.pwo
-! leanprover-community/mathlib commit 59694bd07f0a39c5beccba34bd9f413a160782bf
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Data.Finsupp.Order
 import Mathlib.Order.WellFoundedSet
 
+#align_import data.finsupp.pwo from "leanprover-community/mathlib"@"59694bd07f0a39c5beccba34bd9f413a160782bf"
+
 /-!
 # Partial well ordering on finsupps

59694bd0

feat: Port/Data.Finsupp.Pwo (#1989)

port of data.finsupp.pwo

no changes beyond docu/lint fixes

888bb9e5

`data.finsupp.pwo` ⟷ `Mathlib.Data.Finsupp.PWO`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 7 + 265

data.finsupp.pwo ⟷ Mathlib.Data.Finsupp.PWO

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 7 + 265

`data.finsupp.pwo` ⟷ `Mathlib.Data.Finsupp.PWO`