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

2ed2c631

bump to nightly-2024-04-14-09

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

f736ea6b

Diff

@@ -113,7 +113,8 @@ def topCatOpToFrm : TopCatᵒᵖ ⥤ Frm
 
 #print CompHausOpToFrame.faithful /-
 -- Note, `CompHaus` is too strong. We only need `t0_space`.
-instance CompHausOpToFrame.faithful : Faithful (compHausToTop.op ⋙ topCatOpToFrm.{u}) :=
+instance CompHausOpToFrame.faithful :
+    CategoryTheory.Functor.Faithful (compHausToTop.op ⋙ topCatOpToFrm.{u}) :=
   ⟨fun X Y f g h => Quiver.Hom.unop_inj <| Opens.comap_injective h⟩
 #align CompHaus_op_to_Frame.faithful CompHausOpToFrame.faithful
 -/

2ed2c631

bump to nightly-2024-01-19-06

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

33b57512

Diff

@@ -72,7 +72,7 @@ abbrev Hom (α β : Type _) [Frame α] [Frame β] : Type _ :=
 instance bundledHom : BundledHom Hom :=
   ⟨fun α β [Frame α] [Frame β] => (coeFn : FrameHom α β → α → β), fun α [Frame α] => FrameHom.id α,
     fun α β γ [Frame α] [Frame β] [Frame γ] => FrameHom.comp, fun α β [Frame α] [Frame β] =>
-    FunLike.coe_injective⟩
+    DFunLike.coe_injective⟩
 #align Frm.bundled_hom Frm.bundledHom
 -/

2ed2c631

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,10 +3,10 @@ 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.Lat
-import Mathbin.Order.Hom.CompleteLattice
-import Mathbin.Topology.Category.CompHaus.Basic
-import Mathbin.Topology.Sets.Opens
+import Order.Category.Lat
+import Order.Hom.CompleteLattice
+import Topology.Category.CompHaus.Basic
+import Topology.Sets.Opens
 
 #align_import order.category.Frm from "leanprover-community/mathlib"@"2ed2c6310e6f1c5562bdf6bfbda55ebbf6891abe"
 
@@ -28,92 +28,92 @@ universe u
 
 open CategoryTheory Opposite Order TopologicalSpace
 
-#print FrmCat /-
+#print Frm /-
 /-- The category of frames. -/
-def FrmCat :=
+def Frm :=
   Bundled Frame
-#align Frm FrmCat
+#align Frm Frm
 -/
 
-namespace FrmCat
+namespace Frm
 
-instance : CoeSort FrmCat (Type _) :=
+instance : CoeSort Frm (Type _) :=
   Bundled.hasCoeToSort
 
-instance (X : FrmCat) : Frame X :=
+instance (X : Frm) : Frame X :=
   X.str
 
-#print FrmCat.of /-
+#print Frm.of /-
 /-- Construct a bundled `Frm` from a `frame`. -/
-def of (α : Type _) [Frame α] : FrmCat :=
+def of (α : Type _) [Frame α] : Frm :=
   Bundled.of α
-#align Frm.of FrmCat.of
+#align Frm.of Frm.of
 -/
 
-#print FrmCat.coe_of /-
+#print Frm.coe_of /-
 @[simp]
 theorem coe_of (α : Type _) [Frame α] : ↥(of α) = α :=
   rfl
-#align Frm.coe_of FrmCat.coe_of
+#align Frm.coe_of Frm.coe_of
 -/
 
-instance : Inhabited FrmCat :=
+instance : Inhabited Frm :=
   ⟨of PUnit⟩
 
-#print FrmCat.Hom /-
+#print Frm.Hom /-
 /-- An abbreviation of `frame_hom` that assumes `frame` instead of the weaker `complete_lattice`.
 Necessary for the category theory machinery. -/
 abbrev Hom (α β : Type _) [Frame α] [Frame β] : Type _ :=
   FrameHom α β
-#align Frm.hom FrmCat.Hom
+#align Frm.hom Frm.Hom
 -/
 
-#print FrmCat.bundledHom /-
+#print Frm.bundledHom /-
 instance bundledHom : BundledHom Hom :=
   ⟨fun α β [Frame α] [Frame β] => (coeFn : FrameHom α β → α → β), fun α [Frame α] => FrameHom.id α,
     fun α β γ [Frame α] [Frame β] [Frame γ] => FrameHom.comp, fun α β [Frame α] [Frame β] =>
     FunLike.coe_injective⟩
-#align Frm.bundled_hom FrmCat.bundledHom
+#align Frm.bundled_hom Frm.bundledHom
 -/
 
-deriving instance LargeCategory, ConcreteCategory for FrmCat
+deriving instance LargeCategory, ConcreteCategory for Frm
 
-#print FrmCat.hasForgetToLat /-
-instance hasForgetToLat : HasForget₂ FrmCat LatCat
+#print Frm.hasForgetToLat /-
+instance hasForgetToLat : HasForget₂ Frm Lat
     where forget₂ :=
     { obj := fun X => ⟨X⟩
       map := fun X Y => FrameHom.toLatticeHom }
