Kaprekar's Process on 3 Digit Number ends in 495

Theorem
Let $n$ be a $3$-digit integer whose digits are not all the same.

Kaprekar's process, when applied to $n$, results in $495$ after no more than $6$ iterations.