Final Relation.Binary simplifications (#2068)

Author: Saransh-cpp

src/Codata/Sized/Conat/Properties.agda

@@ -16,7 +16,7 @@ open import Codata.Sized.Conat.Bisimilarity
 open import Function.Base using (_∋_)
 open import Relation.Nullary
 open import Relation.Nullary.Decidable using (map′)
-open import Relation.Binary
+open import Relation.Binary.Definitions using (Decidable)
 
 private
   variable

src/Data/AVL/Indexed/WithK.agda

@@ -6,7 +6,8 @@
 
 {-# OPTIONS --with-K --safe #-}
 
-open import Relation.Binary
+open import Relation.Binary.Core using (Rel)
+open import Relation.Binary.Structures using (IsStrictTotalOrder)
 open import Relation.Binary.PropositionalEquality.Core using (_≡_; refl; subst)
 
 module Data.AVL.Indexed.WithK

src/Data/AVL/IndexedMap.agda

@@ -7,7 +7,8 @@
 {-# OPTIONS --cubical-compatible --safe #-}
 
 open import Data.Product.Base using (∃)
-open import Relation.Binary
+open import Relation.Binary.Core using (Rel)
+open import Relation.Binary.Structures using (IsStrictTotalOrder)
 open import Relation.Binary.PropositionalEquality.Core using (_≡_; cong; subst)
 import Data.Tree.AVL.Value
 

src/Data/AVL/Key.agda

@@ -6,7 +6,7 @@
 
 {-# OPTIONS --cubical-compatible --safe #-}
 
-open import Relation.Binary
+open import Relation.Binary.Bundles using (StrictTotalOrder)
 
 module Data.AVL.Key
   {a ℓ₁ ℓ₂} (strictTotalOrder : StrictTotalOrder a ℓ₁ ℓ₂)

src/Data/Bool.agda

@@ -9,7 +9,6 @@
 module Data.Bool where
 
 open import Relation.Nullary
-open import Relation.Binary
 open import Relation.Binary.PropositionalEquality.Core using (_≡_; refl)
 
 ------------------------------------------------------------------------

src/Data/Char/Properties.agda

@@ -17,7 +17,13 @@ open import Data.Product.Base using (_,_)
 open import Function.Base
 open import Relation.Nullary using (¬_; yes; no)
 open import Relation.Nullary.Decidable using (map′; isYes)
-open import Relation.Binary
+open import Relation.Binary.Core using (_⇒_)
+open import Relation.Binary.Bundles
+  using (Setoid; DecSetoid; StrictPartialOrder; StrictTotalOrder; Preorder; Poset; DecPoset)
+open import Relation.Binary.Structures
+  using (IsDecEquivalence; IsStrictPartialOrder; IsStrictTotalOrder; IsPreorder; IsPartialOrder; IsDecPartialOrder; IsEquivalence)
+open import Relation.Binary.Definitions
+  using (Decidable; Trichotomous; Irreflexive; Transitive; Asymmetric; Antisymmetric; Symmetric; Substitutive; Reflexive; tri<; tri≈; tri>)
 import Relation.Binary.Construct.On as On
 import Relation.Binary.Construct.Subst.Equality as Subst
 import Relation.Binary.Construct.Closure.Reflexive as Refl

src/Data/Container/Properties.agda

@@ -9,7 +9,7 @@
 module Data.Container.Properties where
 
 import Function.Base as F
-open import Relation.Binary
+open import Relation.Binary.Bundles using (Setoid)
 
 open import Data.Container.Core
 open import Data.Container.Relation.Binary.Equality.Setoid

src/Data/Container/Related.agda

@@ -12,7 +12,7 @@ module Data.Container.Related where
 open import Level using (_⊔_)
 open import Data.Container.Core
 import Function.Related as Related
-open import Relation.Binary
+open import Relation.Binary.Bundles using (Preorder; Setoid)
 open import Data.Container.Membership
 
 open Related public

src/Data/Container/Relation/Binary/Equality/Setoid.agda

@@ -11,7 +11,10 @@ open import Relation.Binary.Bundles using (Setoid)
 module Data.Container.Relation.Binary.Equality.Setoid {c e} (S : Setoid c e) where
 
 open import Level using (_⊔_; suc)
-open import Relation.Binary
+open import Relation.Binary.Core using (Rel)
+open import Relation.Binary.Structures using (IsEquivalence)
+open import Relation.Binary.Definitions
+  using (Reflexive; Symmetric; Transitive)
 
 open import Data.Container.Core
 open import Data.Container.Relation.Binary.Pointwise

src/Data/Container/Relation/Binary/Pointwise/Properties.agda

@@ -13,7 +13,10 @@ open import Data.Container.Core
 open import Data.Container.Relation.Binary.Pointwise
 open import Data.Product.Base using (_,_; Σ-syntax; -,_)
 open import Level using (_⊔_)
-open import Relation.Binary
+open import Relation.Binary.Core using (Rel)
+open import Relation.Binary.Definitions
+  using (Reflexive; Symmetric; Transitive)
+open import Relation.Binary.Core using (Rel)
 open import Relation.Binary.PropositionalEquality.Core as P
   using (_≡_; subst; cong)