How can I prove/disprove that a construction yields a secure PRG?
If there exists a secure PRG, then there is a secure PRG

whose last bit of output is always equal the last bit of its input.

If the last bit of G's output is always equal to the last bit of G's input, then the

function G' constructed as described in the question will not be a secure PRG.