Prove that H(s) = G(!s) is a CPRNG if G(s) is one

Given a cryptographic pseudo-random number generator G, prove that H with H(s) = G(!s) is also a cryptographic pseudo-random number generator. (s is a binary string; !s is its complement)

For this, we have to prove the two properties of a cryptographic pseudo-random number generator, the expansion and the pseudo-randomness.

• the expansion is trivial to prove, because that's the same for H and G
• but how to prove that it is also cryptographically pseudo-random?