I'm trying to prove that the function f:P(ℤ)→P(ℕ) defined by f(X)=X∩ℕ is surjective but not bijective.
In order to do this, I need to prove that f is surjective and not injective. To prove that it is surjective, I have to suppose B∈P(ℕ) to prove that there exists A∈P(ℤ) for which f(A)=f(B). Also, it might be easier to prove that the image of f is P(ℕ), but I don't know how to do this (I'm doing it by double inclusion but I can't seem to prove that P(ℕ)⊂X∩ℕ .
Thanks.
In order to do this, I need to prove that f is surjective and not injective. To prove that it is surjective, I have to suppose B∈P(ℕ) to prove that there exists A∈P(ℤ) for which f(A)=f(B). Also, it might be easier to prove that the image of f is P(ℕ), but I don't know how to do this (I'm doing it by double inclusion but I can't seem to prove that P(ℕ)⊂X∩ℕ .
Thanks.