Well, that was the short explanation. The long one makes a little more sense. (By the way, the technical term for the number of members in a set is the cardinality of a set.)

Let's try this from a different angle.

If you have two sets, X and Y, and you can map X to a subset of Y and still have some members of Y left over, then X can't be a bigger set than Y is. In other words, a set can't "fit inside" a set that's smaller than itself. For example, {1,2,3} can fit inside {a,b,c,d}, because you can map 1 to a, 2 to b, 3 to c, and still have "d" left over. This means that {1,2,3} can't be bigger than {a,b,c,d}. It shouldn't matter how you do the mapping, because we only care about whether or not the whole thing fits. Am I making sense here?

Now, because you can map the positive even integers to a subset of the positive integers (for example, by mapping each positive integer to itself) and still have positive integers left over (all the odd ones), the set of positive even integers fits inside the set of positive integers, and so it can't be bigger than the set of positive integers.

On the other hand, the positive integers can also fit inside the positive even integers. Just map every positive integer n to the positive even integer 2*(n+1). You get the list (1,4), (2,6), (3,8), and so on. You've used up every positive integer, but you still have a positive even integer - 2 - left over. So, because the positive integers fit inside the positive even integers, so they're not bigger, either.

If the positive even integers aren't bigger than the positive integers, and the positive integers aren't bigger than the positive even integers, then the only way that could happen is if they are both exactly the same size. (Which, indeed, they are.)