{-# OPTIONS --safe --cubical-compatible --guardedness --exact-split --double-check #-}
module SecondPass.FinCatInfinity where
open import Agda.Primitive using (lzero)
open import Agda.Builtin.Equality using (_≡_; refl)
open import Level using (Lift; lift)
open import Data.Unit.Polymorphic.Base using (⊤; tt)
open import Data.Nat using (ℕ)
open import Data.Fin.Base using (Fin; toℕ)
open import Categories.Category.Core using (Category)
open import Categories.Category.Indiscrete using (Indiscrete)
open import Categories.Functor.Core using (Functor)
open import Cosmos.ContCategory using (ContCat)
open import SecondPass.StrictLift using (StrictLayer)
open import SecondPass.CumulativeHierarchyLimit using (LayerIdx; Tower)
open import Cosmos.Carried.LimitSystem public
using (n-at; natToFin; toℕ-natToFin; embFin; toℕ-embFin)
open import Cosmos.Carried.SeqColimit public using (shift)
open import Cosmos.Carried.FinColimit public
using (FinCone; colimitUniv)
FinCat∞ : Category lzero lzero lzero
FinCat∞ = Indiscrete ℕ
TrivialFC∞ : Functor FinCat∞ (ContCat lzero lzero)
TrivialFC∞ = record
{ F₀ = λ _ → record
{ Shape = Lift lzero (⊤ {lzero})
; Position = λ _ → Lift lzero (⊤ {lzero})
}
; F₁ = λ _ → record
{ shape = λ _ → lift tt
; position = λ _ → lift tt
}
; identity = record
{ shape-eq = λ { (lift tt) → refl }
; position-eq = λ _ _ → refl
}
; homomorphism = record
{ shape-eq = λ _ → refl
; position-eq = λ _ _ → refl
}
; F-resp-≈ = λ _ → record
{ shape-eq = λ _ → refl
; position-eq = λ _ _ → refl
}
}
∞Layer : StrictLayer lzero lzero lzero lzero lzero
∞Layer = record { C = FinCat∞ ; FC = TrivialFC∞ }
∞Idx : LayerIdx
∞Idx = record { o = lzero ; h = lzero ; e = lzero ; s = lzero ; p = lzero }
∞Tower : Tower ∞Idx
∞Tower = record { layer₀ = ∞Layer }
ColimitCone : Set → Set
ColimitCone = FinCone
inject₁^d : ∀ d {m} → Fin (n-at m) → Fin (n-at (shift d m))
inject₁^d d {m} x = embFin d m x
toℕ-inject₁^d : ∀ d {m} (x : Fin (n-at m))
→ toℕ (inject₁^d d {m} x) ≡ toℕ x
toℕ-inject₁^d d {m} x = toℕ-embFin d m x