-#align Frm.has_forget_to_Lat FrmCat.hasForgetToLat
+#align Frm.has_forget_to_Lat Frm.hasForgetToLat
 -/
 
-#print FrmCat.Iso.mk /-
+#print Frm.Iso.mk /-
 /-- Constructs an isomorphism of frames from an order isomorphism between them. -/
 @[simps]
-def Iso.mk {α β : FrmCat.{u}} (e : α ≃o β) : α ≅ β
+def Iso.mk {α β : Frm.{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 Frm.iso.mk FrmCat.Iso.mk
+#align Frm.iso.mk Frm.Iso.mk
 -/
 
-end FrmCat
+end Frm
 
-#print topCatOpToFrameCat /-
+#print topCatOpToFrm /-
 /-- The forgetful functor from `Topᵒᵖ` to `Frm`. -/
 @[simps]
-def topCatOpToFrameCat : TopCatᵒᵖ ⥤ FrmCat
+def topCatOpToFrm : TopCatᵒᵖ ⥤ Frm
     where
-  obj X := FrmCat.of (Opens (unop X : TopCat))
+  obj X := Frm.of (Opens (unop X : TopCat))
   map X Y f := Opens.comap <| Quiver.Hom.unop f
   map_id' X := Opens.comap_id
-#align Top_op_to_Frame topCatOpToFrameCat
+#align Top_op_to_Frame topCatOpToFrm
 -/
 
 #print CompHausOpToFrame.faithful /-
 -- Note, `CompHaus` is too strong. We only need `t0_space`.
-instance CompHausOpToFrame.faithful : Faithful (compHausToTop.op ⋙ topCatOpToFrameCat.{u}) :=
+instance CompHausOpToFrame.faithful : Faithful (compHausToTop.op ⋙ topCatOpToFrm.{u}) :=
   ⟨fun X Y f g h => Quiver.Hom.unop_inj <| Opens.comap_injective h⟩
 #align CompHaus_op_to_Frame.faithful CompHausOpToFrame.faithful
 -/

2ed2c631

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,17 +2,14 @@
 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.Frm
-! leanprover-community/mathlib commit 2ed2c6310e6f1c5562bdf6bfbda55ebbf6891abe
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Order.Category.Lat
 import Mathbin.Order.Hom.CompleteLattice
 import Mathbin.Topology.Category.CompHaus.Basic
 import Mathbin.Topology.Sets.Opens
 
+#align_import order.category.Frm from "leanprover-community/mathlib"@"2ed2c6310e6f1c5562bdf6bfbda55ebbf6891abe"
+
 /-!
 # The category of frames

2ed2c631

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -81,11 +81,13 @@ instance bundledHom : BundledHom Hom :=
 
 deriving instance LargeCategory, ConcreteCategory for FrmCat
 
+#print FrmCat.hasForgetToLat /-
 instance hasForgetToLat : HasForget₂ FrmCat LatCat
     where forget₂ :=
     { obj := fun X => ⟨X⟩
       map := fun X Y => FrameHom.toLatticeHom }
 #align Frm.has_forget_to_Lat FrmCat.hasForgetToLat
+-/
 
 #print FrmCat.Iso.mk /-
 /-- Constructs an isomorphism of frames from an order isomorphism between them. -/

2ed2c631

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -87,6 +87,7 @@ instance hasForgetToLat : HasForget₂ FrmCat LatCat
       map := fun X Y => FrameHom.toLatticeHom }
 #align Frm.has_forget_to_Lat FrmCat.hasForgetToLat
 
+#print FrmCat.Iso.mk /-
 /-- Constructs an isomorphism of frames from an order isomorphism between them. -/
 @[simps]
 def Iso.mk {α β : FrmCat.{u}} (e : α ≃o β) : α ≅ β
@@ -96,6 +97,7 @@ def Iso.mk {α β : FrmCat.{u}} (e : α ≃o β) : α ≅ β
   hom_inv_id' := by ext; exact e.symm_apply_apply _
   inv_hom_id' := by ext; exact e.apply_symm_apply _
 #align Frm.iso.mk FrmCat.Iso.mk
+-/
 
 end FrmCat

2ed2c631

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -81,24 +81,12 @@ instance bundledHom : BundledHom Hom :=
 
 deriving instance LargeCategory, ConcreteCategory for FrmCat
 
-/- warning: Frm.has_forget_to_Lat -> FrmCat.hasForgetToLat is a dubious translation:
-lean 3 declaration is
-  CategoryTheory.HasForget₂.{succ u1, succ u1, u1, u1, u1} FrmCat.{u1} LatCat.{u1} FrmCat.largeCategory.{u1} FrmCat.concreteCategory.{u1} LatCat.CategoryTheory.largeCategory.{u1} LatCat.CategoryTheory.concreteCategory.{u1}
-but is expected to have type
-  CategoryTheory.HasForget₂.{succ u1, succ u1, u1, u1, u1} FrmCat.{u1} LatCat.{u1} instFrmCatCategory.{u1} FrmCat.instConcreteCategoryFrmCatInstFrmCatCategory.{u1} LatCat.instLargeCategoryLatCat.{u1} LatCat.instConcreteCategoryLatCatInstLargeCategoryLatCat.{u1}
-Case conversion may be inaccurate. Consider using '#align Frm.has_forget_to_Lat FrmCat.hasForgetToLatₓ'. -/
 instance hasForgetToLat : HasForget₂ FrmCat LatCat
     where forget₂ :=
     { obj := fun X => ⟨X⟩
       map := fun X Y => FrameHom.toLatticeHom }
 #align Frm.has_forget_to_Lat FrmCat.hasForgetToLat
 
-/- warning: Frm.iso.mk -> FrmCat.Iso.mk is a dubious translation:
-lean 3 declaration is
-  forall {α : FrmCat.{u1}} {β : FrmCat.{u1}}, (OrderIso.{u1, u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} α) (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} β) (Preorder.toHasLe.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} α) (PartialOrder.toPreorder.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} α) (CompleteSemilatticeInf.toPartialOrder.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} α) (CompleteLattice.toCompleteSemilatticeInf.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} α) (Order.Frame.toCompleteLattice.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} α) (FrmCat.Order.frame.{u1} α)))))) (Preorder.toHasLe.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} β) (PartialOrder.toPreorder.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} β) (CompleteSemilatticeInf.toPartialOrder.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} β) (CompleteLattice.toCompleteSemilatticeInf.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} β) (Order.Frame.toCompleteLattice.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} β) (FrmCat.Order.frame.{u1} β))))))) -> (CategoryTheory.Iso.{u1, succ u1} FrmCat.{u1} FrmCat.largeCategory.{u1} α β)
-but is expected to have type
-  forall {α : FrmCat.{u1}} {β : FrmCat.{u1}}, (OrderIso.{u1, u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} α) (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} β) (Preorder.toLE.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} α) (PartialOrder.toPreorder.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} α) (OmegaCompletePartialOrder.toPartialOrder.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} α) (CompleteLattice.instOmegaCompletePartialOrder.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} α) (Order.Frame.toCompleteLattice.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} α) (FrmCat.instFrameα.{u1} α)))))) (Preorder.toLE.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} β) (PartialOrder.toPreorder.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} β) (OmegaCompletePartialOrder.toPartialOrder.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} β) (CompleteLattice.instOmegaCompletePartialOrder.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} β) (Order.Frame.toCompleteLattice.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} β) (FrmCat.instFrameα.{u1} β))))))) -> (CategoryTheory.Iso.{u1, succ u1} FrmCat.{u1} instFrmCatCategory.{u1} α β)
-Case conversion may be inaccurate. Consider using '#align Frm.iso.mk FrmCat.Iso.mkₓ'. -/
 /-- Constructs an isomorphism of frames from an order isomorphism between them. -/
 @[simps]
 def Iso.mk {α β : FrmCat.{u}} (e : α ≃o β) : α ≅ β

