there are uncountable many real numbers between 0 and 1 on the real line an they all satisfy inequality
x<1
so you can trivialy prove for each of them that they are <1

but proof is a finite string of symbols, so there can only be countable many proofs...