Home
Class 12
MATHS
Let A and B be sets. Show that f :AxxB -...

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

Promotional Banner

Similar Questions

Explore conceptually related problems

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 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 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 times B rarr B times A such that (a,b)=(b,a) is bijective function.

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 two sets. Show that f: AxxB->BxxA defined by f(a ,\ b)=(b ,\ a) is a bijection.

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