{-# OPTIONS --without-K --safe #-}
open import Relation.Binary.Core using (Rel)
module Algebra.Consequences.Base
{a ℓ} {A : Set a} (_≈_ : Rel A ℓ) where
open import Algebra.Core using (Op₁; Op₂)
open import Algebra.Definitions _≈_
using (Congruent₂; LeftCongruent; RightCongruent
; Selective; Idempotent; SelfInverse; Involutive)
open import Data.Sum.Base using (reduce)
open import Level using (Level)
open import Relation.Binary.Consequences
using (mono₂⇒monoˡ; mono₂⇒monoʳ)
open import Relation.Binary.Definitions using (Reflexive)
private
variable
f : Op₁ A
_∙_ : Op₂ A
module Congruence (cong : Congruent₂ _∙_) (refl : Reflexive _≈_)
where
∙-congˡ : LeftCongruent _∙_
∙-congˡ {x} = mono₂⇒monoˡ _ _≈_ _≈_ (refl {x = x}) cong x
∙-congʳ : RightCongruent _∙_
∙-congʳ {x} = mono₂⇒monoʳ _≈_ _ _≈_ (refl {x = x}) cong x
sel⇒idem : Selective _∙_ → Idempotent _∙_
sel⇒idem sel x = reduce (sel x x)
reflexive∧selfInverse⇒involutive : Reflexive _≈_ → SelfInverse f →
Involutive f
reflexive∧selfInverse⇒involutive refl inv _ = inv refl
reflexive+selfInverse⇒involutive = reflexive∧selfInverse⇒involutive
{-# WARNING_ON_USAGE reflexive+selfInverse⇒involutive
"Warning: reflexive+selfInverse⇒involutive was deprecated in v2.0.
Please use reflexive∧selfInverse⇒involutive instead."
#-}