Theorem: If a finite set contains a real number, then it is a set of numbers Real.
Proof: By induction on the size of the set. Clearly true for sets of Size one. Suppose that the theorem is true for sets with n elements. Let's fix a set $A$ with $n + 1$ elements, $A=${$a_1,. . . , a_{n+1}$} and assume that $a_1$ is a real number. Then, the sets $A'=$ {$a_1,. . . , a_n$} and $A''= ${$a_1,. . . , a_{n-1}, a_{n+1}$} have n elements, and Contain some real number. Then $a_1,. . . , a_n, a_{n + 1}$ must be real numbers.
I think what is wrong is that we choose exactly a_1 as the real number, knowing that we can assume that there is a real number but we do not know what it is. Another thing is the fact of removing $a_{n + 1}$ and $a_n$ without knowing if this can be the real number that we have initially.