Infima Preserving Mapping on Filters is Increasing

Theorem

Let $\struct {S, \preceq}$, $\struct {T, \precsim}$ be ordered sets.

Let $f: S \to T$ be a mapping.

For every filter $F$ in $\struct {S, \preceq}$, let $f$ preserve the infimum on $F$.

Then $f$ is increasing.

Proof

Let $x, y \in S$ such that:

$x \preceq y$
$\set x$ and $\set y$ admit infima in $\struct {S, \preceq}$
$\set x^\succeq$ and $\set y^\succeq$ admit infima in $\struct {S, \preceq}$

where $\set x^\succeq$ denotes the upper closure of $\set x$.

$x^\succeq$ and $y^\succeq$ admit infima in $\struct {S, \preceq}$
$x^\succeq$ and $y^\succeq$ are filter in $\struct {S, \preceq}$

By assumption and definition of mapping preserves the infimum on subset:

$\map {f^\to} {x^\succeq}$ and $\map {f^\to} {y^\succeq}$ admit infima in $\struct {T, \precsim}$

and

$\inf \set {\map {f^\to} {x^\succeq} } = \map f {\inf \set {x^\succeq} }$ and $\inf \set {\map {f^\to} {y^\succeq} } = \map f {\inf \set {y^\succeq} }$
$\inf \set {x^\succeq} = x$ and $\inf \set {y^\succeq} = y$
$y^\succeq \subseteq x^\succeq$
$\map {f^\to} {y^\succeq} \subseteq \map {f^\to} {x^\succeq}$

Thus by Infimum of Subset:

$\map f x \precsim \map f y$

Thus by definition:

$f$ is increasing.

$\blacksquare$