Comment by bell-cot

Does your uncountable set of propositions include some which cannot be written as a finite string of symbols?

If "yes" - how might such as proposition be proven true with a finite string of symbols?

(If your proof symbols are from an infinite character set, that has its own issues.)