LCM of Three Numbers

Theorem
Let $a, b, c \in \Z: a b c \ne 0$.

The lowest common multiple of $a, b, c$, denoted $\lcm \left\{{a, b, c}\right\}$, can always be found.

Proof
Let $d = \lcm \left\{{a, b}\right\}$.

This exists from.

Either $c \mathrel \backslash d$ or not, where $\backslash$ denotes divisibility.

Suppose $c \mathrel \backslash d$.

But by definition of lowest common multiple, $a \mathrel \backslash d$ and $b \mathrel \backslash d$ also.

Suppose $a, b, c$ are divisors of $e$ where $e < d$.

Then $a, b$ are divisors of $e$.

That is, $e$ is a common divisor of $a$ and $b$ which is lower than $d$.

But by :
 * $d \mathrel \backslash e$

which is impossible.

It follows that there can be no such $e$.

Therefore $d = \lcm \left\{{a, b, c}\right\}$.

Now suppose $c \nmid d$.

Let $e = \lcm \left\{{c, d}\right\}$.

This exists from.

Since $a$ and $b$ are both divisors of $d$, it follows that:
 * $a \mathrel \backslash e$
 * $b \mathrel \backslash e$

But we have that $c \mathrel \backslash e$ as well.

Suppose $a, b, c$ are divisors of $f$ where $f < e$.

Then $a, b$ are divisors of $f$.

So by :
 * $d = \lcm \left\{{a, b}\right\} \mathrel \backslash f$

But also $c \mathrel \backslash f$.

Therefore $c$ and $d$ are divisors of $f$.

By :
 * $e = \lcm \left\{{c, d}\right\} \mathrel \backslash f$

But this is impossible as by hypothesis $f < e$.

Therefore $a, b, c$ are divisors of no number smaller than $e$.

Therefore $e = \lcm \left\{{a, b, c}\right\}$.