Suppose that {An : n e N} is a family of sets (not necessarily pairwise disjoint) such that An is countable for every n. Prove that UnEN An is countable. (Hint: prove that there is a surjection f : N x N →Unen An and say why this is sufficient.)

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter1: Fundamentals
Section1.4: Binary Operations
Problem 15E: 15. Let be a binary operation on the non empty set . Prove that if contains an identity element...
icon
Related questions
Question
100%
4
Suppose that {An : n e N} is a family of sets (not necessarily pairwise disjoint) such that An is
countable for every n. Prove that UnEN An is countable. (Hint: prove that there is a surjection
f : N x N → Unen An and say why this is sufficient.)
Transcribed Image Text:Suppose that {An : n e N} is a family of sets (not necessarily pairwise disjoint) such that An is countable for every n. Prove that UnEN An is countable. (Hint: prove that there is a surjection f : N x N → Unen An and say why this is sufficient.)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer