{-# OPTIONS --without-K --safe #-}
module Function.Properties.Surjection where
open import Data.Product.Base using (_,_; proj₁; proj₂)
open import Function.Base using (_∘_; _$_)
open import Function.Bundles
using (Func; Surjection; Bijection; _↠_; _⟶_; _↪_; mk↪; _⇔_; mk⇔)
import Function.Construct.Identity as Identity using (surjection)
import Function.Construct.Composition as Compose using (surjection)
open import Function.Definitions using (Surjective; Injective; Congruent)
open import Level using (Level)
open import Relation.Binary.Bundles using (Setoid)
open import Relation.Binary.Definitions using (Reflexive; Trans)
import Relation.Binary.PropositionalEquality.Core as ≡
import Relation.Binary.Reasoning.Setoid as ≈-Reasoning
private
variable
a b c ℓ ℓ₁ ℓ₂ ℓ₃ : Level
A B : Set a
T S : Setoid a ℓ
mkSurjection : (f : Func S T) (open Func f) →
Surjective Eq₁._≈_ Eq₂._≈_ to →
Surjection S T
mkSurjection f surjective = record
{ Func f
; surjective = surjective
}
↠⇒⟶ : A ↠ B → A ⟶ B
↠⇒⟶ = Surjection.function
↠⇒↪ : A ↠ B → B ↪ A
↠⇒↪ s = mk↪ {from = to} λ { ≡.refl → strictlyInverseˡ _ }
where open Surjection s
↠⇒⇔ : A ↠ B → A ⇔ B
↠⇒⇔ s = mk⇔ to from
where open Surjection s
refl : Reflexive (Surjection {a} {ℓ})
refl {x = x} = Identity.surjection x
trans : Trans (Surjection {a} {ℓ₁} {b} {ℓ₂})
(Surjection {b} {ℓ₂} {c} {ℓ₃})
(Surjection {a} {ℓ₁} {c} {ℓ₃})
trans = Compose.surjection
module _ (surjection : Surjection S T) where
open Surjection surjection
injective⇒to⁻-cong : Injective Eq₁._≈_ Eq₂._≈_ to →
Congruent Eq₂._≈_ Eq₁._≈_ from
injective⇒to⁻-cong injective = Bijection.from-cong S⤖T
where
S⤖T : Bijection S T
S⤖T = record { cong = cong ; bijective = injective , surjective }
{-# WARNING_ON_USAGE injective⇒to⁻-cong
"Warning: injective⇒to⁻-cong was deprecated in v3.0.
Please use Function.Bundles.Bijection.from-cong instead. "
#-}