Use long name for product object

src/Cat/Categories/Cat.agda

@@ -152,7 +152,7 @@ module _ {ℓ ℓ' : Level} (unprovable : IsCategory (RawCat ℓ ℓ')) where
       module P = CatProduct ℂ 𝔻
 
       rawProduct : RawProduct Catℓ ℂ 𝔻
-      RawProduct.obj   rawProduct = P.obj
+      RawProduct.object rawProduct = P.obj
       RawProduct.proj₁  rawProduct = P.proj₁
       RawProduct.proj₂  rawProduct = P.proj₂
 

src/Cat/Categories/Sets.agda

@@ -66,7 +66,7 @@ module _ {ℓ : Level} where
             proj₂ lem = refl
 
         rawProduct : RawProduct 𝓢 0A 0B
-        RawProduct.obj   rawProduct = 0A×0B
+        RawProduct.object rawProduct = 0A×0B
         RawProduct.proj₁  rawProduct = Data.Product.proj₁
         RawProduct.proj₂  rawProduct = Data.Product.proj₂
 

src/Cat/Category/Product.agda

@@ -1,3 +1,4 @@
+{-# OPTIONS --allow-unsolved-metas #-}
 module Cat.Category.Product where
 
 open import Agda.Primitive
@@ -14,9 +15,9 @@ module _ {ℓa ℓb : Level} (ℂ : Category ℓa ℓb) where
     record RawProduct : Set (ℓa ⊔ ℓb) where
       no-eta-equality
       field
-        obj : Object
+        object : Object
-        proj₁ : ℂ [ obj , A ]
+        proj₁  : ℂ [ object , A ]
-        proj₂ : ℂ [ obj , B ]
+        proj₂  : ℂ [ object , B ]
 
     -- FIXME Not sure this is actually a proposition - so this name is
     -- misleading.
@@ -28,7 +29,7 @@ module _ {ℓa ℓb : Level} (ℂ : Category ℓa ℓb) where
 
       -- | Arrow product
       _P[_×_] : ∀ {X} → (π₁ : ℂ [ X , A ]) (π₂ : ℂ [ X , B ])
-        → ℂ [ X , obj ]
+        → ℂ [ X , object ]
       _P[_×_] π₁ π₂ = P.proj₁ (isProduct π₁ π₂)
 
     record Product : Set (ℓa ⊔ ℓb) where
@@ -43,7 +44,7 @@ module _ {ℓa ℓb : Level} (ℂ : Category ℓa ℓb) where
       product : ∀ (A B : Object) → Product A B
 
     _×_ : Object → Object → Object
-    A × B = Product.obj (product A B)
+    A × B = Product.object (product A B)
 
     -- | Parallel product of arrows
     --