2ed2c631

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -105,12 +105,8 @@ def Iso.mk {α β : FrmCat.{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 Frm.iso.mk FrmCat.Iso.mk
 
 end FrmCat

2ed2c631

bump to nightly-2023-05-18-03

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

b46e9d53

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.Frm
-! leanprover-community/mathlib commit e8ac6315bcfcbaf2d19a046719c3b553206dac75
+! leanprover-community/mathlib commit 2ed2c6310e6f1c5562bdf6bfbda55ebbf6891abe
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -16,6 +16,9 @@ import Mathbin.Topology.Sets.Opens
 /-!
 # The category of frames
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 This file defines `Frm`, the category of frames.
 
 ## References

e8ac6315

bump to nightly-2023-05-16-16

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

9cb92e8c

Diff

@@ -90,7 +90,12 @@ instance hasForgetToLat : HasForget₂ FrmCat LatCat
       map := fun X Y => FrameHom.toLatticeHom }
 #align Frm.has_forget_to_Lat FrmCat.hasForgetToLat
 
-#print FrmCat.Iso.mk /-
+/- warning: Frm.iso.mk -> FrmCat.Iso.mk is a dubious translation:
+lean 3 declaration is
+  forall {α : FrmCat.{u1}} {β : FrmCat.{u1}}, (OrderIso.{u1, u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} α) (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} β) (Preorder.toHasLe.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} α) (PartialOrder.toPreorder.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} α) (CompleteSemilatticeInf.toPartialOrder.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} α) (CompleteLattice.toCompleteSemilatticeInf.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} α) (Order.Frame.toCompleteLattice.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} α) (FrmCat.Order.frame.{u1} α)))))) (Preorder.toHasLe.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} β) (PartialOrder.toPreorder.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} β) (CompleteSemilatticeInf.toPartialOrder.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} β) (CompleteLattice.toCompleteSemilatticeInf.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} β) (Order.Frame.toCompleteLattice.{u1} (coeSort.{succ (succ u1), succ (succ u1)} FrmCat.{u1} Type.{u1} FrmCat.hasCoeToSort.{u1} β) (FrmCat.Order.frame.{u1} β))))))) -> (CategoryTheory.Iso.{u1, succ u1} FrmCat.{u1} FrmCat.largeCategory.{u1} α β)
+but is expected to have type
+  forall {α : FrmCat.{u1}} {β : FrmCat.{u1}}, (OrderIso.{u1, u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} α) (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} β) (Preorder.toLE.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} α) (PartialOrder.toPreorder.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} α) (OmegaCompletePartialOrder.toPartialOrder.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} α) (CompleteLattice.instOmegaCompletePartialOrder.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} α) (Order.Frame.toCompleteLattice.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} α) (FrmCat.instFrameα.{u1} α)))))) (Preorder.toLE.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} β) (PartialOrder.toPreorder.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} β) (OmegaCompletePartialOrder.toPartialOrder.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} β) (CompleteLattice.instOmegaCompletePartialOrder.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} β) (Order.Frame.toCompleteLattice.{u1} (CategoryTheory.Bundled.α.{u1, u1} Order.Frame.{u1} β) (FrmCat.instFrameα.{u1} β))))))) -> (CategoryTheory.Iso.{u1, succ u1} FrmCat.{u1} instFrmCatCategory.{u1} α β)
+Case conversion may be inaccurate. Consider using '#align Frm.iso.mk FrmCat.Iso.mkₓ'. -/
 /-- Constructs an isomorphism of frames from an order isomorphism between them. -/
 @[simps]
 def Iso.mk {α β : FrmCat.{u}} (e : α ≃o β) : α ≅ β
