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

cff8231f

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,7 +3,7 @@ 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.HeytAlg
+import Order.Category.HeytAlg
 
 #align_import order.category.BoolAlg from "leanprover-community/mathlib"@"cff8231f04dfa33fd8f2f45792eebd862ef30cad"
 
@@ -23,117 +23,116 @@ universe u
 
 open CategoryTheory
 
-#print BoolAlgCat /-
+#print BoolAlg /-
 /-- The category of boolean algebras. -/
-def BoolAlgCat :=
+def BoolAlg :=
   Bundled BooleanAlgebra
-#align BoolAlg BoolAlgCat
+#align BoolAlg BoolAlg
 -/
 
-namespace BoolAlgCat
+namespace BoolAlg
 
-instance : CoeSort BoolAlgCat (Type _) :=
+instance : CoeSort BoolAlg (Type _) :=
   Bundled.hasCoeToSort
 
-instance (X : BoolAlgCat) : BooleanAlgebra X :=
+instance (X : BoolAlg) : BooleanAlgebra X :=
   X.str
 
-#print BoolAlgCat.of /-
+#print BoolAlg.of /-
 /-- Construct a bundled `BoolAlg` from a `boolean_algebra`. -/
-def of (α : Type _) [BooleanAlgebra α] : BoolAlgCat :=
+def of (α : Type _) [BooleanAlgebra α] : BoolAlg :=
   Bundled.of α
-#align BoolAlg.of BoolAlgCat.of
+#align BoolAlg.of BoolAlg.of
 -/
 
-#print BoolAlgCat.coe_of /-
+#print BoolAlg.coe_of /-
 @[simp]
 theorem coe_of (α : Type _) [BooleanAlgebra α] : ↥(of α) = α :=
   rfl
-#align BoolAlg.coe_of BoolAlgCat.coe_of
+#align BoolAlg.coe_of BoolAlg.coe_of
 -/
 
-instance : Inhabited BoolAlgCat :=
+instance : Inhabited BoolAlg :=
   ⟨of PUnit⟩
 
-#print BoolAlgCat.toBddDistLatCat /-
+#print BoolAlg.toBddDistLat /-
 /-- Turn a `BoolAlg` into a `BddDistLat` by forgetting its complement operation. -/
-def toBddDistLatCat (X : BoolAlgCat) : BddDistLatCat :=
-  BddDistLatCat.of X
-#align BoolAlg.to_BddDistLat BoolAlgCat.toBddDistLatCat
+def toBddDistLat (X : BoolAlg) : BddDistLat :=
+  BddDistLat.of X
+#align BoolAlg.to_BddDistLat BoolAlg.toBddDistLat
 -/
 
-#print BoolAlgCat.coe_toBddDistLatCat /-
+#print BoolAlg.coe_toBddDistLat /-
 @[simp]
-theorem coe_toBddDistLatCat (X : BoolAlgCat) : ↥X.toBddDistLatCat = ↥X :=
+theorem coe_toBddDistLat (X : BoolAlg) : ↥X.toBddDistLat = ↥X :=
   rfl
-#align BoolAlg.coe_to_BddDistLat BoolAlgCat.coe_toBddDistLatCat
+#align BoolAlg.coe_to_BddDistLat BoolAlg.coe_toBddDistLat
 -/
 
-instance : LargeCategory.{u} BoolAlgCat :=
-  InducedCategory.category toBddDistLatCat
+instance : LargeCategory.{u} BoolAlg :=
+  InducedCategory.category toBddDistLat
 
-instance : ConcreteCategory BoolAlgCat :=
-  InducedCategory.concreteCategory toBddDistLatCat
+instance : ConcreteCategory BoolAlg :=
+  InducedCategory.concreteCategory toBddDistLat
 
-#print BoolAlgCat.hasForgetToBddDistLatCat /-
-instance hasForgetToBddDistLatCat : HasForget₂ BoolAlgCat BddDistLatCat :=
-  InducedCategory.hasForget₂ toBddDistLatCat
-#align BoolAlg.has_forget_to_BddDistLat BoolAlgCat.hasForgetToBddDistLatCat
+#print BoolAlg.hasForgetToBddDistLat /-
+instance hasForgetToBddDistLat : HasForget₂ BoolAlg BddDistLat :=
+  InducedCategory.hasForget₂ toBddDistLat
+#align BoolAlg.has_forget_to_BddDistLat BoolAlg.hasForgetToBddDistLat
 -/
 
 section
 
 attribute [local instance] BoundedLatticeHomClass.toBiheytingHomClass
 
