Proving power sets are bijective when the base sets are bijective

[The1TL]

Let A,B, and C be non-empty sets. A and B are bijective.

Prove that the power set of A is bijective to the power set of B.

I understand how to prove bijection but can't figure out how to apply this to power sets and can't find any info on this subject.

 

[Dick]

You don't have to prove there is a bijection between A and B. The problem is giving you that. The power set of A is the set of all subsets of A. Ditto for B. Use the bijection between A and B to construct a bijection between Pow(A) and Pow(B). I have no idea what C is supposed to be in this problem.