This grammar looks correct to me.
I would prove it by showing both directions (i.e. a string is in the language iff it's produced by the grammar).
Proving that all strings produced by the grammar are in the language is easy: Simply consider that all productions of the grammar output the same number of 1s and 0s. Therefore any combination of productions must produce a string in the language.
To prove that all strings in the language can be produced by the grammar seems more tricky. I think induction could work on this, but nothing obvious comes to mind.
Good luck