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

937b1c59

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

cff8231f

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,9 +3,9 @@ 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.Data.Fintype.Order
-import Mathbin.Order.Category.BddDistLat
-import Mathbin.Order.Category.FinPartOrd
+import Data.Fintype.Order
+import Order.Category.BddDistLat
+import Order.Category.FinPartOrd
 
 #align_import order.category.FinBddDistLat from "leanprover-community/mathlib"@"cff8231f04dfa33fd8f2f45792eebd862ef30cad"
 
@@ -24,114 +24,114 @@ universe u
 
 open CategoryTheory
 
-#print FinBddDistLatCat /-
+#print FinBddDistLat /-
 /-- The category of finite distributive lattices with bounded lattice morphisms. -/
-structure FinBddDistLatCat where
-  toBddDistLat : BddDistLatCat
+structure FinBddDistLat where
+  toBddDistLat : BddDistLat
   [isFintype : Fintype to_BddDistLat]
-#align FinBddDistLat FinBddDistLatCat
+#align FinBddDistLat FinBddDistLat
 -/
 
-namespace FinBddDistLatCat
+namespace FinBddDistLat
 
-instance : CoeSort FinBddDistLatCat (Type _) :=
+instance : CoeSort FinBddDistLat (Type _) :=
   ⟨fun X => X.toBddDistLat⟩
 
-instance (X : FinBddDistLatCat) : DistribLattice X :=
+instance (X : FinBddDistLat) : DistribLattice X :=
   X.toBddDistLat.toDistLat.str
 
-instance (X : FinBddDistLatCat) : BoundedOrder X :=
+instance (X : FinBddDistLat) : BoundedOrder X :=
   X.toBddDistLat.isBoundedOrder
 
-attribute [instance] FinBddDistLatCat.isFintype
+attribute [instance] FinBddDistLat.isFintype
 
-#print FinBddDistLatCat.of /-
+#print FinBddDistLat.of /-
 /-- Construct a bundled `FinBddDistLat` from a `nonempty` `bounded_order` `distrib_lattice`. -/
-def of (α : Type _) [DistribLattice α] [BoundedOrder α] [Fintype α] : FinBddDistLatCat :=
+def of (α : Type _) [DistribLattice α] [BoundedOrder α] [Fintype α] : FinBddDistLat :=
   ⟨⟨⟨α⟩⟩⟩
-#align FinBddDistLat.of FinBddDistLatCat.of
+#align FinBddDistLat.of FinBddDistLat.of
 -/
 
-#print FinBddDistLatCat.of' /-
+#print FinBddDistLat.of' /-
 /-- Construct a bundled `FinBddDistLat` from a `nonempty` `bounded_order` `distrib_lattice`. -/
-def of' (α : Type _) [DistribLattice α] [Fintype α] [Nonempty α] : FinBddDistLatCat :=
+def of' (α : Type _) [DistribLattice α] [Fintype α] [Nonempty α] : FinBddDistLat :=
   haveI := Fintype.toBoundedOrder α
   ⟨⟨⟨α⟩⟩⟩
-#align FinBddDistLat.of' FinBddDistLatCat.of'
+#align FinBddDistLat.of' FinBddDistLat.of'
 -/
 
-instance : Inhabited FinBddDistLatCat :=
+instance : Inhabited FinBddDistLat :=
   ⟨of PUnit⟩
 
-#print FinBddDistLatCat.largeCategory /-
-instance largeCategory : LargeCategory FinBddDistLatCat :=
+#print FinBddDistLat.largeCategory /-
+instance largeCategory : LargeCategory FinBddDistLat :=
   InducedCategory.category toBddDistLat
-#align FinBddDistLat.large_category FinBddDistLatCat.largeCategory
+#align FinBddDistLat.large_category FinBddDistLat.largeCategory
 -/
 
-#print FinBddDistLatCat.concreteCategory /-
-instance concreteCategory : ConcreteCategory FinBddDistLatCat :=
+#print FinBddDistLat.concreteCategory /-
+instance concreteCategory : ConcreteCategory FinBddDistLat :=
   InducedCategory.concreteCategory toBddDistLat
-#align FinBddDistLat.concrete_category FinBddDistLatCat.concreteCategory
+#align FinBddDistLat.concrete_category FinBddDistLat.concreteCategory
 -/
 
