Here are two false proofs of the fact that $\Bbb Q$ is uncountable. From Stephen Abbott's Understanding Analysis.
Proof 01
Lemma:(Nested Interval Property - NIP). For each $n ∈ N$, assume we are given a closed interval $I_n = [a_n, b_n]$. Assume also that each I_n contains I_{n+1}. Then, the resulting nested sequence of closed intervals $$I_1 ⊇ I_2 ⊇ I_3 ⊇ I_4 ⊇ · · ·$$ has a nonempty intersection.
Assume, for contradiction, that $\Bbb Q$ is countable. Thus we can write $\Bbb Q =\{r_1, r_2, r_3, . . .\}$ and, construct a nested sequence of closed intervals with $r_n \not \in I_n$. Our construction implies $\bigcap_{n=1}^{\infty} I_n = ∅$ while NIP implies $\bigcap_{n=1}^{\infty} I_n \neq ∅$ . This contradiction implies $\Bbb Q$ must therefore be uncountable.
Proof 02
Theorem : The open interval $(0,1)$ is uncountable.
Proof: Lets assume that $(0,1)$ is countable and thus let $f:\Bbb N\to (0,1)$ be a bijective function. Then let $f(m) = 0.a_{m1}a_{m2}a_{m3} . . . .$ (decimal representation). Let $x=0.b_1b_2...$ with $b_i=3$ if $a_{ii}=2$ else $b_i=2$. Its not difficult to see x is a different number from the counted set a contradiction.
Now the question is: Every rational number has a decimal expansion, so we could apply this same argument to show that the set of rational numbers between $0$ and $1$ is uncountable. However, because we know that any subset of $\Bbb Q$ must be countable, the proof of Theorem.
I can't figure out the flaws in these two arguments.
In proof $01$ you have not proved that $\bigcap\limits_{i=1}^n=\varnothing$, it could contain only one irrational number.
In proof $02$ you can't apply the same argument. Because the resulting number might be irrational.