order.category.BddDistLat | 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-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.Category.DistLat
+import Order.Category.BddLat
+import Order.Category.DistLat
 
 #align_import order.category.BddDistLat from "leanprover-community/mathlib"@"8af7091a43227e179939ba132e54e54e9f3b089a"
 
@@ -25,125 +25,121 @@ universe u
 
 open CategoryTheory
 
-#print BddDistLatCat /-
+#print BddDistLat /-
 /-- The category of bounded distributive lattices with bounded lattice morphisms. -/
-structure BddDistLatCat where
-  toDistLat : DistLatCat
+structure BddDistLat where
+  toDistLat : DistLat
   [isBoundedOrder : BoundedOrder to_DistLat]
-#align BddDistLat BddDistLatCat
+#align BddDistLat BddDistLat
 -/
 
-namespace BddDistLatCat
+namespace BddDistLat
 
-instance : CoeSort BddDistLatCat (Type _) :=
+instance : CoeSort BddDistLat (Type _) :=
   ⟨fun X => X.toDistLat⟩
 
-instance (X : BddDistLatCat) : DistribLattice X :=
+instance (X : BddDistLat) : DistribLattice X :=
   X.toDistLat.str
 
-attribute [instance] BddDistLatCat.isBoundedOrder
+attribute [instance] BddDistLat.isBoundedOrder
 
-#print BddDistLatCat.of /-
+#print BddDistLat.of /-
 /-- Construct a bundled `BddDistLat` from a `bounded_order` `distrib_lattice`. -/
-def of (α : Type _) [DistribLattice α] [BoundedOrder α] : BddDistLatCat :=
+def of (α : Type _) [DistribLattice α] [BoundedOrder α] : BddDistLat :=
   ⟨⟨α⟩⟩
-#align BddDistLat.of BddDistLatCat.of
+#align BddDistLat.of BddDistLat.of
 -/
 
-#print BddDistLatCat.coe_of /-
+#print BddDistLat.coe_of /-
 @[simp]
 theorem coe_of (α : Type _) [DistribLattice α] [BoundedOrder α] : ↥(of α) = α :=
   rfl
-#align BddDistLat.coe_of BddDistLatCat.coe_of
+#align BddDistLat.coe_of BddDistLat.coe_of
 -/
 
-instance : Inhabited BddDistLatCat :=
+instance : Inhabited BddDistLat :=
   ⟨of PUnit⟩
 
-#print BddDistLatCat.toBddLat /-
+#print BddDistLat.toBddLat /-
 /-- Turn a `BddDistLat` into a `BddLat` by forgetting it is distributive. -/
-def toBddLat (X : BddDistLatCat) : BddLatCat :=
-  BddLatCat.of X
-#align BddDistLat.to_BddLat BddDistLatCat.toBddLat
+def toBddLat (X : BddDistLat) : BddLat :=
+  BddLat.of X
+#align BddDistLat.to_BddLat BddDistLat.toBddLat
 -/
 
-/- warning: BddDistLat.coe_to_BddLat clashes with BddDistLatCat.coe_to_BddLat -> BddDistLatCat.coe_toBddLat
-Case conversion may be inaccurate. Consider using '#align BddDistLat.coe_to_BddLat BddDistLatCat.coe_toBddLatₓ'. -/
-#print BddDistLatCat.coe_toBddLat /-
+#print BddDistLat.coe_toBddLat /-
 @[simp]
-theorem coe_toBddLat (X : BddDistLatCat) : ↥X.toBddLat = ↥X :=
+theorem coe_toBddLat (X : BddDistLat) : ↥X.toBddLat = ↥X :=
   rfl
-#align BddDistLat.coe_to_BddLat BddDistLatCat.coe_toBddLat
+#align BddDistLat.coe_to_BddLat BddDistLat.coe_toBddLat
 -/
 
-instance : LargeCategory.{u} BddDistLatCat :=
+instance : LargeCategory.{u} BddDistLat :=
   InducedCategory.category toBddLat
 
-instance : ConcreteCategory BddDistLatCat :=
+instance : ConcreteCategory BddDistLat :=
   InducedCategory.concreteCategory toBddLat
 
