theorem
isMonoidHom₂.map_one
{G : Type u_1}
{H : Type u_2}
[Monoid G]
[Monoid H]
{f : G → H}
(self : isMonoidHom₂ f)
:
f 1 = 1
theorem
isMonoidHom₂.map_mul
{G : Type u_1}
{H : Type u_2}
[Monoid G]
[Monoid H]
{f : G → H}
(self : isMonoidHom₂ f)
(g : G)
(g' : G)
:
theorem
MonoidHom₁.ext
{G : Type}
{H : Type}
:
∀ {inst : Monoid G} {inst_1 : Monoid H} {x y : MonoidHom₁ G H}, ↑x = ↑y → x = y
theorem
MonoidHom₁.map_one
{G : Type}
{H : Type}
[Monoid G]
[Monoid H]
(self : MonoidHom₁ G H)
:
↑self 1 = 1
theorem
MonoidHom₁.map_mul
{G : Type}
{H : Type}
[Monoid G]
[Monoid H]
(self : MonoidHom₁ G H)
(g : G)
(g' : G)
:
instance
instCoeFunMonoidHom₁Forall
{G : Type}
{H : Type}
[Monoid G]
[Monoid H]
:
CoeFun (MonoidHom₁ G H) fun (x : MonoidHom₁ G H) => G → H
Equations
- instCoeFunMonoidHom₁Forall = { coe := MonoidHom₁.toFun }
theorem
AddMonoidHom₁.ext
{G : Type}
{H : Type}
:
∀ {inst : AddMonoid G} {inst_1 : AddMonoid H} {x y : AddMonoidHom₁ G H}, ↑x = ↑y → x = y
theorem
AddMonoidHom₁.map_zero
{G : Type}
{H : Type}
[AddMonoid G]
[AddMonoid H]
(self : AddMonoidHom₁ G H)
:
↑self 0 = 0
theorem
AddMonoidHom₁.map_add
{G : Type}
{H : Type}
[AddMonoid G]
[AddMonoid H]
(self : AddMonoidHom₁ G H)
(g : G)
(g' : G)
:
instance
instCoeFunAddMonoidHom₁Forall
{G : Type}
{H : Type}
[AddMonoid G]
[AddMonoid H]
:
CoeFun (AddMonoidHom₁ G H) fun (x : AddMonoidHom₁ G H) => G → H
Equations
- instCoeFunAddMonoidHom₁Forall = { coe := AddMonoidHom₁.toFun }
Instances For
- toFun : F → M → N
- map_one : ∀ (f : F), MonoidHomClass₁.toFun f 1 = 1
- map_mul : ∀ (f : F) (g g' : M), MonoidHomClass₁.toFun f (g * g') = MonoidHomClass₁.toFun f g * MonoidHomClass₁.toFun f g'
Instances
theorem
MonoidHomClass₁.map_one
{F : Type}
{M : Type}
{N : Type}
:
∀ {inst : Monoid M} {inst_1 : Monoid N} [self : MonoidHomClass₁ F M N] (f : F), MonoidHomClass₁.toFun f 1 = 1
theorem
MonoidHomClass₁.map_mul
{F : Type}
{M : Type}
{N : Type}
:
∀ {inst : Monoid M} {inst_1 : Monoid N} [self : MonoidHomClass₁ F M N] (f : F) (g g' : M),
MonoidHomClass₁.toFun f (g * g') = MonoidHomClass₁.toFun f g * MonoidHomClass₁.toFun f g'
instance
instCoeFunForallOfMonoidHomClass₂
{M : Type}
{N : Type}
{F : Type}
[Monoid M]
[Monoid N]
[MonoidHomClass₂ F M N]
:
CoeFun F fun (x : F) => M → N
Equations
- instCoeFunForallOfMonoidHomClass₂ = { coe := MonoidHomClass₂.toFun }
instance
instMonoidHomClass₂MonoidHom₁
(M : Type)
(N : Type)
[Monoid M]
[Monoid N]
:
MonoidHomClass₂ (MonoidHom₁ M N) M N
Equations
- instMonoidHomClass₂MonoidHom₁ M N = { toFun := MonoidHom₁.toFun, map_one := ⋯, map_mul := ⋯ }
instance
instMonoidHomClass₂RingHom₁
(R : Type)
(S : Type)
[Ring R]
[Ring S]
:
MonoidHomClass₂ (RingHom₁ R S) R S
Equations
- instMonoidHomClass₂RingHom₁ R S = { toFun := fun (f : RingHom₁ R S) => ↑f.toMonoidHom₁, map_one := ⋯, map_mul := ⋯ }
instance
instMonoidHomClass₃MonoidHom₁
(M : Type)
(N : Type)
[Monoid M]
[Monoid N]
:
MonoidHomClass₃ (MonoidHom₁ M N) M N
Equations
theorem
OrderPresHom.ext
{α : Type}
{β : Type}
:
∀ {inst : LE α} {inst_1 : LE β} {x y : OrderPresHom α β}, x.toFun = y.toFun → x = y
theorem
OrderPresHom.le_of_le
{α : Type}
{β : Type}
[LE α]
[LE β]
(self : OrderPresHom α β)
(a : α)
(a' : α)
:
structure
OrderPresMonoidHom
(M : Type)
(N : Type)
[Monoid M]
[LE M]
[Monoid N]
[LE N]
extends
MonoidHom₁
:
- toFun : M → N
- map_one : ↑self.toMonoidHom₁ 1 = 1
Instances For
instance
instOrderPresHomClassOrderPresHom
(α : Type)
(β : Type)
[LE α]
[LE β]
:
OrderPresHomClass (OrderPresHom α β) α β
Equations
- instOrderPresHomClassOrderPresHom α β = { }
instance
instOrderPresHomClassOrderPresMonoidHom
(α : Type)
(β : Type)
[LE α]
[Monoid α]
[LE β]
[Monoid β]
:
OrderPresHomClass (OrderPresMonoidHom α β) α β
Equations
instance
instMonoidHomClass₃OrderPresMonoidHom
(α : Type)
(β : Type)
[LE α]
[Monoid α]
[LE β]
[Monoid β]
:
MonoidHomClass₃ (OrderPresMonoidHom α β) α β
Equations
- instMonoidHomClass₃OrderPresMonoidHom α β = sorryAx (MonoidHomClass₃ (OrderPresMonoidHom α β) α β)