-#print FinBddDistLatCat.hasForgetToBddDistLatCat /-
-instance hasForgetToBddDistLatCat : HasForget₂ FinBddDistLatCat BddDistLatCat :=
-  InducedCategory.hasForget₂ FinBddDistLatCat.toBddDistLat
-#align FinBddDistLat.has_forget_to_BddDistLat FinBddDistLatCat.hasForgetToBddDistLatCat
+#print FinBddDistLat.hasForgetToBddDistLat /-
+instance hasForgetToBddDistLat : HasForget₂ FinBddDistLat BddDistLat :=
+  InducedCategory.hasForget₂ FinBddDistLat.toBddDistLat
+#align FinBddDistLat.has_forget_to_BddDistLat FinBddDistLat.hasForgetToBddDistLat
 -/
 
-#print FinBddDistLatCat.hasForgetToFinPartOrd /-
-instance hasForgetToFinPartOrd : HasForget₂ FinBddDistLatCat FinPartOrd
+#print FinBddDistLat.hasForgetToFinPartOrd /-
+instance hasForgetToFinPartOrd : HasForget₂ FinBddDistLat FinPartOrd
     where forget₂ :=
     { obj := fun X => FinPartOrd.of X
       map := fun X Y f => (show BoundedLatticeHom X Y from f : X →o Y) }
-#align FinBddDistLat.has_forget_to_FinPartOrd FinBddDistLatCat.hasForgetToFinPartOrd
+#align FinBddDistLat.has_forget_to_FinPartOrd FinBddDistLat.hasForgetToFinPartOrd
 -/
 
-#print FinBddDistLatCat.Iso.mk /-
+#print FinBddDistLat.Iso.mk /-
 /-- Constructs an equivalence between finite distributive lattices from an order isomorphism
 between them. -/
 @[simps]
