⚠ You are viewing the Agda library. Back to Bedrock
Bedrock
English · 中文 · 日本語
On this page
Menu
Interactive contents
  • Origin
  • Reading routes
  • Dependency graph
  • Glossary
Current route:Common foundations
  • Prelude
  • Impredicativity
  • The classical boundary
  • Choice
  • The object language
  • Structures
  • Semantics
  • The Lévy hierarchy
  • Absoluteness
  • Models of ZF and ZFC
  • Syntax as sets
{-# OPTIONS --erased-cubical --safe --no-sized-types --no-guardedness #-}

module Agda.Builtin.Cubical.Sub where

  open import Agda.Primitive.Cubical

  {-# BUILTIN SUB Sub #-}

  postulate
    inS : ∀ {ℓ} {A : Set ℓ} {φ} (x : A) → Sub A φ (λ _ → x)

  {-# BUILTIN SUBIN inS #-}

  -- Sub A φ u is treated as A.
  {-# COMPILE JS inS = _ => _ => _ => x => x #-}

  primitive
    primSubOut : ∀ {ℓ} {A : Set ℓ} {φ : I} {u : Partial φ A} → Sub _ φ u → A
Powered by Outcrop
© 2026 Bedrock Institute · content licensed CC BY-NC-SA 4.0 · Source · llms.txt