⚠ 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.Path where

  open import Agda.Primitive.Cubical using (PathP) public


  infix 4 _≡_

  -- We have a variable name in `(λ i → A)` as a hint for case
  -- splitting.
  _≡_ : ∀ {ℓ} {A : Set ℓ} → A → A → Set ℓ
  _≡_ {A = A} = PathP (λ i → A)

  {-# BUILTIN PATH         _≡_     #-}
Powered by Outcrop
© 2026 Bedrock Institute · content licensed CC BY-NC-SA 4.0 · Source · llms.txt