# Restriction to Subset of Strict Total Ordering is Strict Total Ordering

Jump to navigation
Jump to search

It has been suggested that this page or section be merged into Restriction of Strict Total Ordering is Strict Total Ordering.To discuss this page in more detail, feel free to use the talk page.When this work has been completed, you may remove this instance of `{{Mergeto}}` from the code. |

## Theorem

Let $\prec$ be a strict total ordering on $A$.

Let $T$ be a subset or subclass of $A$.

Then the restriction of $\prec$ to $B$ is a strict total ordering of $B$.

## Proof

Follows from:

- Restriction of Transitive Relation is Transitive
- Restriction of Antireflexive Relation is Antireflexive
- Restriction of Connected Relation is Connected

$\blacksquare$