------------------------------------------------------------------------
-- The Agda standard library
--
-- Decidable setoid membership over lists
------------------------------------------------------------------------
{-# OPTIONS --cubical-compatible --safe #-}
open import Relation.Binary.Bundles using (DecSetoid)
module Data.List.Membership.DecSetoid {a ℓ} (DS : DecSetoid a ℓ) where
open import Data.List.Relation.Unary.Any using (any?)
open import Relation.Binary.Definitions using (Decidable)
open import Relation.Nullary.Decidable using (¬?)
open DecSetoid DS
------------------------------------------------------------------------
-- Re-export contents of propositional membership
open import Data.List.Membership.Setoid (DecSetoid.setoid DS) public
------------------------------------------------------------------------
-- Other operations
infix 4 _∈?_ _∉?_
_∈?_ : Decidable _∈_
x ∈? xs = any? (x ≟_) xs
_∉?_ : Decidable _∉_
x ∉? xs = ¬? (x ∈? xs)
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4