モノイド
module monoid where open import bottom-type open import sum-type open import negation open import equivalence-relation open import apartness-relation open import natural-number open import sigma-type open import identity-type
record MonoidStr (S : ApartedSet) : Set where infixl 40 _·_ open ApartedSet S field empty : X _·_ : X → X → X field lunit : ∀ {x} → empty · x ≈ x runit : ∀ {x} → x · empty ≈ x assoc : ∀ {x y z} → (x · y) · z ≈ x · (y · z) -- TODO: resp, not pres ·-pres-∼ₗ : ∀ {x y} z → (x ∼ y) => (x · z ∼ y · z) ·-pres-∼ᵣ : ∀ {x y} z → (x ∼ y) => (z · x ∼ z · y) Monoid : Set₁ Monoid = Σ ApartedSet MonoidStr
MonoidStrℕ : MonoidStr ApartedSetℕ MonoidStrℕ = record { empty = zero ; _·_ = _+ℕ_ ; lunit = left-unit-+ℕ _ ; runit = right-unit-+ℕ _ ; assoc = λ {x = x} → assoc-+ℕ x _ _ ; ·-pres-∼ₗ = λ z → lift-compl (λ e → cong (_+ℕ z) e) ; ·-pres-∼ᵣ = λ z → lift-compl (λ e → cong (z +ℕ_) e) }