-#print BddDistLatCat.hasForgetToDistLat /-
-instance hasForgetToDistLat : HasForget₂ BddDistLatCat DistLatCat
+#print BddDistLat.hasForgetToDistLat /-
+instance hasForgetToDistLat : HasForget₂ BddDistLat DistLat
     where forget₂ :=
     { obj := fun X => ⟨X⟩
       map := fun X Y => BoundedLatticeHom.toLatticeHom }
-#align BddDistLat.has_forget_to_DistLat BddDistLatCat.hasForgetToDistLat
+#align BddDistLat.has_forget_to_DistLat BddDistLat.hasForgetToDistLat
 -/
 
-#print BddDistLatCat.hasForgetToBddLat /-
-instance hasForgetToBddLat : HasForget₂ BddDistLatCat BddLatCat :=
+#print BddDistLat.hasForgetToBddLat /-
+instance hasForgetToBddLat : HasForget₂ BddDistLat BddLat :=
   InducedCategory.hasForget₂ toBddLat
-#align BddDistLat.has_forget_to_BddLat BddDistLatCat.hasForgetToBddLat
+#align BddDistLat.has_forget_to_BddLat BddDistLat.hasForgetToBddLat
 -/
 
-#print BddDistLatCat.forget_bddLat_latCat_eq_forget_distLatCat_latCat /-
-theorem forget_bddLat_latCat_eq_forget_distLatCat_latCat :
-    forget₂ BddDistLatCat BddLatCat ⋙ forget₂ BddLatCat LatCat =
-      forget₂ BddDistLatCat DistLatCat ⋙ forget₂ DistLatCat LatCat :=
+#print BddDistLat.forget_bddLat_lat_eq_forget_distLat_lat /-
+theorem forget_bddLat_lat_eq_forget_distLat_lat :
+    forget₂ BddDistLat BddLat ⋙ forget₂ BddLat Lat =
+      forget₂ BddDistLat DistLat ⋙ forget₂ DistLat Lat :=
   rfl
-#align BddDistLat.forget_BddLat_Lat_eq_forget_DistLat_Lat BddDistLatCat.forget_bddLat_latCat_eq_forget_distLatCat_latCat
+#align BddDistLat.forget_BddLat_Lat_eq_forget_DistLat_Lat BddDistLat.forget_bddLat_lat_eq_forget_distLat_lat
 -/
 
-#print BddDistLatCat.Iso.mk /-
+#print BddDistLat.Iso.mk /-
 /-- Constructs an equivalence between bounded distributive lattices from an order isomorphism
 between them. -/
 @[simps]
-def Iso.mk {α β : BddDistLatCat.{u}} (e : α ≃o β) : α ≅ β
+def Iso.mk {α β : BddDistLat.{u}} (e : α ≃o β) : α ≅ β
     where
   Hom := (e : BoundedLatticeHom α β)
   inv := (e.symm : BoundedLatticeHom β α)
   hom_inv_id' := by ext; exact e.symm_apply_apply _
   inv_hom_id' := by ext; exact e.apply_symm_apply _
-#align BddDistLat.iso.mk BddDistLatCat.Iso.mk
+#align BddDistLat.iso.mk BddDistLat.Iso.mk
 -/
 
-#print BddDistLatCat.dual /-
+#print BddDistLat.dual /-
 /-- `order_dual` as a functor. -/
 @[simps]
-def dual : BddDistLatCat ⥤ BddDistLatCat
-    where
+def dual : BddDistLat ⥤ BddDistLat where
   obj X := of Xᵒᵈ
   map X Y := BoundedLatticeHom.dual
-#align BddDistLat.dual BddDistLatCat.dual
+#align BddDistLat.dual BddDistLat.dual
 -/
 
-#print BddDistLatCat.dualEquiv /-
+#print BddDistLat.dualEquiv /-
 /-- The equivalence between `BddDistLat` and itself induced by `order_dual` both ways. -/
 @[simps Functor inverse]
-def dualEquiv : BddDistLatCat ≌ BddDistLatCat :=
+def dualEquiv : BddDistLat ≌ BddDistLat :=
   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 BddDistLat.dual_equiv BddDistLatCat.dualEquiv
+#align BddDistLat.dual_equiv BddDistLat.dualEquiv
 -/
 
-end BddDistLatCat
+end BddDistLat
 
