The category of frames

This file defines Frm, the category of frames.

References

• nLab, Frm

structure Frm : Type (u_1 + 1)

The category of frames.

• carrier : Type u_1

  The underlying frame.

• str : Order.Frame ↑self

instance Frm.instCoeSortType : CoeSort Frm (Type u_1)

Equations

• Frm.instCoeSortType = { coe := Frm.carrier }

@[reducible, inline]

abbrev Frm.of (X : Type u_1) [Order.Frame X] : Frm

Construct a bundled Frm from the underlying type and typeclass.

Equations

• Frm.of X = Frm.mk X

structure Frm.Hom (X Y : Frm) : Type u

The type of morphisms in Frm R.

• hom' : FrameHom ↑X ↑Y

  The underlying FrameHom.

theorem Frm.Hom.ext {X Y : Frm} {x y : X.Hom Y} (hom' : x.hom' = y.hom') : x = y

instance Frm.instCategory : CategoryTheory.Category.{u, u + 1} Frm

Equations

• Frm.instCategory = CategoryTheory.Category.mk @Frm.instCategory.proof_1 @Frm.instCategory.proof_2 @Frm.instCategory.proof_3

instance Frm.instConcreteCategoryFrameHomCarrier : CategoryTheory.ConcreteCategory Frm fun (x1 x2 : Frm) => FrameHom ↑x1 ↑x2

Equations

• One or more equations did not get rendered due to their size.

@[reducible, inline]

abbrev Frm.Hom.hom {X Y : Frm} (f : X.Hom Y) : FrameHom ↑X ↑Y

Turn a morphism in Frm back into a FrameHom.

Equations

• f.hom = CategoryTheory.ConcreteCategory.hom f

@[reducible, inline]

abbrev Frm.ofHom {X Y : Type u} [Order.Frame X] [Order.Frame Y] (f : FrameHom X Y) : of X ⟶ of Y

Typecheck a FrameHom as a morphism in Frm.

Equations

• Frm.ofHom f = CategoryTheory.ConcreteCategory.ofHom f

def Frm.Hom.Simps.hom (X Y : Frm) (f : X.Hom Y) : FrameHom ↑X ↑Y

Use the ConcreteCategory.hom projection for @[simps] lemmas.

Equations

• Frm.Hom.Simps.hom X Y f = f.hom

The results below duplicate the ConcreteCategory simp lemmas, but we can keep them for dsimp.

@[simp]

theorem Frm.coe_id {X : Frm} : ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.id X)) = id

@[simp]

theorem Frm.coe_comp {X Y Z : Frm} {f : X ⟶ Y} {g : Y ⟶ Z} : ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp f g)) = ⇑(CategoryTheory.ConcreteCategory.hom g) ∘ ⇑(CategoryTheory.ConcreteCategory.hom f)

@[simp]

theorem Frm.forget_map {X Y : Frm} (f : X ⟶ Y) : (CategoryTheory.forget Frm).map f = ⇑(CategoryTheory.ConcreteCategory.hom f)

theorem Frm.ext {X Y : Frm} {f g : X ⟶ Y} (w : ∀ (x : ↑X), (CategoryTheory.ConcreteCategory.hom f) x = (CategoryTheory.ConcreteCategory.hom g) x) : f = g

theorem Frm.coe_of (X : Type u) [Order.Frame X] : ↑(of X) = X

@[simp]

theorem Frm.hom_id {X : Frm} : Hom.hom (CategoryTheory.CategoryStruct.id X) = FrameHom.id ↑X

theorem Frm.id_apply (X : Frm) (x : ↑X) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.id X)) x = x

@[simp]

theorem Frm.hom_comp {X Y Z : Frm} (f : X ⟶ Y) (g : Y ⟶ Z) : Hom.hom (CategoryTheory.CategoryStruct.comp f g) = (Hom.hom g).comp (Hom.hom f)

theorem Frm.comp_apply {X Y Z : Frm} (f : X ⟶ Y) (g : Y ⟶ Z) (x : ↑X) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp f g)) x = (CategoryTheory.ConcreteCategory.hom g) ((CategoryTheory.ConcreteCategory.hom f) x)

theorem Frm.hom_ext {X Y : Frm} {f g : X ⟶ Y} (hf : Hom.hom f = Hom.hom g) : f = g

@[simp]

theorem Frm.hom_ofHom {X Y : Type u} [Order.Frame X] [Order.Frame Y] (f : FrameHom X Y) : Hom.hom (ofHom f) = f

@[simp]

theorem Frm.ofHom_hom {X Y : Frm} (f : X ⟶ Y) : ofHom (Hom.hom f) = f

@[simp]

theorem Frm.ofHom_id {X : Type u} [Order.Frame X] : ofHom (FrameHom.id X) = CategoryTheory.CategoryStruct.id (of X)

@[simp]

theorem Frm.ofHom_comp {X Y Z : Type u} [Order.Frame X] [Order.Frame Y] [Order.Frame Z] (f : FrameHom X Y) (g : FrameHom Y Z) : ofHom (g.comp f) = CategoryTheory.CategoryStruct.comp (ofHom f) (ofHom g)

theorem Frm.ofHom_apply {X Y : Type u} [Order.Frame X] [Order.Frame Y] (f : FrameHom X Y) (x : X) : (CategoryTheory.ConcreteCategory.hom (ofHom f)) x = f x

theorem Frm.inv_hom_apply {X Y : Frm} (e : X ≅ Y) (x : ↑X) : (CategoryTheory.ConcreteCategory.hom e.inv) ((CategoryTheory.ConcreteCategory.hom e.hom) x) = x

theorem Frm.hom_inv_apply {X Y : Frm} (e : X ≅ Y) (s : ↑Y) : (CategoryTheory.ConcreteCategory.hom e.hom) ((CategoryTheory.ConcreteCategory.hom e.inv) s) = s

instance Frm.instInhabited : Inhabited Frm

Equations

• Frm.instInhabited = { default := Frm.of PUnit.{?u.3 + 1} }

instance Frm.hasForgetToLat : CategoryTheory.HasForget₂ Frm Lat

Equations

• One or more equations did not get rendered due to their size.

def Frm.Iso.mk {α β : Frm} (e : ↑α ≃o ↑β) : α ≅ β

Constructs an isomorphism of frames from an order isomorphism between them.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem Frm.Iso.mk_inv {α β : Frm} (e : ↑α ≃o ↑β) : (mk e).inv = ofHom { toFun := ⇑e.symm, map_inf' := ⋯, map_top' := ⋯, map_sSup' := ⋯ }

@[simp]

theorem Frm.Iso.mk_hom {α β : Frm} (e : ↑α ≃o ↑β) : (mk e).hom = ofHom { toFun := ⇑e, map_inf' := ⋯, map_top' := ⋯, map_sSup' := ⋯ }