Let `A` and `B` be two sets. Show that `f: AxxB->BxxA` defined by `f(a ,\ b)=(b ,\ a)` is a bijection.

Let A and B be sets. Show that f: AxxB to BxxA such that f(a,b) = (b,a) is a bijective function

Let A and B be sets. Show that f : A xx B rarr B xx A such that f (a,b) = (b,a) is bijective function .

Let A and B be sets, show that f : A xx B rarr B xx A such that f(a,b) = (b,a) is a bijective function.

Let A and B be sets. Show that f: A xxB rarr B xxA such that f(a,b) = (b,a) is bijecive function.

Let A and B sets. Show that f : A xx B to Bxx A such that f (a,b) = (b,a) is bijective function.

Let A and B sets. Show that f : A xx B to Bxx A such that f (a,b) = (b,a) is bijective function.

Let S and T be two non- empty sets. Show that, f:SxxT rarr TxxS defined by , f(a,b)=(b,a) for all (a,b) in Sxx T is a bijection.

Let A and B be two non empty sets, then show that AxxB=BxxA . If A=B

Let A and B be sets.Show that f:A times B rarr B times A such that (a,b)=(b,a) is bijective function.