Restriction of Ordering is Ordering

Theorem
Let $S$ be a set.

Let $\mathcal R \subseteq S \times S$ be an ordering on $S$.

Let $T \subseteq S$ be a subset of $S$.

Let $\mathcal R \restriction_T \ \subseteq T \times T$ be the restriction of $\mathcal R$ to $T$.

Then $\mathcal R \restriction_T$ is an ordering on $T$.

Proof
Let $\mathcal R$ be an ordering on $S$.

Then by definition:
 * $\mathcal R$ is a reflexive relation on $S$
 * $\mathcal R$ is an antisymmetric relation on $S$
 * $\mathcal R$ is a transitive relation on $S$.

Then:
 * from Restriction of Reflexive Relation is Reflexive, $\mathcal R \restriction_T$ is a reflexive relation on $T$
 * from Restriction of Antisymmetric Relation is Antisymmetric, $\mathcal R \restriction_T$ is an antisymmetric relation on $T$
 * from Restriction of Transitive Relation is Transitive, $\mathcal R \restriction_T$ is a transitive relation on $T$

and so it follows by definition that $\mathcal R \restriction_T$ is an ordering on $T$.

Also see

 * Restriction of Equivalence Relation is Equivalence


 * Properties of Restriction of Relation‎ for other similar properties of the restriction of a relation.