Other Agda modules in this section (9)
Complete compiler-highlighted source. Follow a symbol to its declaration.
Corresponding book passages
# The coproduct axiom The restriction functor is constructed from the two inclusions using the precomposition functors already defined in Section 1.4. Only the equivalence of this particular functor is assumed (`post:Coproduct_Of_Categories`). ```agda {-# OPTIONS --safe --without-K #-} open import Agda.Primitive using (Level) renaming (_β_ to _ββ_) open import SCT.VolumeI.Chapter01.Theory using (Theory) import SCT.VolumeI.Chapter01.Section04.MappingAnimae as Mapping import SCT.VolumeI.Chapter01.Section05.Setup as Setup module SCT.VolumeI.Chapter01.Section05.Coproducts {c m a : Level} (π― : Theory c m a) (M : Mapping.MappingAnimae π―) where open Setup π― M record CoproductData : Set (c ββ m ββ a) where infixr 5 _β_ field _β_ : CAT β CAT β CAT inβ : {C D : CAT} β MAP C (C β D) inβ : {C D : CAT} β MAP D (C β D) coproductRestriction : (C D E : CAT) β MAP (Map (C β D) E) (Map C E Γ Map D E) coproductRestriction C D E = pair (mapPre inβ) (mapPre inβ) record CoproductLaws (B : CoproductData) : Set (c ββ m) where open CoproductData B field coproductRestriction-isEquiv : (C D E : CAT) β IsEquiv (coproductRestriction C D E) record CoproductStructure : Set (c ββ m ββ a) where field dataCoproduct : CoproductData lawsCoproduct : CoproductLaws dataCoproduct open CoproductData dataCoproduct public open CoproductLaws lawsCoproduct public ```