@@ -104,7 +109,6 @@ def Iso.mk {α β : FrmCat.{u}} (e : α ≃o β) : α ≅ β
     ext
     exact e.apply_symm_apply _
 #align Frm.iso.mk FrmCat.Iso.mk
--/
 
 end FrmCat

e8ac6315

bump to nightly-2023-05-15-12

mathlib commit https://github.com/leanprover-community/mathlib/commit/7ad820c4997738e2f542f8a20f32911f52020e26

f3ad2973

Diff

@@ -28,55 +28,72 @@ universe u
 
 open CategoryTheory Opposite Order TopologicalSpace
 
+#print FrmCat /-
 /-- The category of frames. -/
-def Frm :=
+def FrmCat :=
   Bundled Frame
-#align Frm Frm
+#align Frm FrmCat
+-/
 
-namespace Frm
+namespace FrmCat
 
-instance : CoeSort Frm (Type _) :=
+instance : CoeSort FrmCat (Type _) :=
   Bundled.hasCoeToSort
 
-instance (X : Frm) : Frame X :=
+instance (X : FrmCat) : Frame X :=
   X.str
 
+#print FrmCat.of /-
 /-- Construct a bundled `Frm` from a `frame`. -/
-def of (α : Type _) [Frame α] : Frm :=
+def of (α : Type _) [Frame α] : FrmCat :=
   Bundled.of α
-#align Frm.of Frm.of
+#align Frm.of FrmCat.of
+-/
 
+#print FrmCat.coe_of /-
 @[simp]
 theorem coe_of (α : Type _) [Frame α] : ↥(of α) = α :=
   rfl
-#align Frm.coe_of Frm.coe_of
+#align Frm.coe_of FrmCat.coe_of
+-/
 
-instance : Inhabited Frm :=
+instance : Inhabited FrmCat :=
   ⟨of PUnit⟩
 
+#print FrmCat.Hom /-
 /-- An abbreviation of `frame_hom` that assumes `frame` instead of the weaker `complete_lattice`.
 Necessary for the category theory machinery. -/
 abbrev Hom (α β : Type _) [Frame α] [Frame β] : Type _ :=
   FrameHom α β
-#align Frm.hom Frm.Hom
+#align Frm.hom FrmCat.Hom
+-/
 
+#print FrmCat.bundledHom /-
 instance bundledHom : BundledHom Hom :=
   ⟨fun α β [Frame α] [Frame β] => (coeFn : FrameHom α β → α → β), fun α [Frame α] => FrameHom.id α,
     fun α β γ [Frame α] [Frame β] [Frame γ] => FrameHom.comp, fun α β [Frame α] [Frame β] =>
     FunLike.coe_injective⟩
-#align Frm.bundled_hom Frm.bundledHom
+#align Frm.bundled_hom FrmCat.bundledHom
+-/
 
-deriving instance LargeCategory, ConcreteCategory for Frm
+deriving instance LargeCategory, ConcreteCategory for FrmCat
 
