Do you need to show there's a bijection?

You could use induction as well. Start with the empty set (base case m=0). empty set union with {x} is {x} by definition and has 0+1 = 1 elements. so the base case is true.

then assume P(k): "A union with {x} has m+1 elements for "

then prove P(k+1)