Divisor Divides Multiple

From ProofWiki
Jump to navigation Jump to search


Let $a, b$ be integers.


$a \divides b$

where $\divides$ denotes divisibility.


$\forall c \in \Z: a \divides b c$

Proof 1

Let $a \divides b$.

From Integer Divides Zero:

$a \divides 0$

Thus $a$ is a common divisor of $b$ and $0$.

From Common Divisor Divides Integer Combination:

$\forall p, q \in \Z: a \divides \paren {p \cdot b + q \cdot 0}$

Putting $p = c$ and $q = 1$ (for example):

$a \divides \paren {c b + 0}$

Hence the result.


Proof 2

\(\ds a\) \(\divides\) \(\ds b\)
\(\ds \leadsto \ \ \) \(\ds \exists x \in \Z: \, \) \(\ds b\) \(=\) \(\ds x a\) Definition of Divisor of Integer
\(\ds \leadsto \ \ \) \(\ds b c\) \(=\) \(\ds x c a\)
\(\ds \leadsto \ \ \) \(\ds \exists z \in \Z: \, \) \(\ds b c\) \(=\) \(\ds z a\) where $z = x c$
\(\ds \leadsto \ \ \) \(\ds a\) \(\divides\) \(\ds b c\) Definition of Divisor of Integer