-instance hasForgetToLat : HasForget₂ Frm LatCat
+/- warning: Frm.has_forget_to_Lat -> FrmCat.hasForgetToLat is a dubious translation:
+lean 3 declaration is
+  CategoryTheory.HasForget₂.{succ u1, succ u1, u1, u1, u1} FrmCat.{u1} LatCat.{u1} FrmCat.largeCategory.{u1} FrmCat.concreteCategory.{u1} LatCat.CategoryTheory.largeCategory.{u1} LatCat.CategoryTheory.concreteCategory.{u1}
+but is expected to have type
+  CategoryTheory.HasForget₂.{succ u1, succ u1, u1, u1, u1} FrmCat.{u1} LatCat.{u1} instFrmCatCategory.{u1} FrmCat.instConcreteCategoryFrmCatInstFrmCatCategory.{u1} LatCat.instLargeCategoryLatCat.{u1} LatCat.instConcreteCategoryLatCatInstLargeCategoryLatCat.{u1}
+Case conversion may be inaccurate. Consider using '#align Frm.has_forget_to_Lat FrmCat.hasForgetToLatₓ'. -/
+instance hasForgetToLat : HasForget₂ FrmCat LatCat
     where forget₂ :=
     { obj := fun X => ⟨X⟩
       map := fun X Y => FrameHom.toLatticeHom }
-#align Frm.has_forget_to_Lat Frm.hasForgetToLat
+#align Frm.has_forget_to_Lat FrmCat.hasForgetToLat
 
+#print FrmCat.Iso.mk /-
 /-- Constructs an isomorphism of frames from an order isomorphism between them. -/
 @[simps]
-def Iso.mk {α β : Frm.{u}} (e : α ≃o β) : α ≅ β
+def Iso.mk {α β : FrmCat.{u}} (e : α ≃o β) : α ≅ β
     where
   Hom := e
   inv := e.symm
@@ -86,21 +103,26 @@ def Iso.mk {α β : Frm.{u}} (e : α ≃o β) : α ≅ β
   inv_hom_id' := by
     ext
     exact e.apply_symm_apply _
-#align Frm.iso.mk Frm.Iso.mk
+#align Frm.iso.mk FrmCat.Iso.mk
+-/
 
-end Frm
+end FrmCat
 
+#print topCatOpToFrameCat /-
 /-- The forgetful functor from `Topᵒᵖ` to `Frm`. -/
 @[simps]
-def topOpToFrame : TopCatᵒᵖ ⥤ Frm
+def topCatOpToFrameCat : TopCatᵒᵖ ⥤ FrmCat
     where
-  obj X := Frm.of (Opens (unop X : TopCat))
+  obj X := FrmCat.of (Opens (unop X : TopCat))
   map X Y f := Opens.comap <| Quiver.Hom.unop f
   map_id' X := Opens.comap_id
-#align Top_op_to_Frame topOpToFrame
+#align Top_op_to_Frame topCatOpToFrameCat
+-/
 
+#print CompHausOpToFrame.faithful /-
 -- Note, `CompHaus` is too strong. We only need `t0_space`.
-instance CompHausOpToFrame.faithful : Faithful (compHausToTop.op ⋙ topOpToFrame.{u}) :=
+instance CompHausOpToFrame.faithful : Faithful (compHausToTop.op ⋙ topCatOpToFrameCat.{u}) :=
   ⟨fun X Y f g h => Quiver.Hom.unop_inj <| Opens.comap_injective h⟩
 #align CompHaus_op_to_Frame.faithful CompHausOpToFrame.faithful
+-/

e8ac6315

bump to nightly-2023-04-05-16

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

523f1e96

Diff

@@ -68,7 +68,7 @@ instance bundledHom : BundledHom Hom :=
 
 deriving instance LargeCategory, ConcreteCategory for Frm
 
-instance hasForgetToLat : HasForget₂ Frm Lat
+instance hasForgetToLat : HasForget₂ Frm LatCat
     where forget₂ :=
     { obj := fun X => ⟨X⟩
       map := fun X Y => FrameHom.toLatticeHom }

e8ac6315

bump to nightly-2023-03-30-02

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

af7dd13c

Diff

@@ -3,12 +3,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.Frame
-! leanprover-community/mathlib commit 829895f162a1f29d0133f4b3538f4cd1fb5bffd3
+! This file was ported from Lean 3 source module order.category.Frm
+! leanprover-community/mathlib commit e8ac6315bcfcbaf2d19a046719c3b553206dac75
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
-import Mathbin.Order.Category.Lattice
+import Mathbin.Order.Category.Lat
 import Mathbin.Order.Hom.CompleteLattice
 import Mathbin.Topology.Category.CompHaus.Basic
 import Mathbin.Topology.Sets.Opens
@@ -16,7 +16,7 @@ import Mathbin.Topology.Sets.Opens
 /-!
 # The category of frames
 
