1
------------------------------------------------------------------------
2
-- The Agda standard library
4
-- Properties satisfied by decidable total orders
5
------------------------------------------------------------------------
7
open import Relation.Binary
9
module Relation.Binary.Properties.DecTotalOrder
10
{d₁ d₂ d₃} (DT : DecTotalOrder d₁ d₂ d₃) where
12
open Relation.Binary.DecTotalOrder DT hiding (trans)
13
import Relation.Binary.NonStrictToStrict as Conv
16
strictTotalOrder : StrictTotalOrder _ _ _
17
strictTotalOrder = record
18
{ isStrictTotalOrder = record
19
{ isEquivalence = isEquivalence
20
; trans = trans isPartialOrder
21
; compare = trichotomous Eq.sym _≟_ antisym total
22
; <-resp-≈ = <-resp-≈ isEquivalence ≤-resp-≈
26
open StrictTotalOrder strictTotalOrder public