-#print BoolAlgCat.hasForgetToHeytAlgCat /-
+#print BoolAlg.hasForgetToHeytAlg /-
 @[simps]
-instance hasForgetToHeytAlgCat : HasForget₂ BoolAlgCat HeytAlgCat
+instance hasForgetToHeytAlg : HasForget₂ BoolAlg HeytAlg
     where forget₂ :=
     { obj := fun X => ⟨X⟩
       map := fun X Y f => show BoundedLatticeHom X Y from f }
-#align BoolAlg.has_forget_to_HeytAlg BoolAlgCat.hasForgetToHeytAlgCat
+#align BoolAlg.has_forget_to_HeytAlg BoolAlg.hasForgetToHeytAlg
 -/
 
 end
 
-#print BoolAlgCat.Iso.mk /-
+#print BoolAlg.Iso.mk /-
 /-- Constructs an equivalence between Boolean algebras from an order isomorphism between them. -/
 @[simps]
-def Iso.mk {α β : BoolAlgCat.{u}} (e : α ≃o β) : α ≅ β
+def Iso.mk {α β : BoolAlg.{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 BoolAlg.iso.mk BoolAlgCat.Iso.mk
+#align BoolAlg.iso.mk BoolAlg.Iso.mk
 -/
 
-#print BoolAlgCat.dual /-
+#print BoolAlg.dual /-
 /-- `order_dual` as a functor. -/
 @[simps]
-def dual : BoolAlgCat ⥤ BoolAlgCat where
+def dual : BoolAlg ⥤ BoolAlg where
   obj X := of Xᵒᵈ
   map X Y := BoundedLatticeHom.dual
-#align BoolAlg.dual BoolAlgCat.dual
+#align BoolAlg.dual BoolAlg.dual
 -/
 
-#print BoolAlgCat.dualEquiv /-
+#print BoolAlg.dualEquiv /-
 /-- The equivalence between `BoolAlg` and itself induced by `order_dual` both ways. -/
 @[simps Functor inverse]
-def dualEquiv : BoolAlgCat ≌ BoolAlgCat :=
+def dualEquiv : BoolAlg ≌ BoolAlg :=
   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 BoolAlg.dual_equiv BoolAlgCat.dualEquiv
+#align BoolAlg.dual_equiv BoolAlg.dualEquiv
 -/
 
-end BoolAlgCat
+end BoolAlg
 
-#print boolAlgCat_dual_comp_forget_to_bddDistLatCat /-
-theorem boolAlgCat_dual_comp_forget_to_bddDistLatCat :
-    BoolAlgCat.dual ⋙ forget₂ BoolAlgCat BddDistLatCat =
-      forget₂ BoolAlgCat BddDistLatCat ⋙ BddDistLatCat.dual :=
+#print boolAlg_dual_comp_forget_to_bddDistLat /-
+theorem boolAlg_dual_comp_forget_to_bddDistLat :
+    BoolAlg.dual ⋙ forget₂ BoolAlg BddDistLat = forget₂ BoolAlg BddDistLat ⋙ BddDistLat.dual :=
   rfl
-#align BoolAlg_dual_comp_forget_to_BddDistLat boolAlgCat_dual_comp_forget_to_bddDistLatCat
+#align BoolAlg_dual_comp_forget_to_BddDistLat boolAlg_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,14 +2,11 @@
 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.BoolAlg
-! 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.Order.Category.HeytAlg
 
+#align_import order.category.BoolAlg from "leanprover-community/mathlib"@"cff8231f04dfa33fd8f2f45792eebd862ef30cad"
+
 /-!
 # The category of boolean algebras

cff8231f

bump to nightly-2023-06-18-23

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

3b5e23dc

Diff

@@ -26,94 +26,117 @@ universe u
 
 open CategoryTheory
 
+#print BoolAlgCat /-
 /-- The category of boolean algebras. -/
-def BoolAlg :=
+def BoolAlgCat :=
   Bundled BooleanAlgebra
-#align BoolAlg BoolAlg
+#align BoolAlg BoolAlgCat
+-/
 
-namespace BoolAlg
+namespace BoolAlgCat
 
-instance : CoeSort BoolAlg (Type _) :=
+instance : CoeSort BoolAlgCat (Type _) :=
   Bundled.hasCoeToSort
 
-instance (X : BoolAlg) : BooleanAlgebra X :=
+instance (X : BoolAlgCat) : BooleanAlgebra X :=
   X.str
 
+#print BoolAlgCat.of /-
 /-- Construct a bundled `BoolAlg` from a `boolean_algebra`. -/
-def of (α : Type _) [BooleanAlgebra α] : BoolAlg :=
+def of (α : Type _) [BooleanAlgebra α] : BoolAlgCat :=
   Bundled.of α
-#align BoolAlg.of BoolAlg.of
+#align BoolAlg.of BoolAlgCat.of
+-/
 
+#print BoolAlgCat.coe_of /-
 @[simp]
 theorem coe_of (α : Type _) [BooleanAlgebra α] : ↥(of α) = α :=
   rfl
-#align BoolAlg.coe_of BoolAlg.coe_of
+#align BoolAlg.coe_of BoolAlgCat.coe_of
+-/
 
-instance : Inhabited BoolAlg :=
+instance : Inhabited BoolAlgCat :=
   ⟨of PUnit⟩
 
+#print BoolAlgCat.toBddDistLatCat /-
 /-- Turn a `BoolAlg` into a `BddDistLat` by forgetting its complement operation. -/
-def toBddDistLat (X : BoolAlg) : BddDistLat :=
-  BddDistLat.of X
-#align BoolAlg.to_BddDistLat BoolAlg.toBddDistLat
+def toBddDistLatCat (X : BoolAlgCat) : BddDistLatCat :=
+  BddDistLatCat.of X
+#align BoolAlg.to_BddDistLat BoolAlgCat.toBddDistLatCat
+-/
 
+#print BoolAlgCat.coe_toBddDistLatCat /-
 @[simp]
-theorem coe_toBddDistLat (X : BoolAlg) : ↥X.toBddDistLat = ↥X :=
+theorem coe_toBddDistLatCat (X : BoolAlgCat) : ↥X.toBddDistLatCat = ↥X :=
   rfl
-#align BoolAlg.coe_to_BddDistLat BoolAlg.coe_toBddDistLat
+#align BoolAlg.coe_to_BddDistLat BoolAlgCat.coe_toBddDistLatCat
+-/
 
-instance : LargeCategory.{u} BoolAlg :=
-  InducedCategory.category toBddDistLat
+instance : LargeCategory.{u} BoolAlgCat :=
+  InducedCategory.category toBddDistLatCat
 
-instance : ConcreteCategory BoolAlg :=
-  InducedCategory.concreteCategory toBddDistLat
+instance : ConcreteCategory BoolAlgCat :=
+  InducedCategory.concreteCategory toBddDistLatCat
 
-instance hasForgetToBddDistLat : HasForget₂ BoolAlg BddDistLat :=
-  InducedCategory.hasForget₂ toBddDistLat
-#align BoolAlg.has_forget_to_BddDistLat BoolAlg.hasForgetToBddDistLat
+#print BoolAlgCat.hasForgetToBddDistLatCat /-
+instance hasForgetToBddDistLatCat : HasForget₂ BoolAlgCat BddDistLatCat :=
+  InducedCategory.hasForget₂ toBddDistLatCat
+#align BoolAlg.has_forget_to_BddDistLat BoolAlgCat.hasForgetToBddDistLatCat
+-/
 
 section
 
 attribute [local instance] BoundedLatticeHomClass.toBiheytingHomClass
 
+#print BoolAlgCat.hasForgetToHeytAlgCat /-
 @[simps]
-instance hasForgetToHeytAlg : HasForget₂ BoolAlg HeytAlg
+instance hasForgetToHeytAlgCat : HasForget₂ BoolAlgCat HeytAlgCat
     where forget₂ :=
     { obj := fun X => ⟨X⟩
       map := fun X Y f => show BoundedLatticeHom X Y from f }
-#align BoolAlg.has_forget_to_HeytAlg BoolAlg.hasForgetToHeytAlg
+#align BoolAlg.has_forget_to_HeytAlg BoolAlgCat.hasForgetToHeytAlgCat
+-/
 
 end
 
+#print BoolAlgCat.Iso.mk /-
 /-- Constructs an equivalence between Boolean algebras from an order isomorphism between them. -/
 @[simps]
-def Iso.mk {α β : BoolAlg.{u}} (e : α ≃o β) : α ≅ β
+def Iso.mk {α β : BoolAlgCat.{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 BoolAlg.iso.mk BoolAlg.Iso.mk
+#align BoolAlg.iso.mk BoolAlgCat.Iso.mk
+-/
 
+#print BoolAlgCat.dual /-
 /-- `order_dual` as a functor. -/
 @[simps]
-def dual : BoolAlg ⥤ BoolAlg where
+def dual : BoolAlgCat ⥤ BoolAlgCat where
   obj X := of Xᵒᵈ
   map X Y := BoundedLatticeHom.dual
-#align BoolAlg.dual BoolAlg.dual
+#align BoolAlg.dual BoolAlgCat.dual
+-/
 
+#print BoolAlgCat.dualEquiv /-
 /-- The equivalence between `BoolAlg` and itself induced by `order_dual` both ways. -/
 @[simps Functor inverse]
-def dualEquiv : BoolAlg ≌ BoolAlg :=
+def dualEquiv : BoolAlgCat ≌ BoolAlgCat :=
   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 BoolAlg.dual_equiv BoolAlg.dualEquiv
+#align BoolAlg.dual_equiv BoolAlgCat.dualEquiv
+-/
 
-end BoolAlg
+end BoolAlgCat
 
-theorem boolAlg_dual_comp_forget_to_bddDistLat :
-    BoolAlg.dual ⋙ forget₂ BoolAlg BddDistLat = forget₂ BoolAlg BddDistLat ⋙ BddDistLat.dual :=
+#print boolAlgCat_dual_comp_forget_to_bddDistLatCat /-
+theorem boolAlgCat_dual_comp_forget_to_bddDistLatCat :
+    BoolAlgCat.dual ⋙ forget₂ BoolAlgCat BddDistLatCat =
+      forget₂ BoolAlgCat BddDistLatCat ⋙ BddDistLatCat.dual :=
   rfl
-#align BoolAlg_dual_comp_forget_to_BddDistLat boolAlg_dual_comp_forget_to_bddDistLat
+#align BoolAlg_dual_comp_forget_to_BddDistLat boolAlgCat_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.BoolAlg
-! leanprover-community/mathlib commit e8ac6315bcfcbaf2d19a046719c3b553206dac75
+! leanprover-community/mathlib commit cff8231f04dfa33fd8f2f45792eebd862ef30cad
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -13,6 +13,9 @@ import Mathbin.Order.Category.HeytAlg
 /-!
 # The category of boolean algebras
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 This defines `BoolAlg`, the category of boolean algebras.
 -/

e8ac6315

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -88,12 +88,8 @@ def Iso.mk {α β : BoolAlg.{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 BoolAlg.iso.mk BoolAlg.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

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.BoolAlg
-! leanprover-community/mathlib commit 51cbe88849c5bcf9eaf8e38f2bbdf1a44bbabe0c
+! leanprover-community/mathlib commit e8ac6315bcfcbaf2d19a046719c3b553206dac75
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -49,25 +49,25 @@ theorem coe_of (α : Type _) [BooleanAlgebra α] : ↥(of α) = α :=
 instance : Inhabited BoolAlg :=
   ⟨of PUnit⟩
 
-/-- Turn a `BoolAlg` into a `BoundedDistribLattice` by forgetting its complement operation. -/
-def toBoundedDistribLattice (X : BoolAlg) : BoundedDistribLattice :=
-  BoundedDistribLattice.of X
-#align BoolAlg.to_BoundedDistribLattice BoolAlg.toBoundedDistribLattice
+/-- Turn a `BoolAlg` into a `BddDistLat` by forgetting its complement operation. -/
+def toBddDistLat (X : BoolAlg) : BddDistLat :=
+  BddDistLat.of X
+#align BoolAlg.to_BddDistLat BoolAlg.toBddDistLat
 
 @[simp]
-theorem coe_toBoundedDistribLattice (X : BoolAlg) : ↥X.toBoundedDistribLattice = ↥X :=
+theorem coe_toBddDistLat (X : BoolAlg) : ↥X.toBddDistLat = ↥X :=
   rfl
-#align BoolAlg.coe_to_BoundedDistribLattice BoolAlg.coe_toBoundedDistribLattice
+#align BoolAlg.coe_to_BddDistLat BoolAlg.coe_toBddDistLat
 
 instance : LargeCategory.{u} BoolAlg :=
-  InducedCategory.category toBoundedDistribLattice
+  InducedCategory.category toBddDistLat
 
 instance : ConcreteCategory BoolAlg :=
-  InducedCategory.concreteCategory toBoundedDistribLattice
+  InducedCategory.concreteCategory toBddDistLat
 
-instance hasForgetToBoundedDistribLattice : HasForget₂ BoolAlg BoundedDistribLattice :=
-  InducedCategory.hasForget₂ toBoundedDistribLattice
-#align BoolAlg.has_forget_to_BoundedDistribLattice BoolAlg.hasForgetToBoundedDistribLattice
+instance hasForgetToBddDistLat : HasForget₂ BoolAlg BddDistLat :=
+  InducedCategory.hasForget₂ toBddDistLat
+#align BoolAlg.has_forget_to_BddDistLat BoolAlg.hasForgetToBddDistLat
 
 section
 
@@ -113,9 +113,8 @@ def dualEquiv : BoolAlg ≌ BoolAlg :=
 
 end BoolAlg
 
-theorem boolAlg_dual_comp_forget_to_boundedDistribLattice :
-    BoolAlg.dual ⋙ forget₂ BoolAlg BoundedDistribLattice =
-      forget₂ BoolAlg BoundedDistribLattice ⋙ BoundedDistribLattice.dual :=
+theorem boolAlg_dual_comp_forget_to_bddDistLat :
+    BoolAlg.dual ⋙ forget₂ BoolAlg BddDistLat = forget₂ BoolAlg BddDistLat ⋙ BddDistLat.dual :=
   rfl
-#align BoolAlg_dual_comp_forget_to_BoundedDistribLattice boolAlg_dual_comp_forget_to_boundedDistribLattice
+#align BoolAlg_dual_comp_forget_to_BddDistLat boolAlg_dual_comp_forget_to_bddDistLat

51cbe888

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

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

@@ -28,19 +28,19 @@ def BoolAlgCat :=
 
 namespace BoolAlgCat
 
-instance : CoeSort BoolAlgCat (Type _) :=
+instance : CoeSort BoolAlgCat (Type*) :=
   Bundled.coeSort
 
 instance instBooleanAlgebra (X : BoolAlgCat) : BooleanAlgebra X :=
   X.str
 
 /-- Construct a bundled `BoolAlgCat` from a `BooleanAlgebra`. -/
-def of (α : Type _) [BooleanAlgebra α] : BoolAlgCat :=
+def of (α : Type*) [BooleanAlgebra α] : BoolAlgCat :=
   Bundled.of α
 #align BoolAlg.of BoolAlgCat.of
 
 @[simp]
-theorem coe_of (α : Type _) [BooleanAlgebra α] : ↥(of α) = α :=
+theorem coe_of (α : Type*) [BooleanAlgebra α] : ↥(of α) = α :=
   rfl
 #align BoolAlg.coe_of BoolAlgCat.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,14 +2,11 @@
 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.BoolAlg
-! 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.HeytAlgCat
 
+#align_import order.category.BoolAlg from "leanprover-community/mathlib"@"e8ac6315bcfcbaf2d19a046719c3b553206dac75"
+
 /-!
 # The category of boolean algebras

e8ac6315

chore: tidy various files (#5233)

697ac1d3

Diff

@@ -37,7 +37,7 @@ instance : CoeSort BoolAlgCat (Type _) :=
 instance instBooleanAlgebra (X : BoolAlgCat) : BooleanAlgebra X :=
   X.str
 
-/-- Construct a bundled `BoolAlgCat` from a `boolean_algebra`. -/
+/-- Construct a bundled `BoolAlgCat` from a `BooleanAlgebra`. -/
 def of (α : Type _) [BooleanAlgebra α] : BoolAlgCat :=
   Bundled.of α
 #align BoolAlg.of BoolAlgCat.of

e8ac6315

feat: port Algebra.Category.BoolRingCat (#5053)

a9540a65

Diff

@@ -34,7 +34,7 @@ namespace BoolAlgCat
 instance : CoeSort BoolAlgCat (Type _) :=
   Bundled.coeSort
 
-instance (X : BoolAlgCat) : BooleanAlgebra X :=
+instance instBooleanAlgebra (X : BoolAlgCat) : BooleanAlgebra X :=
   X.str
 
 /-- Construct a bundled `BoolAlgCat` from a `boolean_algebra`. -/

e8ac6315

feat: port Order.Category.BoolAlgCat (#5023)

ac61d012

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

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 131

order.category.BoolAlg ⟷ Mathlib.Order.Category.BoolAlg

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 131

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