order.category.CompleteLat | 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

e8ac6315

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

8af7091a

bump to nightly-2024-01-19-06

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

33b57512

Diff

@@ -59,7 +59,7 @@ instance : BundledHom @CompleteLatticeHom
   toFun _ _ _ _ := coeFn
   id := @CompleteLatticeHom.id
   comp := @CompleteLatticeHom.comp
-  hom_ext X Y _ _ := FunLike.coe_injective
+  hom_ext X Y _ _ := DFunLike.coe_injective
 
 instance : LargeCategory.{u} CompleteLat :=
   BundledHom.category CompleteLatticeHom

8af7091a

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 Yaël Dillies. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yaël Dillies
 -/
-import Mathbin.Order.Category.BddLat
-import Mathbin.Order.Hom.CompleteLattice
+import Order.Category.BddLat
+import Order.Hom.CompleteLattice
 
 #align_import order.category.CompleteLat from "leanprover-community/mathlib"@"8af7091a43227e179939ba132e54e54e9f3b089a"
 
@@ -22,36 +22,36 @@ universe u
 
 open CategoryTheory
 
-#print CompleteLatCat /-
+#print CompleteLat /-
 /-- The category of complete lattices. -/
-def CompleteLatCat :=
+def CompleteLat :=
   Bundled CompleteLattice
-#align CompleteLat CompleteLatCat
+#align CompleteLat CompleteLat
 -/
 
-namespace CompleteLatCat
+namespace CompleteLat
 
-instance : CoeSort CompleteLatCat (Type _) :=
+instance : CoeSort CompleteLat (Type _) :=
   Bundled.hasCoeToSort
 
-instance (X : CompleteLatCat) : CompleteLattice X :=
+instance (X : CompleteLat) : CompleteLattice X :=
   X.str
 
-#print CompleteLatCat.of /-
+#print CompleteLat.of /-
 /-- Construct a bundled `CompleteLat` from a `complete_lattice`. -/
-def of (α : Type _) [CompleteLattice α] : CompleteLatCat :=
+def of (α : Type _) [CompleteLattice α] : CompleteLat :=
   Bundled.of α
-#align CompleteLat.of CompleteLatCat.of
+#align CompleteLat.of CompleteLat.of
 -/
 
-#print CompleteLatCat.coe_of /-
+#print CompleteLat.coe_of /-
 @[simp]
 theorem coe_of (α : Type _) [CompleteLattice α] : ↥(of α) = α :=
   rfl
-#align CompleteLat.coe_of CompleteLatCat.coe_of
+#align CompleteLat.coe_of CompleteLat.coe_of
 -/
 
-instance : Inhabited CompleteLatCat :=
+instance : Inhabited CompleteLat :=
   ⟨of PUnit⟩
 
 instance : BundledHom @CompleteLatticeHom
@@ -61,61 +61,59 @@ instance : BundledHom @CompleteLatticeHom
   comp := @CompleteLatticeHom.comp
   hom_ext X Y _ _ := FunLike.coe_injective
 
-instance : LargeCategory.{u} CompleteLatCat :=
+instance : LargeCategory.{u} CompleteLat :=
   BundledHom.category CompleteLatticeHom
 
-instance : ConcreteCategory CompleteLatCat :=
+instance : ConcreteCategory CompleteLat :=
   BundledHom.concreteCategory CompleteLatticeHom
 
-#print CompleteLatCat.hasForgetToBddLat /-
-instance hasForgetToBddLat : HasForget₂ CompleteLatCat BddLatCat
+#print CompleteLat.hasForgetToBddLat /-
+instance hasForgetToBddLat : HasForget₂ CompleteLat BddLat
     where
   forget₂ :=
