Ok. What is the proof trying to setup by considering such an arbitrary sequence $(a_n)$? Why in the world, are we talking about sequences, even when all we need to show is something completely unrelated?
... Think about it for a while. Are these really unrelated things?
Start from the beginning. We need to show that $\mathbb{N}$ and $(0,1)$ are not equivalent (I assume you're talking about their cardinalities). Let's say, they were. Then, next?
Definition: Two non-empty sets are said to have same cardinalities, if there exists a bijection between the two sets.
So let's say there is a bijection from $(0,1)$ to $\mathbb{N}$.
Here comes something interesting and "related". If we have a bijection from a set to $\mathbb{N}$, we can represent each element of that set with a unique natural number. What that means is we can represent the elements of this set as $a_1, a_2, \ldots$, which is implicitly representing the bijection itself (How?)
So, the proof now carries on with the rest of the argument. And what it tries to present is that, even if we had a bijection then there is an element in $(0,1)$ which is not mapped to any element of $\mathbb{N}$ (doesn't appears in the sequence $(a_n)$ anywhere), but that shouldn't be the case as we had clearly set up a mapping between the two, that is to say, each element from $(0,1)$ was enumerated i.e. appeared in our sequence somewhere or the other.
For the next question, why is $I_n \subset I_{n+1}$. This is by our construction.
Let's say, you had $0.958 = a_1, 0.123 = a_2, 0.456 = a_3, \ldots$ (doesn't matter, take up anything you like), then choose $I_1 = [0.1,0.9], I_2 = [0.2,0.9], I_3 = [0.2,0.3]$. Do you see the pattern?
Don't get involved with so many symbols, replace them with whatever numbers you like, for your own understanding.
Good luck.