In fact, there was a whole literature of papers proving that if the GRH was false in one particular way (the existence of Landau-Siegel zeroes) many theorems followed from it. For example, if there's a Landau-Siegal zero, the twin primes conjecture is true.
Are you claiming that there wasn't a significant majority of mathematicians who believed it true? That's all I'm saying. I can only assume we agree.
To expand on what I said though, if it is proven that P != NP then nothing really changes as that assumption is in line with everything we understand about computational complexity theory. The proof would really just suggest there's probably nothing that surprising to be found that we don't know.
If P = NP however that is far more likely to suggest we're missing something fundamental which could radical consequences for more practical fields like comp-sci. Similar can be said of GRH. Everything we know points in the direction of GRH being true, and while it may be interesting to prove these things, its much less likely to lead to some surprising and impactful downstream discoveries.
But that doesn't change the value of proving it. Most graph theorists probably thought the 4-color theorem was true, but it was still a big deal when a computer proof showed it. Most people thought the Kepler conjecture was true, but it was still a big deal when Hales reduced it to a big minimization problem that he solved.
On the flip side, everybody thought the Hauptvermutung was true, and probably subconsciously used it. But it's not.