Proving something true, by proving it unprovable

While browsing through the internet, I came across an interesting fact. If the famous, unsolved Riemann Hypothesis was shown to be undecidable, that would imply its truth. I wondered if that same method of proof could be used on other unsolved mathematical statements. Although not a logician, I decided to try to explain this unusual phenomenon, along with some other methods of proof. I summarized my results in the below video.