Skip to content

Simplify definitions/exports in Data.List.Relation.Unary.Unique.* #2480

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Sep 11, 2024
Merged

Simplify definitions/exports in Data.List.Relation.Unary.Unique.* #2480

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions src/Data/List/Relation/Unary/Unique/Propositional.agda
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,9 +9,9 @@
module Data.List.Relation.Unary.Unique.Propositional {a} {A : Set a} where

open import Relation.Binary.PropositionalEquality.Properties using (setoid)
open import Data.List.Relation.Unary.Unique.Setoid as SetoidUnique

------------------------------------------------------------------------
-- Re-export the contents of setoid uniqueness

open SetoidUnique (setoid A) public
open import Data.List.Relation.Unary.Unique.Setoid (setoid A) public

12 changes: 3 additions & 9 deletions src/Data/List/Relation/Unary/Unique/Setoid.agda
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,23 +6,17 @@

{-# OPTIONS --cubical-compatible --safe #-}

open import Relation.Binary.Core using (Rel)
open import Relation.Binary.Bundles using (Setoid)
open import Relation.Nullary.Negation using (¬_)

module Data.List.Relation.Unary.Unique.Setoid {a ℓ} (S : Setoid a ℓ) where

open Setoid S renaming (Carrier to A)
open Setoid S using (_≉_)

------------------------------------------------------------------------
-- Definition

private
Distinct : Rel A ℓ
Distinct x y = ¬ (x ≈ y)

open import Data.List.Relation.Unary.AllPairs.Core Distinct public
open import Data.List.Relation.Unary.AllPairs.Core _≉_ public
renaming (AllPairs to Unique)

open import Data.List.Relation.Unary.AllPairs {R = Distinct} public
open import Data.List.Relation.Unary.AllPairs {R = _≉_} public
using (head; tail)