-#print bddDistLatCat_dual_comp_forget_to_distLatCat /-
-theorem bddDistLatCat_dual_comp_forget_to_distLatCat :
-    BddDistLatCat.dual ⋙ forget₂ BddDistLatCat DistLatCat =
-      forget₂ BddDistLatCat DistLatCat ⋙ DistLatCat.dual :=
+#print bddDistLat_dual_comp_forget_to_distLat /-
+theorem bddDistLat_dual_comp_forget_to_distLat :
+    BddDistLat.dual ⋙ forget₂ BddDistLat DistLat = forget₂ BddDistLat DistLat ⋙ DistLat.dual :=
   rfl
-#align BddDistLat_dual_comp_forget_to_DistLat bddDistLatCat_dual_comp_forget_to_distLatCat
+#align BddDistLat_dual_comp_forget_to_DistLat bddDistLat_dual_comp_forget_to_distLat
 -/

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.BddDistLat
-! 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.Category.DistLat
 
+#align_import order.category.BddDistLat from "leanprover-community/mathlib"@"8af7091a43227e179939ba132e54e54e9f3b089a"
+
 /-!
 # The category of bounded distributive lattices

8af7091a

bump to nightly-2023-06-18-23

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

3b5e23dc

Diff

@@ -28,98 +28,125 @@ universe u
 
 open CategoryTheory
 
+#print BddDistLatCat /-
 /-- The category of bounded distributive lattices with bounded lattice morphisms. -/
-structure BddDistLat where
+structure BddDistLatCat where
   toDistLat : DistLatCat
   [isBoundedOrder : BoundedOrder to_DistLat]
-#align BddDistLat BddDistLat
+#align BddDistLat BddDistLatCat
+-/
 
-namespace BddDistLat
+namespace BddDistLatCat
 
-instance : CoeSort BddDistLat (Type _) :=
+instance : CoeSort BddDistLatCat (Type _) :=
   ⟨fun X => X.toDistLat⟩
 
-instance (X : BddDistLat) : DistribLattice X :=
+instance (X : BddDistLatCat) : DistribLattice X :=
   X.toDistLat.str
 
-attribute [instance] BddDistLat.isBoundedOrder
+attribute [instance] BddDistLatCat.isBoundedOrder
 
+#print BddDistLatCat.of /-
 /-- Construct a bundled `BddDistLat` from a `bounded_order` `distrib_lattice`. -/
-def of (α : Type _) [DistribLattice α] [BoundedOrder α] : BddDistLat :=
+def of (α : Type _) [DistribLattice α] [BoundedOrder α] : BddDistLatCat :=
   ⟨⟨α⟩⟩
-#align BddDistLat.of BddDistLat.of
+#align BddDistLat.of BddDistLatCat.of
+-/
 
+#print BddDistLatCat.coe_of /-
 @[simp]
 theorem coe_of (α : Type _) [DistribLattice α] [BoundedOrder α] : ↥(of α) = α :=
   rfl
-#align BddDistLat.coe_of BddDistLat.coe_of
+#align BddDistLat.coe_of BddDistLatCat.coe_of
+-/
 
-instance : Inhabited BddDistLat :=
+instance : Inhabited BddDistLatCat :=
   ⟨of PUnit⟩
 
+#print BddDistLatCat.toBddLat /-
 /-- Turn a `BddDistLat` into a `BddLat` by forgetting it is distributive. -/
-def toBddLat (X : BddDistLat) : BddLat :=
-  BddLat.of X
-#align BddDistLat.to_BddLat BddDistLat.toBddLat
+def toBddLat (X : BddDistLatCat) : BddLatCat :=
+  BddLatCat.of X
+#align BddDistLat.to_BddLat BddDistLatCat.toBddLat
+-/
 
+/- warning: BddDistLat.coe_to_BddLat clashes with BddDistLatCat.coe_to_BddLat -> BddDistLatCat.coe_toBddLat
+Case conversion may be inaccurate. Consider using '#align BddDistLat.coe_to_BddLat BddDistLatCat.coe_toBddLatₓ'. -/
+#print BddDistLatCat.coe_toBddLat /-
 @[simp]
-theorem coe_toBddLat (X : BddDistLat) : ↥X.toBddLat = ↥X :=
+theorem coe_toBddLat (X : BddDistLatCat) : ↥X.toBddLat = ↥X :=
   rfl
-#align BddDistLat.coe_to_BddLat BddDistLat.coe_toBddLat
+#align BddDistLat.coe_to_BddLat BddDistLatCat.coe_toBddLat
+-/
 
