Discrete Mathematics with Applications 4th Edition

Published by Cengage Learning
ISBN 10: 0-49539-132-8
ISBN 13: 978-0-49539-132-6

Chapter 6 - Set Theory - Exercise Set 6.2 - Page 365: 4

Answer

Proof: Suppose A and B are any sets and A ⊆ B. [We must show that A⋃B⊆B .] Let x ∈ A⋃B . [We must show that xϵB.] By definition of union, x ∈ A or x ∈ B . In case x ∈ A , then since A ⊆ B, x ∈ B . In case x ∈ B, then clearly x ∈ B. So in either case, x ∈ B [as was to be shown]

Work Step by Step

Proof: Suppose A and B are any sets and A ⊆ B. [We must show that A⋃B⊆B .] Let x ∈ A⋃B . [We must show that xϵB.] By definition of union, x ∈ A or x ∈ B . In case x ∈ A , then since A ⊆ B, x ∈ B . In case x ∈ B, then clearly x ∈ B. So in either case, x ∈ B [as was to be shown]
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.