Documentation
Mathlib
.
Algebra
.
Divisibility
.
Hom
Search
return to top
source
Imports
Init
Mathlib.Algebra.Divisibility.Basic
Mathlib.Algebra.Group.Equiv.Defs
Mathlib.Algebra.Group.Hom.Defs
Imported by
map_dvd
map_rightDvd
map_dvd_iff
map_rightDvd_iff
map_symm_dvd
dvd_map_symm
map_dvd_iff_dvd_symm
MulHom
.
map_dvd
MonoidHom
.
map_dvd
Mapping divisibility across multiplication-preserving homomorphisms
#
Tags
#
divisibility, divides
source
theorem
map_dvd
{
F
:
Type
u_2}
{
M
:
Type
u_3}
{
N
:
Type
u_4}
[
Semigroup
M
]
[
Semigroup
N
]
[
FunLike
F
M
N
]
[
MulHomClass
F
M
N
]
{
a
b
:
M
}
(
f
:
F
)
:
a
∣
b
→
f
a
∣
f
b
source
theorem
map_rightDvd
{
F
:
Type
u_2}
{
M
:
Type
u_3}
{
N
:
Type
u_4}
[
Semigroup
M
]
[
Semigroup
N
]
[
FunLike
F
M
N
]
[
MulHomClass
F
M
N
]
{
a
b
:
M
}
(
f
:
F
)
:
a
∣ᵣ
b
→
f
a
∣ᵣ
f
b
source
@[simp]
theorem
map_dvd_iff
{
E
:
Type
u_1}
{
M
:
Type
u_3}
{
N
:
Type
u_4}
[
Semigroup
M
]
[
Semigroup
N
]
[
EquivLike
E
M
N
]
[
MulEquivClass
E
M
N
]
{
a
b
:
M
}
(
e
:
E
)
:
e
a
∣
e
b
↔
a
∣
b
source
@[simp]
theorem
map_rightDvd_iff
{
E
:
Type
u_1}
{
M
:
Type
u_3}
{
N
:
Type
u_4}
[
Semigroup
M
]
[
Semigroup
N
]
[
EquivLike
E
M
N
]
[
MulEquivClass
E
M
N
]
{
a
b
:
M
}
(
e
:
E
)
:
e
a
∣ᵣ
e
b
↔
a
∣ᵣ
b
source
@[simp]
theorem
map_symm_dvd
{
M
:
Type
u_3}
{
N
:
Type
u_4}
[
Semigroup
M
]
[
Semigroup
N
]
{
a
:
M
}
(
e
:
M
≃*
N
)
{
b
:
N
}
:
e
.
symm
b
∣
a
↔
b
∣
e
a
source
@[simp]
theorem
dvd_map_symm
{
M
:
Type
u_3}
{
N
:
Type
u_4}
[
Semigroup
M
]
[
Semigroup
N
]
{
a
:
M
}
(
e
:
M
≃*
N
)
{
b
:
N
}
:
a
∣
e
.
symm
b
↔
e
a
∣
b
source
@[deprecated dvd_map_symm (since := "2026-11-14")]
theorem
map_dvd_iff_dvd_symm
{
E
:
Type
u_1}
{
M
:
Type
u_3}
{
N
:
Type
u_4}
[
Semigroup
M
]
[
Semigroup
N
]
[
EquivLike
E
M
N
]
[
MulEquivClass
E
M
N
]
{
a
:
M
}
(
e
:
E
)
{
b
:
N
}
:
e
a
∣
b
↔
a
∣
(↑
e
)
.
symm
b
source
theorem
MulHom
.
map_dvd
{
M
:
Type
u_3}
{
N
:
Type
u_4}
[
Semigroup
M
]
[
Semigroup
N
]
{
a
b
:
M
}
(
f
:
M
→ₙ*
N
)
:
a
∣
b
→
f
a
∣
f
b
source
theorem
MonoidHom
.
map_dvd
{
M
:
Type
u_5}
{
N
:
Type
u_6}
[
Monoid
M
]
[
Monoid
N
]
(
f
:
M
→*
N
)
{
a
b
:
M
}
:
a
∣
b
→
f
a
∣
f
b