Question

Let A and B be sets and let X be a subset of A. Let f:...

Let A and B be sets and let X be a subset of A. Let f: A→B be a bijection. Prove that f(A-X)=B-f(X).

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Let A, B be sets and f: A -> B. For any subsets X,Y subset of...
Let A, B be sets and f: A -> B. For any subsets X,Y subset of A, X is a subset of Y iff f(x) is a subset of f(Y). Prove your answer. If the statement is false indicate an additional hypothesis the would make the statement true.
Let F be an ordered field.  Let S be the subset [a,b) i.e, {x|a<=x<b, x element of...
Let F be an ordered field.  Let S be the subset [a,b) i.e, {x|a<=x<b, x element of F}. Prove that infimum and supremum exist or do not exist.
Let A, B, C be sets and let f : A → B and g :...
Let A, B, C be sets and let f : A → B and g : f (A) → C be one-to-one functions. Prove that their composition g ◦ f , defined by g ◦ f (x) = g(f (x)), is also one-to-one.
Let A and B be nonempty sets. Prove that if f is an injection, then f(A...
Let A and B be nonempty sets. Prove that if f is an injection, then f(A − B) = f(A) − f(B)
Let A and B be nonempty sets. Prove that if f is an injection, then f(A...
Let A and B be nonempty sets. Prove that if f is an injection, then f(A − B) = f(A) − f(B)
X,Y be sets and f:X->Y is a function there's a function g:Y->X such that g(f(x))=x for...
X,Y be sets and f:X->Y is a function there's a function g:Y->X such that g(f(x))=x for all x∈X Prove or disprove: f is a bijection   
Let X = { x, y, z }. Let the list of open sets of X...
Let X = { x, y, z }. Let the list of open sets of X be Z1. Z1 = { {}, {x}, X }. Let Y = { a, b, c }. Let the list of open sets of Y be Z2. Z2 = { {}, {a, b}, Y }. Let f : X --> Y be defined as follows: f (x) = a, f (y) = b, f(z) = c Is f continuous? Prove or disprove using the...
Let (X, dX) and (Y, dY ) be metric spaces and let f : X →...
Let (X, dX) and (Y, dY ) be metric spaces and let f : X → Y be a continuous bijection. Prove that if (X, dX) is compact, then f is a homeomorphism
2) Given sets A, B. Two sets are equivalent if there is a bijection between them....
2) Given sets A, B. Two sets are equivalent if there is a bijection between them. Prove A x B is equivalent to B x A using bijection
Let f:(-inf,2] -> [1,inf) be given by f(x)=|x-2|+1. Prove that f is a bijection
Let f:(-inf,2] -> [1,inf) be given by f(x)=|x-2|+1. Prove that f is a bijection