-instance : LargeCategory.{u} BddDistLat :=
+instance : LargeCategory.{u} BddDistLatCat :=
   InducedCategory.category toBddLat
 
-instance : ConcreteCategory BddDistLat :=
+instance : ConcreteCategory BddDistLatCat :=
   InducedCategory.concreteCategory toBddLat
 
-instance hasForgetToDistLat : HasForget₂ BddDistLat DistLatCat
+#print BddDistLatCat.hasForgetToDistLat /-
+instance hasForgetToDistLat : HasForget₂ BddDistLatCat DistLatCat
     where forget₂ :=
     { obj := fun X => ⟨X⟩
       map := fun X Y => BoundedLatticeHom.toLatticeHom }
-#align BddDistLat.has_forget_to_DistLat BddDistLat.hasForgetToDistLat
+#align BddDistLat.has_forget_to_DistLat BddDistLatCat.hasForgetToDistLat
+-/
 
-instance hasForgetToBddLat : HasForget₂ BddDistLat BddLat :=
+#print BddDistLatCat.hasForgetToBddLat /-
+instance hasForgetToBddLat : HasForget₂ BddDistLatCat BddLatCat :=
   InducedCategory.hasForget₂ toBddLat
-#align BddDistLat.has_forget_to_BddLat BddDistLat.hasForgetToBddLat
+#align BddDistLat.has_forget_to_BddLat BddDistLatCat.hasForgetToBddLat
+-/
 
+#print BddDistLatCat.forget_bddLat_latCat_eq_forget_distLatCat_latCat /-
 theorem forget_bddLat_latCat_eq_forget_distLatCat_latCat :
-    forget₂ BddDistLat BddLat ⋙ forget₂ BddLat LatCat =
-      forget₂ BddDistLat DistLatCat ⋙ forget₂ DistLatCat LatCat :=
+    forget₂ BddDistLatCat BddLatCat ⋙ forget₂ BddLatCat LatCat =
+      forget₂ BddDistLatCat DistLatCat ⋙ forget₂ DistLatCat LatCat :=
   rfl
-#align BddDistLat.forget_BddLat_Lat_eq_forget_DistLat_Lat BddDistLat.forget_bddLat_latCat_eq_forget_distLatCat_latCat
+#align BddDistLat.forget_BddLat_Lat_eq_forget_DistLat_Lat BddDistLatCat.forget_bddLat_latCat_eq_forget_distLatCat_latCat
+-/
 
+#print BddDistLatCat.Iso.mk /-
 /-- Constructs an equivalence between bounded distributive lattices from an order isomorphism
 between them. -/
 @[simps]
-def Iso.mk {α β : BddDistLat.{u}} (e : α ≃o β) : α ≅ β
+def Iso.mk {α β : BddDistLatCat.{u}} (e : α ≃o β) : α ≅ β
     where
   Hom := (e : BoundedLatticeHom α β)
   inv := (e.symm : BoundedLatticeHom β α)
   hom_inv_id' := by ext; exact e.symm_apply_apply _
   inv_hom_id' := by ext; exact e.apply_symm_apply _
-#align BddDistLat.iso.mk BddDistLat.Iso.mk
+#align BddDistLat.iso.mk BddDistLatCat.Iso.mk
+-/
 
+#print BddDistLatCat.dual /-
 /-- `order_dual` as a functor. -/
 @[simps]
-def dual : BddDistLat ⥤ BddDistLat where
+def dual : BddDistLatCat ⥤ BddDistLatCat
+    where
   obj X := of Xᵒᵈ
   map X Y := BoundedLatticeHom.dual
-#align BddDistLat.dual BddDistLat.dual
+#align BddDistLat.dual BddDistLatCat.dual
+-/
 
+#print BddDistLatCat.dualEquiv /-
 /-- The equivalence between `BddDistLat` and itself induced by `order_dual` both ways. -/
 @[simps Functor inverse]
-def dualEquiv : BddDistLat ≌ BddDistLat :=
+def dualEquiv : BddDistLatCat ≌ BddDistLatCat :=
   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 BddDistLat.dual_equiv BddDistLat.dualEquiv
+#align BddDistLat.dual_equiv BddDistLatCat.dualEquiv
+-/
 
-end BddDistLat
+end BddDistLatCat
 