-    { obj := fun X => BddLatCat.of X
+    { obj := fun X => BddLat.of X
       map := fun X Y => CompleteLatticeHom.toBoundedLatticeHom }
   forget_comp := rfl
-#align CompleteLat.has_forget_to_BddLat CompleteLatCat.hasForgetToBddLat
+#align CompleteLat.has_forget_to_BddLat CompleteLat.hasForgetToBddLat
 -/
 
-#print CompleteLatCat.Iso.mk /-
+#print CompleteLat.Iso.mk /-
 /-- Constructs an isomorphism of complete lattices from an order isomorphism between them. -/
 @[simps]
-def Iso.mk {α β : CompleteLatCat.{u}} (e : α ≃o β) : α ≅ β
+def Iso.mk {α β : CompleteLat.{u}} (e : α ≃o β) : α ≅ β
     where
   Hom := e
   inv := e.symm
   hom_inv_id' := by ext; exact e.symm_apply_apply _
   inv_hom_id' := by ext; exact e.apply_symm_apply _
-#align CompleteLat.iso.mk CompleteLatCat.Iso.mk
+#align CompleteLat.iso.mk CompleteLat.Iso.mk
 -/
 
-#print CompleteLatCat.dual /-
+#print CompleteLat.dual /-
 /-- `order_dual` as a functor. -/
 @[simps]
-def dual : CompleteLatCat ⥤ CompleteLatCat
-    where
+def dual : CompleteLat ⥤ CompleteLat where
   obj X := of Xᵒᵈ
   map X Y := CompleteLatticeHom.dual
-#align CompleteLat.dual CompleteLatCat.dual
+#align CompleteLat.dual CompleteLat.dual
 -/
 
-#print CompleteLatCat.dualEquiv /-
+#print CompleteLat.dualEquiv /-
 /-- The equivalence between `CompleteLat` and itself induced by `order_dual` both ways. -/
 @[simps Functor inverse]
-def dualEquiv : CompleteLatCat ≌ CompleteLatCat :=
+def dualEquiv : CompleteLat ≌ CompleteLat :=
   Equivalence.mk dual dual
     (NatIso.ofComponents (fun X => Iso.mk <| OrderIso.dualDual X) fun X Y f => rfl)
     (NatIso.ofComponents (fun X => Iso.mk <| OrderIso.dualDual X) fun X Y f => rfl)
-#align CompleteLat.dual_equiv CompleteLatCat.dualEquiv
+#align CompleteLat.dual_equiv CompleteLat.dualEquiv
 -/
 
-end CompleteLatCat
+end CompleteLat
 
-#print completeLatCat_dual_comp_forget_to_bddLatCat /-
-theorem completeLatCat_dual_comp_forget_to_bddLatCat :
-    CompleteLatCat.dual ⋙ forget₂ CompleteLatCat BddLatCat =
-      forget₂ CompleteLatCat BddLatCat ⋙ BddLatCat.dual :=
+#print completeLat_dual_comp_forget_to_bddLat /-
+theorem completeLat_dual_comp_forget_to_bddLat :
+    CompleteLat.dual ⋙ forget₂ CompleteLat BddLat = forget₂ CompleteLat BddLat ⋙ BddLat.dual :=
   rfl
-#align CompleteLat_dual_comp_forget_to_BddLat completeLatCat_dual_comp_forget_to_bddLatCat
+#align CompleteLat_dual_comp_forget_to_BddLat completeLat_dual_comp_forget_to_bddLat
 -/

8af7091a

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 Yaël Dillies. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yaël Dillies
-
-! This file was ported from Lean 3 source module order.category.CompleteLat
-! leanprover-community/mathlib commit 8af7091a43227e179939ba132e54e54e9f3b089a
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Order.Category.BddLat
 import Mathbin.Order.Hom.CompleteLattice
 
+#align_import order.category.CompleteLat from "leanprover-community/mathlib"@"8af7091a43227e179939ba132e54e54e9f3b089a"
+
 /-!
 # The category of complete lattices

8af7091a

bump to nightly-2023-06-18-23

mathlib commit https://github.com/leanprover-community/mathlib/commit/2a0ce625dbb0ffbc7d1316597de0b25c1ec75303

3b5e23dc

Diff

@@ -25,30 +25,36 @@ universe u
 
 open CategoryTheory
 
+#print CompleteLatCat /-
 /-- The category of complete lattices. -/
-def CompleteLat :=
+def CompleteLatCat :=
   Bundled CompleteLattice
-#align CompleteLat CompleteLat
+#align CompleteLat CompleteLatCat
+-/
 
-namespace CompleteLat
+namespace CompleteLatCat
 
-instance : CoeSort CompleteLat (Type _) :=
+instance : CoeSort CompleteLatCat (Type _) :=
   Bundled.hasCoeToSort
 
-instance (X : CompleteLat) : CompleteLattice X :=
+instance (X : CompleteLatCat) : CompleteLattice X :=
   X.str
 
+#print CompleteLatCat.of /-
 /-- Construct a bundled `CompleteLat` from a `complete_lattice`. -/
-def of (α : Type _) [CompleteLattice α] : CompleteLat :=
+def of (α : Type _) [CompleteLattice α] : CompleteLatCat :=
   Bundled.of α
-#align CompleteLat.of CompleteLat.of
+#align CompleteLat.of CompleteLatCat.of
+-/
 
+#print CompleteLatCat.coe_of /-
 @[simp]
 theorem coe_of (α : Type _) [CompleteLattice α] : ↥(of α) = α :=
   rfl
-#align CompleteLat.coe_of CompleteLat.coe_of
+#align CompleteLat.coe_of CompleteLatCat.coe_of
+-/
 
-instance : Inhabited CompleteLat :=
+instance : Inhabited CompleteLatCat :=
   ⟨of PUnit⟩
 
 instance : BundledHom @CompleteLatticeHom
@@ -58,49 +64,61 @@ instance : BundledHom @CompleteLatticeHom
   comp := @CompleteLatticeHom.comp
   hom_ext X Y _ _ := FunLike.coe_injective
 
-instance : LargeCategory.{u} CompleteLat :=
+instance : LargeCategory.{u} CompleteLatCat :=
   BundledHom.category CompleteLatticeHom
 
-instance : ConcreteCategory CompleteLat :=
+instance : ConcreteCategory CompleteLatCat :=
   BundledHom.concreteCategory CompleteLatticeHom
 
-instance hasForgetToBddLat : HasForget₂ CompleteLat BddLat
+#print CompleteLatCat.hasForgetToBddLat /-
+instance hasForgetToBddLat : HasForget₂ CompleteLatCat BddLatCat
     where
   forget₂ :=
-    { obj := fun X => BddLat.of X
+    { obj := fun X => BddLatCat.of X
       map := fun X Y => CompleteLatticeHom.toBoundedLatticeHom }
   forget_comp := rfl
-#align CompleteLat.has_forget_to_BddLat CompleteLat.hasForgetToBddLat
+#align CompleteLat.has_forget_to_BddLat CompleteLatCat.hasForgetToBddLat
+-/
 
+#print CompleteLatCat.Iso.mk /-
 /-- Constructs an isomorphism of complete lattices from an order isomorphism between them. -/
 @[simps]
-def Iso.mk {α β : CompleteLat.{u}} (e : α ≃o β) : α ≅ β
+def Iso.mk {α β : CompleteLatCat.{u}} (e : α ≃o β) : α ≅ β
     where
   Hom := e
   inv := e.symm
   hom_inv_id' := by ext; exact e.symm_apply_apply _
   inv_hom_id' := by ext; exact e.apply_symm_apply _
-#align CompleteLat.iso.mk CompleteLat.Iso.mk
+#align CompleteLat.iso.mk CompleteLatCat.Iso.mk
+-/
 
+#print CompleteLatCat.dual /-
 /-- `order_dual` as a functor. -/
 @[simps]
-def dual : CompleteLat ⥤ CompleteLat where
+def dual : CompleteLatCat ⥤ CompleteLatCat
+    where
   obj X := of Xᵒᵈ
   map X Y := CompleteLatticeHom.dual
-#align CompleteLat.dual CompleteLat.dual
+#align CompleteLat.dual CompleteLatCat.dual
+-/
 
+#print CompleteLatCat.dualEquiv /-
 /-- The equivalence between `CompleteLat` and itself induced by `order_dual` both ways. -/
 @[simps Functor inverse]
-def dualEquiv : CompleteLat ≌ CompleteLat :=
+def dualEquiv : CompleteLatCat ≌ CompleteLatCat :=
   Equivalence.mk dual dual
     (NatIso.ofComponents (fun X => Iso.mk <| OrderIso.dualDual X) fun X Y f => rfl)
     (NatIso.ofComponents (fun X => Iso.mk <| OrderIso.dualDual X) fun X Y f => rfl)
-#align CompleteLat.dual_equiv CompleteLat.dualEquiv
+#align CompleteLat.dual_equiv CompleteLatCat.dualEquiv
+-/
 
-end CompleteLat
+end CompleteLatCat
 
-theorem completeLat_dual_comp_forget_to_bddLat :
-    CompleteLat.dual ⋙ forget₂ CompleteLat BddLat = forget₂ CompleteLat BddLat ⋙ BddLat.dual :=
+#print completeLatCat_dual_comp_forget_to_bddLatCat /-
+theorem completeLatCat_dual_comp_forget_to_bddLatCat :
+    CompleteLatCat.dual ⋙ forget₂ CompleteLatCat BddLatCat =
+      forget₂ CompleteLatCat BddLatCat ⋙ BddLatCat.dual :=
   rfl
-#align CompleteLat_dual_comp_forget_to_BddLat completeLat_dual_comp_forget_to_bddLat
+#align CompleteLat_dual_comp_forget_to_BddLat completeLatCat_dual_comp_forget_to_bddLatCat
+-/

8af7091a

bump to nightly-2023-06-16-03

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

39cf1563

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yaël Dillies
 
 ! This file was ported from Lean 3 source module order.category.CompleteLat
-! leanprover-community/mathlib commit e8ac6315bcfcbaf2d19a046719c3b553206dac75
+! leanprover-community/mathlib commit 8af7091a43227e179939ba132e54e54e9f3b089a
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -14,6 +14,9 @@ import Mathbin.Order.Hom.CompleteLattice
 /-!
 # The category of complete lattices
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 This file defines `CompleteLat`, the category of complete lattices.
 -/

e8ac6315

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -75,12 +75,8 @@ def Iso.mk {α β : CompleteLat.{u}} (e : α ≃o β) : α ≅ β
     where
   Hom := e
   inv := e.symm
-  hom_inv_id' := by
-    ext
-    exact e.symm_apply_apply _
-  inv_hom_id' := by
-    ext
-    exact e.apply_symm_apply _
+  hom_inv_id' := by ext; exact e.symm_apply_apply _
+  inv_hom_id' := by ext; exact e.apply_symm_apply _
 #align CompleteLat.iso.mk CompleteLat.Iso.mk
 
 /-- `order_dual` as a functor. -/

e8ac6315

bump to nightly-2023-03-30-02

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

af7dd13c

Changes in mathlib4

mathlib3

mathlib4

e8ac6315

chore: classify todo porting notes (#11216)

Classifies by adding issue number #11215 to porting notes claiming "TODO".

86f95a40

Diff

@@ -67,7 +67,7 @@ instance hasForgetToBddLat : HasForget₂ CompleteLat BddLat where
 /-- Constructs an isomorphism of complete lattices from an order isomorphism between them. -/
 @[simps]
 def Iso.mk {α β : CompleteLat.{u}} (e : α ≃o β) : α ≅ β where
-  hom := (e : CompleteLatticeHom _ _) -- Porting note: TODO, wrong?
+  hom := (e : CompleteLatticeHom _ _) -- Porting note (#11215): TODO, wrong?
   inv := (e.symm : CompleteLatticeHom _ _)
   hom_inv_id := by ext; exact e.symm_apply_apply _
   inv_hom_id := by ext; exact e.apply_symm_apply _

e8ac6315

chore(*): rename FunLike to DFunLike (#9785)

This prepares for the introduction of a non-dependent synonym of FunLike, which helps a lot with keeping #8386 readable.

This is entirely search-and-replace in 680197f combined with manual fixes in 4145626, e900597 and b8428f8. The commands that generated this change:

sed -i 's/\bFunLike\b/DFunLike/g' {Archive,Counterexamples,Mathlib,test}/**/*.lean
sed -i 's/\btoFunLike\b/toDFunLike/g' {Archive,Counterexamples,Mathlib,test}/**/*.lean
sed -i 's/import Mathlib.Data.DFunLike/import Mathlib.Data.FunLike/g' {Archive,Counterexamples,Mathlib,test}/**/*.lean
sed -i 's/\bHom_FunLike\b/Hom_DFunLike/g' {Archive,Counterexamples,Mathlib,test}/**/*.lean     
sed -i 's/\binstFunLike\b/instDFunLike/g' {Archive,Counterexamples,Mathlib,test}/**/*.lean
sed -i 's/\bfunLike\b/instDFunLike/g' {Archive,Counterexamples,Mathlib,test}/**/*.lean
sed -i 's/\btoo many metavariables to apply `fun_like.has_coe_to_fun`/too many metavariables to apply `DFunLike.hasCoeToFun`/g' {Archive,Counterexamples,Mathlib,test}/**/*.lean

Co-authored-by: Anne Baanen <Vierkantor@users.noreply.github.com>

82656743

Diff

@@ -50,7 +50,7 @@ instance : BundledHom @CompleteLatticeHom where
   toFun _ _ f := f.toFun
   id := @CompleteLatticeHom.id
   comp := @CompleteLatticeHom.comp
-  hom_ext _ _ _ _ h := FunLike.coe_injective h
+  hom_ext _ _ _ _ h := DFunLike.coe_injective h
 
 deriving instance LargeCategory for CompleteLat

e8ac6315

style: cleanup by putting by on the same line as := (#8407)

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

5e9b46ed

Diff

@@ -54,8 +54,8 @@ instance : BundledHom @CompleteLatticeHom where
 
 deriving instance LargeCategory for CompleteLat
 
-instance : ConcreteCategory CompleteLat :=
-  by dsimp [CompleteLat]; infer_instance
+instance : ConcreteCategory CompleteLat := by
+  dsimp [CompleteLat]; infer_instance
 
 instance hasForgetToBddLat : HasForget₂ CompleteLat BddLat where
   forget₂ :=

e8ac6315

chore: Remove Cat suffixes (#3730)

These names needn't change in the first place.

40fe5127

e8ac6315

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

@@ -27,19 +27,19 @@ def CompleteLatCat :=
 
 namespace CompleteLatCat
 
-instance : CoeSort CompleteLatCat (Type _) :=
+instance : CoeSort CompleteLatCat (Type*) :=
   Bundled.coeSort
 
 instance (X : CompleteLatCat) : CompleteLattice X :=
   X.str
 
 /-- Construct a bundled `CompleteLatCat` from a `CompleteLattice`. -/
-def of (α : Type _) [CompleteLattice α] : CompleteLatCat :=
+def of (α : Type*) [CompleteLattice α] : CompleteLatCat :=
   Bundled.of α
 #align CompleteLat.of CompleteLatCat.of
 
 @[simp]
-theorem coe_of (α : Type _) [CompleteLattice α] : ↥(of α) = α :=
+theorem coe_of (α : Type*) [CompleteLattice α] : ↥(of α) = α :=
   rfl
 #align CompleteLat.coe_of CompleteLatCat.coe_of

e8ac6315

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 Yaël Dillies. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yaël Dillies
-
-! This file was ported from Lean 3 source module order.category.CompleteLat
-! leanprover-community/mathlib commit e8ac6315bcfcbaf2d19a046719c3b553206dac75
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Order.Category.BddLatCat
 import Mathlib.Order.Hom.CompleteLattice
 
+#align_import order.category.CompleteLat from "leanprover-community/mathlib"@"e8ac6315bcfcbaf2d19a046719c3b553206dac75"
+
 /-!
 # The category of complete lattices

e8ac6315

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

@@ -58,7 +58,7 @@ instance : BundledHom @CompleteLatticeHom where
 deriving instance LargeCategory for CompleteLatCat
 
 instance : ConcreteCategory CompleteLatCat :=
-  by dsimp [CompleteLatCat];  infer_instance
+  by dsimp [CompleteLatCat]; infer_instance
 
 instance hasForgetToBddLat : HasForget₂ CompleteLatCat BddLatCat where
   forget₂ :=

e8ac6315

feat: port Order.Category.CompleteLatCat (#5019)

Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>

34a3845a

`order.category.CompleteLat` ⟷ `Mathlib.Order.Category.CompleteLat`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 140

order.category.CompleteLat ⟷ Mathlib.Order.Category.CompleteLat

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 140

`order.category.CompleteLat` ⟷ `Mathlib.Order.Category.CompleteLat`