-This file defines `Frame`, the category of frames.
+This file defines `Frm`, the category of frames.
 
 ## References
 
@@ -29,54 +29,54 @@ universe u
 open CategoryTheory Opposite Order TopologicalSpace
 
 /-- The category of frames. -/
-def Frame :=
+def Frm :=
   Bundled Frame
-#align Frame Frame
+#align Frm Frm
 
-namespace Frame
+namespace Frm
 
-instance : CoeSort Frame (Type _) :=
+instance : CoeSort Frm (Type _) :=
   Bundled.hasCoeToSort
 
-instance (X : Frame) : Frame X :=
+instance (X : Frm) : Frame X :=
   X.str
 
-/-- Construct a bundled `Frame` from a `frame`. -/
-def of (α : Type _) [Frame α] : Frame :=
+/-- Construct a bundled `Frm` from a `frame`. -/
+def of (α : Type _) [Frame α] : Frm :=
   Bundled.of α
-#align Frame.of Frame.of
+#align Frm.of Frm.of
 
 @[simp]
 theorem coe_of (α : Type _) [Frame α] : ↥(of α) = α :=
   rfl
-#align Frame.coe_of Frame.coe_of
+#align Frm.coe_of Frm.coe_of
 
-instance : Inhabited Frame :=
+instance : Inhabited Frm :=
   ⟨of PUnit⟩
 
 /-- An abbreviation of `frame_hom` that assumes `frame` instead of the weaker `complete_lattice`.
 Necessary for the category theory machinery. -/
 abbrev Hom (α β : Type _) [Frame α] [Frame β] : Type _ :=
   FrameHom α β
-#align Frame.hom Frame.Hom
+#align Frm.hom Frm.Hom
 
 instance bundledHom : BundledHom Hom :=
   ⟨fun α β [Frame α] [Frame β] => (coeFn : FrameHom α β → α → β), fun α [Frame α] => FrameHom.id α,
     fun α β γ [Frame α] [Frame β] [Frame γ] => FrameHom.comp, fun α β [Frame α] [Frame β] =>
     FunLike.coe_injective⟩
-#align Frame.bundled_hom Frame.bundledHom
+#align Frm.bundled_hom Frm.bundledHom
 
-deriving instance LargeCategory, ConcreteCategory for Frame
+deriving instance LargeCategory, ConcreteCategory for Frm
 
-instance hasForgetToLattice : HasForget₂ Frame LatticeCat
+instance hasForgetToLat : HasForget₂ Frm Lat
     where forget₂ :=
     { obj := fun X => ⟨X⟩
       map := fun X Y => FrameHom.toLatticeHom }
-#align Frame.has_forget_to_Lattice Frame.hasForgetToLattice
+#align Frm.has_forget_to_Lat Frm.hasForgetToLat
 
 /-- Constructs an isomorphism of frames from an order isomorphism between them. -/
 @[simps]
-def Iso.mk {α β : Frame.{u}} (e : α ≃o β) : α ≅ β
+def Iso.mk {α β : Frm.{u}} (e : α ≃o β) : α ≅ β
     where
   Hom := e
   inv := e.symm
@@ -86,15 +86,15 @@ def Iso.mk {α β : Frame.{u}} (e : α ≃o β) : α ≅ β
   inv_hom_id' := by
     ext
     exact e.apply_symm_apply _
-#align Frame.iso.mk Frame.Iso.mk
+#align Frm.iso.mk Frm.Iso.mk
 
-end Frame
+end Frm
 
-/-- The forgetful functor from `Topᵒᵖ` to `Frame`. -/
+/-- The forgetful functor from `Topᵒᵖ` to `Frm`. -/
 @[simps]
-def topOpToFrame : TopCatᵒᵖ ⥤ Frame
+def topOpToFrame : TopCatᵒᵖ ⥤ Frm
     where
-  obj X := Frame.of (Opens (unop X : TopCat))
+  obj X := Frm.of (Opens (unop X : TopCat))
   map X Y f := Opens.comap <| Quiver.Hom.unop f
   map_id' X := Opens.comap_id
 #align Top_op_to_Frame topOpToFrame

Changes in mathlib4

mathlib3

mathlib4

e8ac6315