-theorem bddDistLat_dual_comp_forget_to_distLatCat :
-    BddDistLat.dual ⋙ forget₂ BddDistLat DistLatCat =
-      forget₂ BddDistLat DistLatCat ⋙ DistLatCat.dual :=
+#print bddDistLatCat_dual_comp_forget_to_distLatCat /-
+theorem bddDistLatCat_dual_comp_forget_to_distLatCat :
+    BddDistLatCat.dual ⋙ forget₂ BddDistLatCat DistLatCat =
+      forget₂ BddDistLatCat DistLatCat ⋙ DistLatCat.dual :=
   rfl
-#align BddDistLat_dual_comp_forget_to_DistLat bddDistLat_dual_comp_forget_to_distLatCat
+#align BddDistLat_dual_comp_forget_to_DistLat bddDistLatCat_dual_comp_forget_to_distLatCat
+-/

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.BddDistLat
-! 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.Category.DistLat
 /-!
 # The category of bounded distributive lattices
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 This defines `BddDistLat`, the category of bounded distributive lattices.
 
 Note that this category is sometimes called [`DistLat`](https://ncatlab.org/nlab/show/DistLat) when

e8ac6315

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -93,12 +93,8 @@ def Iso.mk {α β : BddDistLat.{u}} (e : α ≃o β) : α ≅ β
     where
   Hom := (e : BoundedLatticeHom α β)
   inv := (e.symm : BoundedLatticeHom β α)
-  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 BddDistLat.iso.mk BddDistLat.Iso.mk
 
 /-- `order_dual` as a functor. -/

e8ac6315

bump to nightly-2023-04-17-10

mathlib commit https://github.com/leanprover-community/mathlib/commit/17ad94b4953419f3e3ce3e77da3239c62d1d09f0

f9776b40

Diff

@@ -27,7 +27,7 @@ open CategoryTheory
 
 /-- The category of bounded distributive lattices with bounded lattice morphisms. -/
 structure BddDistLat where
-  toDistLat : DistLat
+  toDistLat : DistLatCat
   [isBoundedOrder : BoundedOrder to_DistLat]
 #align BddDistLat BddDistLat
 
@@ -70,7 +70,7 @@ instance : LargeCategory.{u} BddDistLat :=
 instance : ConcreteCategory BddDistLat :=
   InducedCategory.concreteCategory toBddLat
 
-instance hasForgetToDistLat : HasForget₂ BddDistLat DistLat
+instance hasForgetToDistLat : HasForget₂ BddDistLat DistLatCat
     where forget₂ :=
     { obj := fun X => ⟨X⟩
       map := fun X Y => BoundedLatticeHom.toLatticeHom }
@@ -80,11 +80,11 @@ instance hasForgetToBddLat : HasForget₂ BddDistLat BddLat :=
   InducedCategory.hasForget₂ toBddLat
 #align BddDistLat.has_forget_to_BddLat BddDistLat.hasForgetToBddLat
 
-theorem forget_bddLat_latCat_eq_forget_distLat_latCat :
+theorem forget_bddLat_latCat_eq_forget_distLatCat_latCat :
     forget₂ BddDistLat BddLat ⋙ forget₂ BddLat LatCat =
-      forget₂ BddDistLat DistLat ⋙ forget₂ DistLat LatCat :=
+      forget₂ BddDistLat DistLatCat ⋙ forget₂ DistLatCat LatCat :=
   rfl
-#align BddDistLat.forget_BddLat_Lat_eq_forget_DistLat_Lat BddDistLat.forget_bddLat_latCat_eq_forget_distLat_latCat
+#align BddDistLat.forget_BddLat_Lat_eq_forget_DistLat_Lat BddDistLat.forget_bddLat_latCat_eq_forget_distLatCat_latCat
 
 /-- Constructs an equivalence between bounded distributive lattices from an order isomorphism
 between them. -/
@@ -118,8 +118,9 @@ def dualEquiv : BddDistLat ≌ BddDistLat :=
 
 end BddDistLat
 
-theorem bddDistLat_dual_comp_forget_to_distLat :
-    BddDistLat.dual ⋙ forget₂ BddDistLat DistLat = forget₂ BddDistLat DistLat ⋙ DistLat.dual :=
+theorem bddDistLat_dual_comp_forget_to_distLatCat :
+    BddDistLat.dual ⋙ forget₂ BddDistLat DistLatCat =
+      forget₂ BddDistLat DistLatCat ⋙ DistLatCat.dual :=
   rfl
-#align BddDistLat_dual_comp_forget_to_DistLat bddDistLat_dual_comp_forget_to_distLat
+#align BddDistLat_dual_comp_forget_to_DistLat bddDistLat_dual_comp_forget_to_distLatCat

e8ac6315

bump to nightly-2023-04-05-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/1a4df69ca1a9a0e5e26bfe12e2b92814216016d0

523f1e96

Diff

@@ -80,11 +80,11 @@ instance hasForgetToBddLat : HasForget₂ BddDistLat BddLat :=
   InducedCategory.hasForget₂ toBddLat
 #align BddDistLat.has_forget_to_BddLat BddDistLat.hasForgetToBddLat
 
-theorem forget_bddLat_lat_eq_forget_distLat_lat :
-    forget₂ BddDistLat BddLat ⋙ forget₂ BddLat Lat =
-      forget₂ BddDistLat DistLat ⋙ forget₂ DistLat Lat :=
+theorem forget_bddLat_latCat_eq_forget_distLat_latCat :
+    forget₂ BddDistLat BddLat ⋙ forget₂ BddLat LatCat =
+      forget₂ BddDistLat DistLat ⋙ forget₂ DistLat LatCat :=
   rfl
-#align BddDistLat.forget_BddLat_Lat_eq_forget_DistLat_Lat BddDistLat.forget_bddLat_lat_eq_forget_distLat_lat
+#align BddDistLat.forget_BddLat_Lat_eq_forget_DistLat_Lat BddDistLat.forget_bddLat_latCat_eq_forget_distLat_latCat
 
 /-- Constructs an equivalence between bounded distributive lattices from an order isomorphism
 between them. -/

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

doc: @[inherit_doc] on notations (#9942)

Make all the notations that unambiguously should inherit the docstring of their definition actually inherit it.

Also write a few docstrings by hand. I only wrote the ones I was competent to write and which I was sure of. Some docstrings come from mathlib3 as they were lost during the early port.

This PR is only intended as a first pass There are many more docstrings to add.

08f7e99d

Diff

@@ -25,6 +25,7 @@ open CategoryTheory
 
 /-- The category of bounded distributive lattices with bounded lattice morphisms. -/
 structure BddDistLat where
+  /-- The underlying distrib lattice of a bounded distributive lattice. -/
   toDistLat : DistLat
   [isBoundedOrder : BoundedOrder toDistLat]
 #align BddDistLat BddDistLat

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

@@ -31,7 +31,7 @@ structure BddDistLatCat where
 
 namespace BddDistLatCat
 
-instance : CoeSort BddDistLatCat (Type _) :=
+instance : CoeSort BddDistLatCat (Type*) :=
   ⟨fun X => X.toDistLatCat⟩
 
 instance (X : BddDistLatCat) : DistribLattice X :=
@@ -40,14 +40,14 @@ instance (X : BddDistLatCat) : DistribLattice X :=
 attribute [instance] BddDistLatCat.isBoundedOrder
 
 /-- Construct a bundled `BddDistLatCat` from a `BoundedOrder` `DistribLattice`. -/
-def of (α : Type _) [DistribLattice α] [BoundedOrder α] : BddDistLatCat :=
+def of (α : Type*) [DistribLattice α] [BoundedOrder α] : BddDistLatCat :=
   -- Porting note: was `⟨⟨α⟩⟩`
   -- see https://github.com/leanprover-community/mathlib4/issues/4998
   ⟨{α := α}⟩
 #align BddDistLat.of BddDistLatCat.of
 
 @[simp]
-theorem coe_of (α : Type _) [DistribLattice α] [BoundedOrder α] : ↥(of α) = α :=
+theorem coe_of (α : Type*) [DistribLattice α] [BoundedOrder α] : ↥(of α) = α :=
   rfl
 #align BddDistLat.coe_of BddDistLatCat.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.BddDistLat
-! 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.Category.DistLatCat
 
+#align_import order.category.BddDistLat from "leanprover-community/mathlib"@"e8ac6315bcfcbaf2d19a046719c3b553206dac75"
+
 /-!
 # The category of bounded distributive lattices

e8ac6315

feat: port Order.Category.BddDistLatCat (#5015)

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

b75e0092

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

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 128

order.category.BddDistLat ⟷ Mathlib.Order.Category.BddDistLat

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 128

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