Prove that if $x,y\in\alpha$, then $xy$ or $x=y$. I refer to pg.4, Lemma 12 of this article on ordinal numbers. 
It says "If $x,y\in \alpha$, then $x<y, x>y, \text { or }x=y$". 
My question: As $\alpha$ is an ordinal, we know $x<\alpha$ and $y<\alpha$. However, how do we know that $x$ and $y$ can be compared in this manner? We know that as $\alpha$ is transitive, $x,y\subset\alpha$. However, that does not necessarily imply $x\subset y$, $y\subset x$ or $y=x$! Moreover, $x,y$ are not real numbers such that we could assume that one of the three relations $x<y,x>y$ or $x=y$ should hold.
Although $x$ and $y$ are ordinal numbers themselves by the fact that $x,y\in\alpha$, we can't assume this now as the lemma I am currently studying will be used to establish this fact. 
Thanks in advance! 
 A: This follows directly from the definition of ordinals used in that text:

Definition 8. An ordinal is a transitive set well-ordered under the relation $x < y$ if $x \in y$.

This means that $\in$ is a well-ordering of $\alpha$. By definition, well-ordering is a linear ordering.

To address your comment requiring more clarification for the same proof:
$\alpha\in\alpha$ cannot hold for any set (in ZFC) by Axiom of regularity.
See also this question and the questions linked there. 
Notice that this is used in that proof to arrive to contradiction. (So you are right in claiming that this cannot hold. But since this is a proof by contradiction, we want to get something that does not hold.)
It is perhaps worthwhile noticing, that this proof in fact does not use Axiom of Regularity. But I thought it was worth mentioning, so that you know that $x\notin x$ is true for any set (if you're working in the axiomatic system ZFC). It is not a special property valid only for ordinals.
A: Note that $<$ is merely a binary relation symbol. It is not inherently the order of the real numbers, or some other partial order.
I claim that a well-order is a linear order. Consider Definition 6, given $(A,\prec)$ which is a well-order, let $a,b\in A$ then $\{a,b\}$ is a non-empty subset of $A$ and therefore has a least element, therefore $a$ and $b$ are comparable.
Now it's easy to deduce that ordinals are linear orders by Definition 8 which requires them to be well-ordered by $\in$.
