Strictly Decreasing Mapping is Decreasing

Theorem
A mapping that is strictly decreasing is a decreasing mapping.

Proof
Let $\left({S, \preceq_1}\right)$ and $\left({T, \preceq_2}\right)$ be ordered sets.

Let $\phi: \left({S, \preceq_1}\right) \to \left({T, \preceq_2}\right)$ be strictly decreasing.

From Strictly Precedes is Strict Ordering:
 * $x \mathop {\preceq_1} y \iff x = y \lor x \mathop {\prec_1} y$

So:

This leaves us with:

Also see

 * Strictly Increasing Mapping is Increasing