Reflexive Closure is Order Preserving

Theorem
Let $S$ be a set.

Let $R$ denote the set of all endorelations on $S$.

Then the reflexive closure operator is an order preserving mapping on $R$.

That is:


 * $\forall \mathcal R, \mathcal S \in R: \mathcal R \subseteq \mathcal S \implies \mathcal R^= \subseteq S^=$

where $\mathcal R^=$ and $\mathcal S^=$ denote the reflexive closure of $\mathcal R$ and $\mathcal S$ respectively.

Proof
Let $\mathcal R, \mathcal S \in R$.

Suppose:


 * $\mathcal R \subseteq \mathcal S$

From Reflexive Closure/Union with Diagonal we define $\mathcal R^=$ and $\mathcal S^=$ to be:


 * $\mathcal R^= := \mathcal R \cup \Delta_S$


 * $\mathcal S^= := \mathcal S \cup \Delta_S$

Hence by Set Union Preserves Subsets/Corollary:


 * $\mathcal R^= \subseteq S^=$