Pointed dependent pair types
Content created by Fredrik Bakke.
Created on 2023-04-28.
Last modified on 2023-05-03.
module structured-types.pointed-dependent-pair-types where
Imports
open import foundation.dependent-pair-types open import foundation.universe-levels open import structured-types.pointed-families-of-types open import structured-types.pointed-types
Idea
Given a pointed type (A , a)
and a pointed family over it (B , b)
, then the
dependent pair type Σ A B
is again canonically pointed at (a , b)
.
Definition
module _ {l1 l2 : Level} where Σ-Pointed-Type : (A : Pointed-Type l1) (B : Pointed-Fam l2 A) → Pointed-Type (l1 ⊔ l2) pr1 (Σ-Pointed-Type (A , a) (B , b)) = Σ A B pr2 (Σ-Pointed-Type (A , a) (B , b)) = a , b Σ∗ = Σ-Pointed-Type
Note: the subscript asterisk symbol used for the pointed dependent pair type
Σ∗
, and pointed type constructions in general, is the
asterisk operator ∗
(agda-input: \ast
), not
the asterisk *
.
Recent changes
- 2023-05-03. Fredrik Bakke. Define the smash product of pointed types and refactor pointed types (#583).
- 2023-04-28. Fredrik Bakke. Miscellaneous refactoring and small additions (#579).