chore(CategoryTheory): move Full, Faithful, EssSurj, IsEquivalence and ReflectsIsomorphisms to the Functor namespace (#11985)

These notions on functors are now Functor.Full, Functor.Faithful, Functor.EssSurj, Functor.IsEquivalence, Functor.ReflectsIsomorphisms. Deprecated aliases are introduced for the previous names.

65b7affc

Diff

@@ -103,6 +103,6 @@ def topCatOpToFrm : TopCatᵒᵖ ⥤ Frm where
 #align Top_op_to_Frame topCatOpToFrm
 
 -- Note, `CompHaus` is too strong. We only need `T0Space`.
-instance CompHausOpToFrame.faithful : Faithful (compHausToTop.op ⋙ topCatOpToFrm.{u}) :=
+instance CompHausOpToFrame.faithful : (compHausToTop.op ⋙ topCatOpToFrm.{u}).Faithful :=
   ⟨fun h => Quiver.Hom.unop_inj <| Opens.comap_injective h⟩
 #align CompHaus_op_to_Frame.faithful CompHausOpToFrame.faithful

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

@@ -62,7 +62,7 @@ instance bundledHom : BundledHom Hom where
   toFun {α β} _ _ := ((↑) : FrameHom α β → α → β)
   id {α} _ := FrameHom.id α
   comp _ _ _ := FrameHom.comp
-  hom_ext _ _ := FunLike.coe_injective
+  hom_ext _ _ := DFunLike.coe_injective
 #align Frm.bundled_hom Frm.bundledHom
 
 -- Porting note: Originally `deriving instance LargeCategory, ConcreteCategory for Frm`

e8ac6315

chore: Remove Cat suffixes (#3730)

These names needn't change in the first place.

40fe5127

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 Mathlib.Order.Category.LatCat
+import Mathlib.Order.Category.Lat
 import Mathlib.Order.Hom.CompleteLattice
 import Mathlib.Topology.Category.CompHaus.Basic
 import Mathlib.Topology.Sets.Opens
@@ -13,7 +13,7 @@ import Mathlib.Topology.Sets.Opens
 /-!
 # The category of frames
 
-This file defines `FrmCat`, the category of frames.
+This file defines `Frm`, the category of frames.
 
 ## References
 
@@ -28,60 +28,60 @@ open CategoryTheory Opposite Order TopologicalSpace
 set_option linter.uppercaseLean3 false -- `Frm`
 
 /-- The category of frames. -/
-def FrmCat :=
+def Frm :=
   Bundled Frame
-#align Frm FrmCat
+#align Frm Frm
 
-namespace FrmCat
+namespace Frm
 
-instance : CoeSort FrmCat (Type*) :=
+instance : CoeSort Frm (Type*) :=
   Bundled.coeSort
 
-instance (X : FrmCat) : Frame X :=
+instance (X : Frm) : Frame X :=
   X.str
 
-/-- Construct a bundled `FrmCat` from a `Frame`. -/
-def of (α : Type*) [Frame α] : FrmCat :=
+/-- Construct a bundled `Frm` from a `Frame`. -/
+def of (α : Type*) [Frame α] : Frm :=
   Bundled.of α
-#align Frm.of FrmCat.of
+#align Frm.of Frm.of
 
 @[simp]
 theorem coe_of (α : Type*) [Frame α] : ↥(of α) = α := rfl
-#align Frm.coe_of FrmCat.coe_of
+#align Frm.coe_of Frm.coe_of
 
-instance : Inhabited FrmCat :=
+instance : Inhabited Frm :=
   ⟨of PUnit⟩
 
 /-- An abbreviation of `FrameHom` that assumes `Frame` instead of the weaker `CompleteLattice`.
 Necessary for the category theory machinery. -/
 abbrev Hom (α β : Type*) [Frame α] [Frame β] : Type _ :=
   FrameHom α β
-#align Frm.hom FrmCat.Hom
+#align Frm.hom Frm.Hom
 
 instance bundledHom : BundledHom Hom where
   toFun {α β} _ _ := ((↑) : FrameHom α β → α → β)
   id {α} _ := FrameHom.id α
   comp _ _ _ := FrameHom.comp
   hom_ext _ _ := FunLike.coe_injective
-#align Frm.bundled_hom FrmCat.bundledHom
+#align Frm.bundled_hom Frm.bundledHom
 
--- Porting note: Originally `deriving instance LargeCategory, ConcreteCategory for FrmCat`
+-- Porting note: Originally `deriving instance LargeCategory, ConcreteCategory for Frm`
 -- see https://github.com/leanprover-community/mathlib4/issues/5020
-deriving instance LargeCategory, Category for FrmCat
+deriving instance LargeCategory, Category for Frm
 
-instance : ConcreteCategory FrmCat := by
-  unfold FrmCat
+instance : ConcreteCategory Frm := by
+  unfold Frm
   infer_instance
 
-instance hasForgetToLat : HasForget₂ FrmCat LatCat where
+instance hasForgetToLat : HasForget₂ Frm Lat where
   forget₂ :=
     { obj := fun X => ⟨X, _⟩
       map := fun {X Y} => FrameHom.toLatticeHom }
-#align Frm.has_forget_to_Lat FrmCat.hasForgetToLat
+#align Frm.has_forget_to_Lat Frm.hasForgetToLat
 
 /-- Constructs an isomorphism of frames from an order isomorphism between them. -/
 @[simps]
-def Iso.mk {α β : FrmCat.{u}} (e : α ≃o β) : α ≅ β where
+def Iso.mk {α β : Frm.{u}} (e : α ≃o β) : α ≅ β where
   hom := (e : FrameHom _ _)
   inv := (e.symm : FrameHom _ _)
   hom_inv_id := by
@@ -90,19 +90,19 @@ def Iso.mk {α β : FrmCat.{u}} (e : α ≃o β) : α ≅ β where
   inv_hom_id := by
     ext
     exact e.apply_symm_apply _
-#align Frm.iso.mk FrmCat.Iso.mk
+#align Frm.iso.mk Frm.Iso.mk
 
-end FrmCat
+end Frm
 
-/-- The forgetful functor from `TopCatᵒᵖ` to `FrmCat`. -/
+/-- The forgetful functor from `TopCatᵒᵖ` to `Frm`. -/
 @[simps]
-def topCatOpToFrameCat : TopCatᵒᵖ ⥤ FrmCat where
-  obj X := FrmCat.of (Opens (unop X : TopCat))
+def topCatOpToFrm : TopCatᵒᵖ ⥤ Frm where
+  obj X := Frm.of (Opens (unop X : TopCat))
   map f := Opens.comap <| Quiver.Hom.unop f
   map_id X := Opens.comap_id
-#align Top_op_to_Frame topCatOpToFrameCat
+#align Top_op_to_Frame topCatOpToFrm
 
 -- Note, `CompHaus` is too strong. We only need `T0Space`.
-instance CompHausOpToFrame.faithful : Faithful (compHausToTop.op ⋙ topCatOpToFrameCat.{u}) :=
+instance CompHausOpToFrame.faithful : Faithful (compHausToTop.op ⋙ topCatOpToFrm.{u}) :=
   ⟨fun h => Quiver.Hom.unop_inj <| Opens.comap_injective h⟩
 #align CompHaus_op_to_Frame.faithful CompHausOpToFrame.faithful

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

@@ -34,19 +34,19 @@ def FrmCat :=
 
 namespace FrmCat
 
-instance : CoeSort FrmCat (Type _) :=
+instance : CoeSort FrmCat (Type*) :=
   Bundled.coeSort
 
 instance (X : FrmCat) : Frame X :=
   X.str
 
 /-- Construct a bundled `FrmCat` from a `Frame`. -/
-def of (α : Type _) [Frame α] : FrmCat :=
+def of (α : Type*) [Frame α] : FrmCat :=
   Bundled.of α
 #align Frm.of FrmCat.of
 
 @[simp]
-theorem coe_of (α : Type _) [Frame α] : ↥(of α) = α := rfl
+theorem coe_of (α : Type*) [Frame α] : ↥(of α) = α := rfl
 #align Frm.coe_of FrmCat.coe_of
 
 instance : Inhabited FrmCat :=
@@ -54,7 +54,7 @@ instance : Inhabited FrmCat :=
 
 /-- An abbreviation of `FrameHom` that assumes `Frame` instead of the weaker `CompleteLattice`.
 Necessary for the category theory machinery. -/
-abbrev Hom (α β : Type _) [Frame α] [Frame β] : Type _ :=
+abbrev Hom (α β : Type*) [Frame α] [Frame β] : Type _ :=
   FrameHom α β
 #align Frm.hom FrmCat.Hom

e8ac6315

chore: tidy various files (#6274)

6b9326b4

Diff

@@ -52,7 +52,7 @@ theorem coe_of (α : Type _) [Frame α] : ↥(of α) = α := rfl
 instance : Inhabited FrmCat :=
   ⟨of PUnit⟩
 
-/-- An abbreviation of `FrameHom` that assumes `Frame` instead of the weaker `completeLattice`.
+/-- An abbreviation of `FrameHom` that assumes `Frame` instead of the weaker `CompleteLattice`.
 Necessary for the category theory machinery. -/
 abbrev Hom (α β : Type _) [Frame α] [Frame β] : Type _ :=
   FrameHom α β

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,17 +2,14 @@
 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.Frm
-! 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.LatCat
 import Mathlib.Order.Hom.CompleteLattice
 import Mathlib.Topology.Category.CompHaus.Basic
 import Mathlib.Topology.Sets.Opens
 
+#align_import order.category.Frm from "leanprover-community/mathlib"@"e8ac6315bcfcbaf2d19a046719c3b553206dac75"
+
 /-!
 # The category of frames

e8ac6315

feat: port Order.Category.HeytAlgCat (#5021)

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

fc5d0810

Diff

@@ -69,6 +69,7 @@ instance bundledHom : BundledHom Hom where
 #align Frm.bundled_hom FrmCat.bundledHom
 
 -- Porting note: Originally `deriving instance LargeCategory, ConcreteCategory for FrmCat`
+-- see https://github.com/leanprover-community/mathlib4/issues/5020
 deriving instance LargeCategory, Category for FrmCat
 
 instance : ConcreteCategory FrmCat := by

e8ac6315

feat: port Order.Category.FrmCat (#3970)

23a970bf

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

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 744

order.category.Frm ⟷ Mathlib.Order.Category.Frm

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 744

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