-def Iso.mk {α β : FinBddDistLatCat.{u}} (e : α ≃o β) : α ≅ β
+def Iso.mk {α β : FinBddDistLat.{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 FinBddDistLat.iso.mk FinBddDistLatCat.Iso.mk
+#align FinBddDistLat.iso.mk FinBddDistLat.Iso.mk
 -/
 
-example {X Y : FinBddDistLatCat} : (X ⟶ Y) = BoundedLatticeHom X Y :=
+example {X Y : FinBddDistLat} : (X ⟶ Y) = BoundedLatticeHom X Y :=
   rfl
 
-#print FinBddDistLatCat.dual /-
+#print FinBddDistLat.dual /-
 /-- `order_dual` as a functor. -/
 @[simps]
-def dual : FinBddDistLatCat ⥤ FinBddDistLatCat
+def dual : FinBddDistLat ⥤ FinBddDistLat
     where
   obj X := of Xᵒᵈ
   map X Y := BoundedLatticeHom.dual
-#align FinBddDistLat.dual FinBddDistLatCat.dual
+#align FinBddDistLat.dual FinBddDistLat.dual
 -/
 
-#print FinBddDistLatCat.dualEquiv /-
+#print FinBddDistLat.dualEquiv /-
 /-- The equivalence between `FinBddDistLat` and itself induced by `order_dual` both ways. -/
 @[simps Functor inverse]
-def dualEquiv : FinBddDistLatCat ≌ FinBddDistLatCat :=
+def dualEquiv : FinBddDistLat ≌ FinBddDistLat :=
   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 FinBddDistLat.dual_equiv FinBddDistLatCat.dualEquiv
+#align FinBddDistLat.dual_equiv FinBddDistLat.dualEquiv
 -/
 
-end FinBddDistLatCat
+end FinBddDistLat
 
-#print finBddDistLatCat_dual_comp_forget_to_bddDistLatCat /-
-theorem finBddDistLatCat_dual_comp_forget_to_bddDistLatCat :
-    FinBddDistLatCat.dual ⋙ forget₂ FinBddDistLatCat BddDistLatCat =
-      forget₂ FinBddDistLatCat BddDistLatCat ⋙ BddDistLatCat.dual :=
+#print finBddDistLat_dual_comp_forget_to_bddDistLat /-
+theorem finBddDistLat_dual_comp_forget_to_bddDistLat :
+    FinBddDistLat.dual ⋙ forget₂ FinBddDistLat BddDistLat =
+      forget₂ FinBddDistLat BddDistLat ⋙ BddDistLat.dual :=
   rfl
-#align FinBddDistLat_dual_comp_forget_to_BddDistLat finBddDistLatCat_dual_comp_forget_to_bddDistLatCat
+#align FinBddDistLat_dual_comp_forget_to_BddDistLat finBddDistLat_dual_comp_forget_to_bddDistLat
 -/

cff8231f

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,16 +2,13 @@
 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.FinBddDistLat
-! leanprover-community/mathlib commit cff8231f04dfa33fd8f2f45792eebd862ef30cad
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Data.Fintype.Order
 import Mathbin.Order.Category.BddDistLat
 import Mathbin.Order.Category.FinPartOrd
 
+#align_import order.category.FinBddDistLat from "leanprover-community/mathlib"@"cff8231f04dfa33fd8f2f45792eebd862ef30cad"
+
 /-!
 # The category of finite bounded distributive lattices

cff8231f

bump to nightly-2023-06-18-23

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

3b5e23dc

Diff

@@ -27,92 +27,114 @@ universe u
 
 open CategoryTheory
 
+#print FinBddDistLatCat /-
 /-- The category of finite distributive lattices with bounded lattice morphisms. -/
-structure FinBddDistLat where
-  toBddDistLat : BddDistLat
+structure FinBddDistLatCat where
+  toBddDistLat : BddDistLatCat
   [isFintype : Fintype to_BddDistLat]
-#align FinBddDistLat FinBddDistLat
+#align FinBddDistLat FinBddDistLatCat
+-/
 
-namespace FinBddDistLat
+namespace FinBddDistLatCat
 
-instance : CoeSort FinBddDistLat (Type _) :=
+instance : CoeSort FinBddDistLatCat (Type _) :=
   ⟨fun X => X.toBddDistLat⟩
 
-instance (X : FinBddDistLat) : DistribLattice X :=
+instance (X : FinBddDistLatCat) : DistribLattice X :=
   X.toBddDistLat.toDistLat.str
 
-instance (X : FinBddDistLat) : BoundedOrder X :=
+instance (X : FinBddDistLatCat) : BoundedOrder X :=
   X.toBddDistLat.isBoundedOrder
 
-attribute [instance] FinBddDistLat.isFintype
+attribute [instance] FinBddDistLatCat.isFintype
 
+#print FinBddDistLatCat.of /-
 /-- Construct a bundled `FinBddDistLat` from a `nonempty` `bounded_order` `distrib_lattice`. -/
-def of (α : Type _) [DistribLattice α] [BoundedOrder α] [Fintype α] : FinBddDistLat :=
+def of (α : Type _) [DistribLattice α] [BoundedOrder α] [Fintype α] : FinBddDistLatCat :=
   ⟨⟨⟨α⟩⟩⟩
-#align FinBddDistLat.of FinBddDistLat.of
+#align FinBddDistLat.of FinBddDistLatCat.of
+-/
 
+#print FinBddDistLatCat.of' /-
 /-- Construct a bundled `FinBddDistLat` from a `nonempty` `bounded_order` `distrib_lattice`. -/
-def of' (α : Type _) [DistribLattice α] [Fintype α] [Nonempty α] : FinBddDistLat :=
+def of' (α : Type _) [DistribLattice α] [Fintype α] [Nonempty α] : FinBddDistLatCat :=
   haveI := Fintype.toBoundedOrder α
   ⟨⟨⟨α⟩⟩⟩
-#align FinBddDistLat.of' FinBddDistLat.of'
+#align FinBddDistLat.of' FinBddDistLatCat.of'
+-/
 
-instance : Inhabited FinBddDistLat :=
+instance : Inhabited FinBddDistLatCat :=
   ⟨of PUnit⟩
 
-instance largeCategory : LargeCategory FinBddDistLat :=
+#print FinBddDistLatCat.largeCategory /-
+instance largeCategory : LargeCategory FinBddDistLatCat :=
   InducedCategory.category toBddDistLat
-#align FinBddDistLat.large_category FinBddDistLat.largeCategory
+#align FinBddDistLat.large_category FinBddDistLatCat.largeCategory
+-/
 
-instance concreteCategory : ConcreteCategory FinBddDistLat :=
+#print FinBddDistLatCat.concreteCategory /-
+instance concreteCategory : ConcreteCategory FinBddDistLatCat :=
   InducedCategory.concreteCategory toBddDistLat
-#align FinBddDistLat.concrete_category FinBddDistLat.concreteCategory
+#align FinBddDistLat.concrete_category FinBddDistLatCat.concreteCategory
+-/
 
-instance hasForgetToBddDistLat : HasForget₂ FinBddDistLat BddDistLat :=
-  InducedCategory.hasForget₂ FinBddDistLat.toBddDistLat
-#align FinBddDistLat.has_forget_to_BddDistLat FinBddDistLat.hasForgetToBddDistLat
+#print FinBddDistLatCat.hasForgetToBddDistLatCat /-
+instance hasForgetToBddDistLatCat : HasForget₂ FinBddDistLatCat BddDistLatCat :=
+  InducedCategory.hasForget₂ FinBddDistLatCat.toBddDistLat
+#align FinBddDistLat.has_forget_to_BddDistLat FinBddDistLatCat.hasForgetToBddDistLatCat
+-/
 
-instance hasForgetToFinPartOrd : HasForget₂ FinBddDistLat FinPartOrd
+#print FinBddDistLatCat.hasForgetToFinPartOrd /-
+instance hasForgetToFinPartOrd : HasForget₂ FinBddDistLatCat FinPartOrd
     where forget₂ :=
     { obj := fun X => FinPartOrd.of X
       map := fun X Y f => (show BoundedLatticeHom X Y from f : X →o Y) }
-#align FinBddDistLat.has_forget_to_FinPartOrd FinBddDistLat.hasForgetToFinPartOrd
+#align FinBddDistLat.has_forget_to_FinPartOrd FinBddDistLatCat.hasForgetToFinPartOrd
+-/
 
+#print FinBddDistLatCat.Iso.mk /-
 /-- Constructs an equivalence between finite distributive lattices from an order isomorphism
 between them. -/
 @[simps]
-def Iso.mk {α β : FinBddDistLat.{u}} (e : α ≃o β) : α ≅ β
+def Iso.mk {α β : FinBddDistLatCat.{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 FinBddDistLat.iso.mk FinBddDistLat.Iso.mk
+#align FinBddDistLat.iso.mk FinBddDistLatCat.Iso.mk
+-/
 
-example {X Y : FinBddDistLat} : (X ⟶ Y) = BoundedLatticeHom X Y :=
+example {X Y : FinBddDistLatCat} : (X ⟶ Y) = BoundedLatticeHom X Y :=
   rfl
 
+#print FinBddDistLatCat.dual /-
 /-- `order_dual` as a functor. -/
 @[simps]
-def dual : FinBddDistLat ⥤ FinBddDistLat
+def dual : FinBddDistLatCat ⥤ FinBddDistLatCat
     where
   obj X := of Xᵒᵈ
   map X Y := BoundedLatticeHom.dual
-#align FinBddDistLat.dual FinBddDistLat.dual
+#align FinBddDistLat.dual FinBddDistLatCat.dual
+-/
 
+#print FinBddDistLatCat.dualEquiv /-
 /-- The equivalence between `FinBddDistLat` and itself induced by `order_dual` both ways. -/
 @[simps Functor inverse]
-def dualEquiv : FinBddDistLat ≌ FinBddDistLat :=
+def dualEquiv : FinBddDistLatCat ≌ FinBddDistLatCat :=
   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 FinBddDistLat.dual_equiv FinBddDistLat.dualEquiv
+#align FinBddDistLat.dual_equiv FinBddDistLatCat.dualEquiv
+-/
 
-end FinBddDistLat
+end FinBddDistLatCat
 
-theorem finBddDistLat_dual_comp_forget_to_bddDistLat :
-    FinBddDistLat.dual ⋙ forget₂ FinBddDistLat BddDistLat =
-      forget₂ FinBddDistLat BddDistLat ⋙ BddDistLat.dual :=
+#print finBddDistLatCat_dual_comp_forget_to_bddDistLatCat /-
+theorem finBddDistLatCat_dual_comp_forget_to_bddDistLatCat :
+    FinBddDistLatCat.dual ⋙ forget₂ FinBddDistLatCat BddDistLatCat =
+      forget₂ FinBddDistLatCat BddDistLatCat ⋙ BddDistLatCat.dual :=
   rfl
-#align FinBddDistLat_dual_comp_forget_to_BddDistLat finBddDistLat_dual_comp_forget_to_bddDistLat
+#align FinBddDistLat_dual_comp_forget_to_BddDistLat finBddDistLatCat_dual_comp_forget_to_bddDistLatCat
+-/

cff8231f

bump to nightly-2023-06-17-03

mathlib commit https://github.com/leanprover-community/mathlib/commit/893964fc28cefbcffc7cb784ed00a2895b4e65cf

253178d1

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.FinBddDistLat
-! leanprover-community/mathlib commit 937b1c59c58710ef8ed91f8727ef402d49d621a2
+! leanprover-community/mathlib commit cff8231f04dfa33fd8f2f45792eebd862ef30cad
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -15,6 +15,9 @@ import Mathbin.Order.Category.FinPartOrd
 /-!
 # The category of finite bounded distributive lattices
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 This file defines `FinBddDistLat`, the category of finite distributive lattices with
 bounded lattice homomorphisms.
 -/

937b1c59

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -82,12 +82,8 @@ def Iso.mk {α β : FinBddDistLat.{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 FinBddDistLat.iso.mk FinBddDistLat.Iso.mk
 
 example {X Y : FinBddDistLat} : (X ⟶ Y) = BoundedLatticeHom X Y :=

937b1c59

bump to nightly-2023-05-09-02

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

6a26eca8

Changes in mathlib4

mathlib3

mathlib4

937b1c59

chore: Remove Cat suffixes (#3730)

These names needn't change in the first place.

40fe5127

937b1c59

style: fix wrapping of where (#7149)

084cfb35

Diff

@@ -71,8 +71,8 @@ instance hasForgetToBddDistLatCat : HasForget₂ FinBddDistLatCat BddDistLatCat
   InducedCategory.hasForget₂ FinBddDistLatCat.toBddDistLatCat
 #align FinBddDistLat.has_forget_to_BddDistLat FinBddDistLatCat.hasForgetToBddDistLatCat
 
-instance hasForgetToFinPartOrd : HasForget₂ FinBddDistLatCat FinPartOrd
-    where forget₂ :=
+instance hasForgetToFinPartOrd : HasForget₂ FinBddDistLatCat FinPartOrd where
+  forget₂ :=
     { obj := fun X => FinPartOrd.of X
       map := fun {X Y} f => (show BoundedLatticeHom X Y from f : X →o Y) }
 #align FinBddDistLat.has_forget_to_FinPartOrd FinBddDistLatCat.hasForgetToFinPartOrd

937b1c59

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 @@ structure FinBddDistLatCat where
 
 namespace FinBddDistLatCat
 
-instance : CoeSort FinBddDistLatCat (Type _) :=
+instance : CoeSort FinBddDistLatCat (Type*) :=
   ⟨fun X => X.toBddDistLatCat⟩
 
 instance (X : FinBddDistLatCat) : DistribLattice X :=
@@ -42,14 +42,14 @@ instance (X : FinBddDistLatCat) : BoundedOrder X :=
 attribute [instance] FinBddDistLatCat.isFintype
 
 /-- Construct a bundled `FinBddDistLatCat` from a `Nonempty` `BoundedOrder` `DistribLattice`. -/
-def of (α : Type _) [DistribLattice α] [BoundedOrder α] [Fintype α] : FinBddDistLatCat :=
+def of (α : Type*) [DistribLattice α] [BoundedOrder α] [Fintype α] : FinBddDistLatCat :=
   -- Porting note: was `⟨⟨⟨α⟩⟩⟩`
   -- see https://github.com/leanprover-community/mathlib4/issues/4998
   ⟨⟨{α := α}⟩⟩
 #align FinBddDistLat.of FinBddDistLatCat.of
 
 /-- Construct a bundled `FinBddDistLatCat` from a `Nonempty` `BoundedOrder` `DistribLattice`. -/
-def of' (α : Type _) [DistribLattice α] [Fintype α] [Nonempty α] : FinBddDistLatCat :=
+def of' (α : Type*) [DistribLattice α] [Fintype α] [Nonempty α] : FinBddDistLatCat :=
   haveI := Fintype.toBoundedOrder α
   -- Porting note: was `⟨⟨⟨α⟩⟩⟩`
   -- see https://github.com/leanprover-community/mathlib4/issues/4998

937b1c59

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,16 +2,13 @@
 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.FinBddDistLat
-! leanprover-community/mathlib commit 937b1c59c58710ef8ed91f8727ef402d49d621a2
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Data.Fintype.Order
 import Mathlib.Order.Category.BddDistLatCat
 import Mathlib.Order.Category.FinPartOrd
 
+#align_import order.category.FinBddDistLat from "leanprover-community/mathlib"@"937b1c59c58710ef8ed91f8727ef402d49d621a2"
+
 /-!
 # The category of finite bounded distributive lattices

937b1c59

feat: port Order.Category.FinBddDistLatCat (#5051)

37e61f4e

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

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 2 + 265

order.category.FinBddDistLat ⟷ Mathlib.Order.Category.FinBddDistLat

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 2 + 265

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