At first, it is probably a good idea to specify more clearly what is meant when you say "infinite". There are many different concepts of infinity which are quite different. For example, in the context of limits you can say that a quantity or function "goes to infinity", but in that case it just means "it gets (and remains) arbitrary large". That's a completely different type of infinity than the infinity you are speaking about when you say "how many". "How many elements does this set have" is called the cardinality of that set, and that's what the argument of your friend is about. Note that "how large is" may or may not refer to cardinality, i.e. "how many" (I'll come to another notion later). This other notion also has a concept if infinite, but that concept is different from the cardinality concept. Since your friend's argument was about cardinality ("how many"), in the following I'll use "infinity" in the cardinality sense, as "infinitely many".
OK, so what does it mean if you ask "how many"? Well, with finite sets, there's a well known way to answer that question, and that way is known as "counting": You choose one element of that set and say "one". You choose another element of that set and say "two". As soon as you run out of elements, the last number you've said is the number of elements in that set.
Now let's look at what you have done that way: You've chosen one object and assigned it the number $1$ (that is, from now on, it is the "first object"). You chosen another object and assigned it the number $2$, and so on. So finally, assuming there are $n$ objects in the set, every object got a number between $1$ and $n$ inclusive, and to each number there's a unique object which got that number. In other words, by counting the objects, you've established a one-to-one relation between that set and the objects in the set "numbers from 1 to $n$". Of course you could as well start counting with $0$ (as you might do if you are a C programmer used to zero-based arrays, or a mathematician used to natural numbers to include the $0$), and end up with $n-1$ as last number. But that doesn't matter because there are as many natural numbers between $0$ and $n-1$ as there are between $1$ and $n$, as you can easily check by counting them (either count the set $\{0,\dots,n-1\}$ starting with $1$, or count the set $\{1,\dots,n\}$ starting with $0$; in both case what you do is to establish a one-to-one relation between the sets). Indeed, you can even define the natural numbers as sets of all natural numbers below, with $0$ being the empty set, in that case, the number $n$ has exactly $n$ elements, and therefore there's a one-to-one relation between the number $n$ and any $n$-element set. (Side remark: This construction of the natural numbers can also be extended to infinite numbers and gives rise to yet another concept of infinity, which I won't talk about here.)
So the point is, whenever you have a one-to-one relation between two sets, they have the same number of elements. This is a useful definition because it can be used even for infinite sets, where the literal procedure of counting one after the other would never end. So two sets have, by definition, the same number of elements if there exists a one-to-one relation between the two sets.
With this knowledge we can now see that, in the context of cardinality, the question "are all infinities equal" means "does there exist a one-to-one mapping between any two infinite sets?" And in the concrete case of the numbers between $0$ and $1$ (that is, the interval $(0,1)$) and the numbers between $0$ and $2$ (that is, the interval $(0,2)$), the question can be rephrased as: "Is there a one-to-one mapping between the numbers in the interval $(0,1)$ and the interval $(0,2)$"?
It is not true that all infinities are equal, but it is true that the interval $(0,1)$ contains as many numbers as the interval $(0,2)$. However, while there are infinitely many numbers in $(0,1)$ and also infinitely many natural numbers, there are more numbers in the interval $(0,1)$ than there are natural numbers.
To see that there are as many numbers in $(0,1)$ and in $(0,2)$, just consider the function $f:x\mapsto 2x$. That function gives for each number in $(0,1)$ a number in $(0,2)$, and each number from $(0,2)$ can indeed be reached. Thus there's a one-to-one mapping between the numbers in $(0,1)$ and $(0,2)$.
However there's no one-to-one mapping between the integers and the numbers in $(0,1)$. The classic proof for this is Cantor's diagonal argument: Assume you'd have a one-to-one mapping between the natural numbers and the numbers in $(0,1)$, i.e. a mapping $\mathbb N\to (0,1), n\mapsto a_n$. Then write the numbers in ($0,1)$ in decimal. Then you can construct a number $x\in(0,1)$ by the following rule: The number starts with $0.$, and the $n$-th decimal digit of $x$ is $3$, unless the $n$-th decimal digit of $a_n$ is $3$, in which case you choose $5$ instead. Now the number $x$ is clearly in the interval $(0,1)$, therefore it should be one of the $a_n$s. However for each $n$, it differs from $a_n$ in the $n$th decimal, thus it cannot be in the list, and therefore the list cannot be complete.
OK, but given that there are as many numbers between $0$ and $1$ as there are between $0$ and $2$, so how can $2$ be larger than $1$? Well, the simplest answer is that the number is not an indication of how many numbers are below it (this is different to the natural numbers, where there are indeed exactly $n$ natural numbers below $n$). However there's defined an order between real numbers, which coincides with that of the natural numbers embedded with it. Basically, every positive number $x$ is larger than $0$ and larger than any other positive number between $0$ and $x$, and the reverse is true for negative numbers.
However, you may still insist that the interval $(0,2)$ is twice as large as the interval $(0,1)$. And you're right! But how does that fit with the fact that there are as many numbers in $(0,1)$ as there are in $(0,2)$? Well, the point is that when determining the size of the interval, you do not count the numbers in it (indeed, as shown above in the diagonal argument, you cannot count them). Instead you define the size of the interval (and of more general sets of numbers). Such a function which tells you how large a set is is called measure. You just have to make sure that the measure has some obvious properties: The size of the set should of course not change if you just move it around, the empty set (that is, when you have no numbers at all) should have size $0$, and if you have two distinct sets (like the numbers between $1$ and $2$ and in addition the numbers between $4$ and $6$), the total size should be the sum of the sizes. With those basic properties, and the assumption that $(0,1)$ should have a finite size (this implies that a set consisting of a single number, i.e. a single point on the real line, has size $0$), you already get that the interval $(0,2)$ is twice as large as the interval $(0,1)$: You get the numbers between $0$ and $2$ as the numbers between $0$ and $1$, the number $1$ (but that has size $0$), and the numbers between $1$ and $2$ (but those are just the numbers between $0$ and $1$ shifted to the right by $1$). So if the interval $(0,1)$ has size $x$, the interval $(0,2)$ has size $x+0+x=2x$, so it is indeed twice as large.
Best Answer
In response to the side question: it alerts the system that you want them to be rendered as symbols rather than left alone. You don't want the system to try to render everything as math because then it looks like $this which is really hard to read$ (unless you force it to insert spaces etc. by hand). In this question it wasn't really all that necessary.
As for the question: there are two main kinds of infinity that come up frequently in mathematics. The one that is mentioned here is called infinite cardinality. This means you have some collection of things, and there are infinitely many things in it. We say a collection is infinite in mathematics if whenever you list any number $n$ of the elements of the collection, then your list will be missing an element.
For example, with the integers, if I have $n$ integers in a list, I can find the biggest one. If that's $N$, then $N+1$ is an integer not on the list. So there are infinitely many integers (as you know).
The idea being used here is pairing off elements of your collection with the integers $1,2,\dots,n$. If I can pair off each element of my collection with exactly one of the integers $1,2,\dots,n$, then my collection and $1,2,\dots,n$ have the same number of elements, namely $n$.
We define infinite cardinality in the same way: two infinite collections have the same cardinality ("number of elements") if I can pair off each element of one with exactly one element of the other. The tricky thing with infinite collections is this word "can". You might think that there are fewer even positive integers than there are positive integers, because all even positive integers are positive integers but odd positive integers exist. What you've done is paired off each even positive integer with a positive integer in one way, by matching $n$ with $n$. But I can pair off each even positive integer with a positive integer in a different way: I can match $n$ with $n/2$. Then I've actually paired off each positive integer with each even positive integer. So they have the same "size", at least if we decide to define size this way.
A surprising fact discovered by Georg Cantor in the 1800s is that not all infinite collections have the same cardinality. The most familiar infinite collections with different cardinalities are the integers and the real numbers. There are more real numbers than there are integers.
The way that Cantor showed this is basically the same way that we showed that there are infinitely many positive integers: pair off each positive integer with a real number (producing an infinite list of numbers) and then present a real number which isn't on the list. The hard part is again this word "can": he had to come up with a recipe for a number not on the list no matter what list he was given, so his recipe for the "missing" number has to depend on the given list in a clever way. Cantor also showed that there are infinitely many different infinite cardinalities, using basically the same idea.