Sorry, my english is not very good, but i will try to explain it.
You can not prove a bijective correspondence of AxB with BxA for any set A, B by an function that says nothing for empty sets.
The function says:
g: (a in A, b in B) --> (b in B, a in A)
The "axiom of empty set" says:
[tex]\exists X\, \forall y\, \lnot (y \in X)[/tex]
It means that there is an set A with no a in A. We call it emtpy set.
If you look again at the function g you will see that it is not defined for empty sets. Because if WLOG (Without loss of generality) A is the empty set, there is no a in A and so you don't know what (a in A, b in B) --> (b in B, a in A) means, or do you know what (,) -> (,) means?
So if you prove that g: (a in A, b in B) --> (b in B, a in A) is bijective, than you only know that there is a bijective correspondence of AxB with BxA when neither A nor B is an empty set.
Sure it is trivial that there is a bijective correspondence of {} and {}, but if you have to answer an basic question it should be an complete anwser without the "trivial"-option.
If i have to correct such an answer i would mark this point red, so i wanted to show this point before anyone will really mark this answer red.