mirror of
https://github.com/Smaug123/agdaproofs
synced 2025-10-18 01:38:45 +00:00
17 lines
525 B
Agda
17 lines
525 B
Agda
{-# OPTIONS --safe --warning=error --without-K #-}
|
|
|
|
open import LogicalFormulae
|
|
open import Decidable.Relations
|
|
open import Boolean.Definition
|
|
|
|
module Decidable.Reduction where
|
|
|
|
squash : {a b : _} {A : Set a} {f : A → Set b} → DecidableRelation f → A → Bool
|
|
squash rel a with rel a
|
|
... | inl x = BoolTrue
|
|
... | inr x = BoolFalse
|
|
|
|
unsquash : {a b : _} {A : Set a} {f : A → Set b} → (rel : DecidableRelation f) → {x : A} → .(squash rel x ≡ BoolTrue) → f x
|
|
unsquash rel {x} pr with rel x
|
|
... | inl ans = ans
|