Although, that still doesn't convince me that there are just as many even numbers as integers.
Ultimately, it's just a matter of definition, of course.
You can dislike the standard definition of "same number", which implies that there are the same number of integers as even integers, because that seems strange to you, but then think about what definition of "same number" you might like better.
The standard definition, involving pairing up the elements of the two sets being compared, is very general, in that the sets need not be related in any way. It is not necessary that one be a subset of the other, nor need they have any elements in common at all. The definition is still able to tell us whether they're the same size or not.
You think that a proper superset
* of a set ought to be considered bigger than it, but what about unrelated sets? How do you propose to compare their sizes?
For example, consider these two sets of finite-length strings of letters: One set contains all strings that consist of only the letters
a or
b (e.g.,
a,
aa,
b,
bb,
abaaba, etc.). The other set contains all strings that consist of only the letters
c,
d, or
e (e.g.,
c,
ccddc,
edd,
ecdce, etc.). Which set is bigger? Are they the same size? How can we decide? Or are they simply incomparable, in your opinion?
*definition: A
proper superset of a set
S is a set that contains everything that
S does, plus some additional stuff besides, the way that the integers contain all the even integers, plus the odd ones too.