Skip to content

Commit 8d1c51c

Browse files
Saransh-cppMatthewDaggitt
Saransh-cpp
authored and
MatthewDaggitt
committed
More simplifications for Relation.Binary imports (#2038)
1 parent d28d0f6 commit 8d1c51c

File tree

78 files changed

+131
-99
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

78 files changed

+131
-99
lines changed

‎README/Nary.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,7 @@ open import Data.Product.Base using (_×_; _,_)
1919
open import Data.Sum.Base using (inj₁; inj₂)
2020
open import Function.Base using (id; flip; _∘′_)
2121
open import Relation.Nullary
22-
open import Relation.Binary using (module Tri); open Tri
22+
open import Relation.Binary.Definitions using (module Tri); open Tri
2323
open import Relation.Binary.PropositionalEquality
2424

2525
private

‎src/Data/AVL.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66

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

9-
open import Relation.Binary using (StrictTotalOrder)
9+
open import Relation.Binary.Bundles using (StrictTotalOrder)
1010

1111
module Data.AVL
1212
{a ℓ₁ ℓ₂} (strictTotalOrder : StrictTotalOrder a ℓ₁ ℓ₂)

‎src/Data/AVL/Indexed.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66

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

9-
open import Relation.Binary using (StrictTotalOrder)
9+
open import Relation.Binary.Bundles using (StrictTotalOrder)
1010

1111
module Data.AVL.Indexed
1212
{a ℓ₁ ℓ₂} (strictTotalOrder : StrictTotalOrder a ℓ₁ ℓ₂) where

‎src/Data/AVL/NonEmpty/Propositional.agda

+3-1
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,9 @@
66

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

9-
open import Relation.Binary using (Rel; IsStrictTotalOrder; StrictTotalOrder)
9+
open import Relation.Binary.Core using (Rel)
10+
open import Relation.Binary.Structures using (IsStrictTotalOrder)
11+
open import Relation.Binary.Bundles using (StrictTotalOrder)
1012
open import Relation.Binary.PropositionalEquality using (_≡_; refl; subst)
1113

1214
module Data.AVL.NonEmpty.Propositional

‎src/Data/List/Extrema.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66

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

9-
open import Relation.Binary using (TotalOrder; Setoid)
9+
open import Relation.Binary.Bundles using (TotalOrder; Setoid)
1010

1111
module Data.List.Extrema
1212
{b ℓ₁ ℓ₂} (totalOrder : TotalOrder b ℓ₁ ℓ₂) where

‎src/Data/List/Fresh/Properties.agda

+2-1
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,8 @@ open import Level using (Level; _⊔_; Lift)
1212
open import Data.Product.Base using (_,_)
1313
open import Relation.Nullary
1414
open import Relation.Unary as U using (Pred)
15-
open import Relation.Binary as B using (Rel)
15+
import Relation.Binary.Definitions as B
16+
open import Relation.Binary.Core using (Rel)
1617

1718
open import Data.List.Fresh
1819

‎src/Data/List/Membership/DecPropositional.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66

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

9-
open import Relation.Binary using (Decidable)
9+
open import Relation.Binary.Definitions using (Decidable)
1010
open import Relation.Binary.PropositionalEquality using (_≡_)
1111
open import Relation.Binary.PropositionalEquality.Properties using (decSetoid)
1212

‎src/Data/List/Membership/DecSetoid.agda

+2-1
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,8 @@
66

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

9-
open import Relation.Binary using (Decidable; DecSetoid)
9+
open import Relation.Binary.Definitions using (Decidable)
10+
open import Relation.Binary.Bundles using (DecSetoid)
1011
open import Relation.Nullary.Decidable using (¬?)
1112

1213
module Data.List.Membership.DecSetoid {a ℓ} (DS : DecSetoid a ℓ) where

‎src/Data/List/Properties.agda

+2-2
Original file line numberDiff line numberDiff line change
@@ -34,10 +34,10 @@ open import Data.Fin.Properties using (toℕ-cast)
3434
open import Function.Base using (id; _∘_; _∘′_; _∋_; _-⟨_∣; ∣_⟩-_; _$_; const; flip)
3535
open import Function.Definitions using (Injective)
3636
open import Level using (Level)
37-
open import Relation.Binary as B using (DecidableEquality)
37+
open import Relation.Binary.Definitions as B using (DecidableEquality)
3838
import Relation.Binary.Reasoning.Setoid as EqR
3939
open import Relation.Binary.PropositionalEquality as P hiding ([_])
40-
open import Relation.Binary as B using (Rel)
40+
open import Relation.Binary.Core using (Rel)
4141
open import Relation.Nullary.Reflects using (invert)
4242
open import Relation.Nullary using (¬_; Dec; does; _because_; yes; no; contradiction)
4343
open import Relation.Nullary.Decidable as Decidable using (isYes; map′; ⌊_⌋; ¬?; _×-dec_)

‎src/Data/List/Relation/Binary/Equality/DecSetoid.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,7 @@ module Data.List.Relation.Binary.Equality.DecSetoid
1414
import Data.List.Relation.Binary.Equality.Setoid as SetoidEquality
1515
import Data.List.Relation.Binary.Pointwise as PW
1616
open import Level
17-
open import Relation.Binary using (Decidable)
17+
open import Relation.Binary.Definitions using (Decidable)
1818
open DecSetoid DS
1919

2020
------------------------------------------------------------------------

‎src/Data/List/Relation/Binary/Equality/Setoid.agda

+4-2
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,9 @@
77
{-# OPTIONS --cubical-compatible --safe #-}
88

99
open import Algebra.Core using (Op₂)
10-
open import Relation.Binary using (Setoid)
10+
open import Relation.Binary.Bundles using (Setoid)
11+
open import Relation.Binary.Definitions using (Transitive; Symmetric; Reflexive; _Respects_)
12+
open import Relation.Binary.Structures using (IsEquivalence)
1113

1214
module Data.List.Relation.Binary.Equality.Setoid {a ℓ} (S : Setoid a ℓ) where
1315

@@ -17,7 +19,7 @@ open import Data.List.Relation.Binary.Pointwise as PW using (Pointwise)
1719
open import Data.List.Relation.Unary.Unique.Setoid S using (Unique)
1820
open import Function.Base using (_∘_)
1921
open import Level
20-
open import Relation.Binary renaming (Rel to Rel₂)
22+
open import Relation.Binary.Core renaming (Rel to Rel₂)
2123
open import Relation.Binary.PropositionalEquality as P using (_≡_)
2224
open import Relation.Binary.Properties.Setoid S using (≉-resp₂)
2325
open import Relation.Unary as U using (Pred)

‎src/Data/List/Relation/Binary/Infix/Heterogeneous.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@
99
module Data.List.Relation.Binary.Infix.Heterogeneous where
1010

1111
open import Level
12-
open import Relation.Binary using (REL; _⇒_)
12+
open import Relation.Binary.Core using (REL; _⇒_)
1313
open import Data.List.Base as List using (List; []; _∷_; _++_)
1414
open import Data.List.Relation.Binary.Pointwise
1515
using (Pointwise)

‎src/Data/List/Relation/Binary/Infix/Heterogeneous/Properties.agda

+2-1
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,8 @@ open import Function.Base using (case_of_; _$′_)
2020
open import Relation.Nullary.Decidable using (yes; no; does; map′; _⊎-dec_)
2121
open import Relation.Nullary.Negation using (¬_; contradiction)
2222
open import Relation.Unary as U using (Pred)
23-
open import Relation.Binary using (REL; _⇒_; Decidable; Trans; Antisym)
23+
open import Relation.Binary.Core using (REL; _⇒_)
24+
open import Relation.Binary.Definitions using (Decidable; Trans; Antisym)
2425
open import Relation.Binary.PropositionalEquality.Core using (_≢_; refl; cong)
2526
open import Data.List.Relation.Binary.Pointwise.Base as Pointwise using (Pointwise)
2627
open import Data.List.Relation.Binary.Infix.Heterogeneous

‎src/Data/List/Relation/Binary/Pointwise.agda

+4-1
Original file line numberDiff line numberDiff line change
@@ -25,7 +25,10 @@ open import Level
2525
open import Relation.Nullary hiding (Irrelevant)
2626
import Relation.Nullary.Decidable as Dec using (map′)
2727
open import Relation.Unary as U using (Pred)
28-
open import Relation.Binary renaming (Rel to Rel₂)
28+
open import Relation.Binary.Core renaming (Rel to Rel₂)
29+
open import Relation.Binary.Definitions using (_Respects_; _Respects₂_)
30+
open import Relation.Binary.Bundles using (Setoid; DecSetoid; Preorder; Poset)
31+
open import Relation.Binary.Structures using (IsEquivalence; IsDecEquivalence; IsPartialOrder; IsPreorder)
2932
open import Relation.Binary.PropositionalEquality.Core as P using (_≡_)
3033
import Relation.Binary.PropositionalEquality.Properties as P
3134

‎src/Data/List/Relation/Binary/Sublist/Propositional/Properties.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -22,7 +22,7 @@ import Data.List.Relation.Binary.Sublist.Setoid.Properties
2222
open import Data.Product using (∃; _,_; proj₂)
2323
open import Function.Base
2424
open import Level using (Level)
25-
open import Relation.Binary using (_Respects_)
25+
open import Relation.Binary.Definitions using (_Respects_)
2626
open import Relation.Binary.PropositionalEquality
2727
open import Relation.Unary using (Pred)
2828

‎src/Data/List/Relation/Binary/Sublist/Setoid/Properties.agda

+3-2
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,8 @@
66

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

9-
open import Relation.Binary using (Rel; Setoid; _⇒_; _Preserves_⟶_)
9+
open import Relation.Binary.Core using (Rel; _⇒_; _Preserves_⟶_)
10+
open import Relation.Binary.Bundles using (Setoid)
1011

1112
module Data.List.Relation.Binary.Sublist.Setoid.Properties
1213
{c ℓ} (S : Setoid c ℓ) where
@@ -20,7 +21,7 @@ open import Data.Product using (∃; _,_; proj₂)
2021
open import Function.Base
2122
open import Function.Bundles using (_⇔_; _⤖_)
2223
open import Level
23-
open import Relation.Binary using () renaming (Decidable to Decidable₂)
24+
open import Relation.Binary.Definitions using () renaming (Decidable to Decidable₂)
2425
open import Relation.Binary.PropositionalEquality.Core using (_≡_; refl; cong)
2526
open import Relation.Binary.Structures using (IsDecTotalOrder)
2627
open import Relation.Unary using (Pred; Decidable; Irrelevant)

‎src/Data/List/Relation/Binary/Suffix/Heterogeneous.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@
99
module Data.List.Relation.Binary.Suffix.Heterogeneous where
1010

1111
open import Level
12-
open import Relation.Binary using (REL; _⇒_)
12+
open import Relation.Binary.Core using (REL; _⇒_)
1313
open import Data.List.Base as List using (List; []; _∷_)
1414
open import Data.List.Relation.Binary.Pointwise.Base as Pointwise
1515
using (Pointwise; []; _∷_)

‎src/Data/List/Relation/Unary/AllPairs/Core.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@
1212

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

15-
open import Relation.Binary using (Rel)
15+
open import Relation.Binary.Core using (Rel)
1616

1717
module Data.List.Relation.Unary.AllPairs.Core
1818
{a ℓ} {A : Set a} (R : Rel A ℓ) where

‎src/Data/List/Relation/Unary/AllPairs/Properties.agda

+2-1
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,8 @@ open import Data.Nat.Base using (zero; suc; _<_; z≤n; s≤s)
1919
open import Data.Nat.Properties using (≤-refl; m<n⇒m<1+n)
2020
open import Function.Base using (_∘_; flip)
2121
open import Level using (Level)
22-
open import Relation.Binary using (Rel; DecSetoid)
22+
open import Relation.Binary.Core using (Rel)
23+
open import Relation.Binary.Bundles using (DecSetoid)
2324
open import Relation.Binary.PropositionalEquality.Core using (_≢_)
2425
open import Relation.Unary using (Pred; Decidable)
2526
open import Relation.Nullary.Decidable using (does)

‎src/Data/List/Relation/Unary/Grouped/Properties.agda

+2-1
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,8 @@ open import Data.List.Relation.Unary.AllPairs as AllPairs using (AllPairs; []; _
1616
open import Data.List.Relation.Unary.Grouped
1717
open import Function.Base using (_∘_)
1818
open import Function.Bundles using (module Equivalence; _⇔_)
19-
open import Relation.Binary as B using (REL; Rel)
19+
open import Relation.Binary.Definitions as B
20+
open import Relation.Binary.Core using (REL; Rel)
2021
open import Relation.Unary as U using (Pred)
2122
open import Relation.Nullary using (¬_; does; yes; no)
2223
open import Relation.Nullary.Negation using (contradiction)

‎src/Data/List/Relation/Unary/Linked.agda

+2-1
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,8 @@ open import Data.Maybe.Relation.Binary.Connected
1616
using (Connected; just; just-nothing)
1717
open import Function.Base using (id; _∘_)
1818
open import Level using (Level; _⊔_)
19-
open import Relation.Binary as B using (Rel; _⇒_)
19+
open import Relation.Binary.Definitions as B
20+
open import Relation.Binary.Core using (Rel; _⇒_)
2021
open import Relation.Binary.Construct.Intersection renaming (_∩_ to _∩ᵇ_)
2122
open import Relation.Binary.PropositionalEquality
2223
open import Relation.Unary as U renaming (_∩_ to _∩ᵘ_) hiding (_⇒_)

‎src/Data/List/Sort.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@
1010
{-# OPTIONS --cubical-compatible --safe #-}
1111

1212
open import Data.List.Base using (List)
13-
open import Relation.Binary using (DecTotalOrder)
13+
open import Relation.Binary.Bundles using (DecTotalOrder)
1414

1515
module Data.List.Sort
1616
{a ℓ₁ ℓ₂} (O : DecTotalOrder a ℓ₁ ℓ₂)

‎src/Data/List/Sort/Base.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@
99
open import Data.List.Base using (List)
1010
open import Data.List.Relation.Binary.Permutation.Propositional
1111
open import Level using (_⊔_)
12-
open import Relation.Binary using (TotalOrder)
12+
open import Relation.Binary.Bundles using (TotalOrder)
1313

1414
module Data.List.Sort.Base
1515
{a ℓ₁ ℓ₂} (totalOrder : TotalOrder a ℓ₁ ℓ₂)

‎src/Data/List/Sort/MergeSort.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -26,7 +26,7 @@ open import Data.Nat.Induction
2626
open import Data.Nat.Properties using (m<n⇒m<1+n)
2727
open import Data.Product.Base as Prod using (_,_)
2828
open import Function.Base using (_∘_)
29-
open import Relation.Binary using (DecTotalOrder)
29+
open import Relation.Binary.Bundles using (DecTotalOrder)
3030
open import Relation.Nullary.Negation using (¬_)
3131

3232
module Data.List.Sort.MergeSort

‎src/Data/Maybe/Properties.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -17,7 +17,7 @@ open import Data.Product.Base using (_,_)
1717
open import Function.Base using (_∋_; id; _∘_; _∘′_)
1818
open import Function.Definitions using (Injective)
1919
open import Level using (Level)
20-
open import Relation.Binary using (Decidable)
20+
open import Relation.Binary.Definitions using (Decidable)
2121
open import Relation.Binary.PropositionalEquality
2222
open import Relation.Nullary.Decidable using (yes; no)
2323
open import Relation.Nullary.Decidable using (map′)

‎src/Data/Nat/Divisibility/Core.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,7 @@ open import Data.Nat.Base using (ℕ; _*_)
1616
open import Data.Nat.Properties
1717
open import Level using (0ℓ)
1818
open import Relation.Nullary.Negation using (¬_)
19-
open import Relation.Binary using (Rel)
19+
open import Relation.Binary.Core using (Rel)
2020
open import Relation.Binary.PropositionalEquality
2121
using (_≡_; refl; sym; cong₂; module ≡-Reasoning)
2222

‎src/Data/Product/Effectful/Examples.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -18,7 +18,7 @@ open import Data.Product
1818
open import Data.Product.Relation.Binary.Pointwise.NonDependent
1919
open import Function.Base using (id)
2020
import Function.Identity.Effectful as Id
21-
open import Relation.Binary using (Rel)
21+
open import Relation.Binary.Core using (Rel)
2222
open import Relation.Binary.PropositionalEquality.Core using (_≡_; refl)
2323

2424
------------------------------------------------------------------------

‎src/Data/Product/Properties.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,7 @@ open import Data.Product.Base
1313
open import Function.Base using (_∋_; _∘_; id)
1414
open import Function.Bundles using (_↔_; mk↔′)
1515
open import Level using (Level)
16-
open import Relation.Binary using (DecidableEquality)
16+
open import Relation.Binary.Definitions using (DecidableEquality)
1717
open import Relation.Binary.PropositionalEquality
1818
open import Relation.Nullary.Decidable as Dec using (Dec; yes; no)
1919

‎src/Data/Product/Relation/Binary/Pointwise/Dependent/WithK.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,7 @@ open import Data.Product
1313
open import Data.Product.Relation.Binary.Pointwise.Dependent
1414
open import Function.Base
1515
open import Function.Inverse using (Inverse)
16-
open import Relation.Binary using (_⇒_)
16+
open import Relation.Binary.Core using (_⇒_)
1717
open import Relation.Binary.HeterogeneousEquality as H using (_≅_)
1818
open import Relation.Binary.Indexed.Heterogeneous using (IndexedSetoid)
1919
open import Relation.Binary.PropositionalEquality.Core as P using (_≡_)

‎src/Data/Sum/Properties.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ open import Level
1212
open import Data.Sum.Base
1313
open import Function.Base using (_∋_; _∘_; id)
1414
open import Function.Bundles using (mk↔′; _↔_)
15-
open import Relation.Binary using (Decidable)
15+
open import Relation.Binary.Definitions using (Decidable)
1616
open import Relation.Binary.PropositionalEquality
1717
open import Relation.Nullary.Decidable using (yes; no)
1818
open import Relation.Nullary.Decidable using (map′)

‎src/Data/These/Properties.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@ module Data.These.Properties where
1111
open import Data.Product
1212
open import Data.These.Base
1313
open import Function.Base using (_∘_)
14-
open import Relation.Binary using (Decidable)
14+
open import Relation.Binary.Definitions using (Decidable)
1515
open import Relation.Binary.PropositionalEquality
1616
open import Relation.Nullary.Decidable using (yes; no; map′; _×-dec_)
1717

‎src/Data/Tree/AVL/Indexed.agda

+2-2
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66

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

9-
open import Relation.Binary using (StrictTotalOrder)
9+
open import Relation.Binary.Bundles using (StrictTotalOrder)
1010

1111
module Data.Tree.AVL.Indexed
1212
{a ℓ₁ ℓ₂} (strictTotalOrder : StrictTotalOrder a ℓ₁ ℓ₂) where
@@ -19,7 +19,7 @@ open import Data.List.Base as List using (List)
1919
open import Data.DifferenceList using (DiffList; []; _∷_; _++_)
2020
open import Function.Base as F hiding (const)
2121
open import Relation.Unary
22-
open import Relation.Binary using (_Respects_; Tri; tri<; tri≈; tri>)
22+
open import Relation.Binary.Definitions using (_Respects_; Tri; tri<; tri≈; tri>)
2323
open import Relation.Binary.PropositionalEquality.Core using (_≡_; refl)
2424

2525
private

‎src/Data/Tree/AVL/Indexed/Relation/Unary/All.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66

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

9-
open import Relation.Binary using (StrictTotalOrder)
9+
open import Relation.Binary.Bundles using (StrictTotalOrder)
1010

1111
module Data.Tree.AVL.Indexed.Relation.Unary.All
1212
{a ℓ₁ ℓ₂} (strictTotalOrder : StrictTotalOrder a ℓ₁ ℓ₂)

‎src/Data/Tree/AVL/Indexed/Relation/Unary/Any.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66

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

9-
open import Relation.Binary using (StrictTotalOrder)
9+
open import Relation.Binary.Bundles using (StrictTotalOrder)
1010

1111
module Data.Tree.AVL.Indexed.Relation.Unary.Any
1212
{a ℓ₁ ℓ₂} (strictTotalOrder : StrictTotalOrder a ℓ₁ ℓ₂)

‎src/Data/Tree/AVL/Indexed/Relation/Unary/Any/Properties.agda

+2-2
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66

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

9-
open import Relation.Binary using (StrictTotalOrder)
9+
open import Relation.Binary.Bundles using (StrictTotalOrder)
1010

1111
module Data.Tree.AVL.Indexed.Relation.Unary.Any.Properties
1212
{a ℓ₁ ℓ₂} (sto : StrictTotalOrder a ℓ₁ ℓ₂)
@@ -21,7 +21,7 @@ open import Data.Sum.Base as Sum using (_⊎_; inj₁; inj₂)
2121
open import Function.Base as F
2222
open import Level using (Level)
2323

24-
open import Relation.Binary using (_Respects_; tri<; tri≈; tri>)
24+
open import Relation.Binary.Definitions using (_Respects_; tri<; tri≈; tri>)
2525
open import Relation.Binary.PropositionalEquality.Core using (_≡_) renaming (refl to ≡-refl)
2626
open import Relation.Nullary using (¬_; Dec; yes; no)
2727
open import Relation.Nullary.Negation using (contradiction)

‎src/Data/Tree/AVL/Map.agda

+1-1
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88

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

11-
open import Relation.Binary using (StrictTotalOrder)
11+
open import Relation.Binary.Bundles using (StrictTotalOrder)
1212

1313
module Data.Tree.AVL.Map
1414
{a ℓ₁ ℓ₂} (strictTotalOrder : StrictTotalOrder a ℓ₁ ℓ₂)

‎src/Data/Tree/AVL/Map/Membership/Propositional.agda

+2-2
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@
77

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

10-
open import Relation.Binary using (StrictTotalOrder)
10+
open import Relation.Binary.Bundles using (StrictTotalOrder)
1111

1212
module Data.Tree.AVL.Map.Membership.Propositional
1313
{a ℓ₁ ℓ₂} (strictTotalOrder : StrictTotalOrder a ℓ₁ ℓ₂)
@@ -21,7 +21,7 @@ open import Data.Sum.Base using (_⊎_; inj₁; inj₂)
2121
open import Function.Base using (_∘_; _∘′_)
2222
open import Level using (Level)
2323

24-
open import Relation.Binary using (Transitive; Symmetric; _Respectsˡ_)
24+
open import Relation.Binary.Definitions using (Transitive; Symmetric; _Respectsˡ_)
2525
open import Relation.Binary.Core using (Rel)
2626
open import Relation.Binary.Construct.Intersection using (_∩_)
2727
open import Relation.Binary.PropositionalEquality

0 commit comments

Comments
 (0)