Possible Duplicate:
Did I underestimate the limit proof?
Let $(a)_{n\in \Bbb N}$ and $(b)_{n\in \Bbb N}$ be sequences of real numbers such that $a_n$ $\le$ $b_n$ for all $n\in \Bbb N$. Prove that if $a_n \to a$ and $b_n \to b$; then a $\le$ b.
I have this question as homework. I have some sort of solution in mind but the professor wants us to hand in a formal proof. What I thought so far is to assume contrary, that a $\gt$ b, and to examine $n$ for large numbers to conclude $b_n \gt a_n$ and to have contradiction. But my problem is I don't even know what formal proof is. Could you please tell me what it is using this question.