Prove the first associative law from Table 1 by showing

Chapter 1, Problem 21E

(choose chapter or problem)

Get Unlimited Answers
QUESTION:

Problem 21E

Prove the first associative law from Table 1 by showing that if A.b. and C are sets, then A ∪ (B ∪ C) = (A ∪ B) ∪ C.

Questions & Answers

QUESTION:

Problem 21E

Prove the first associative law from Table 1 by showing that if A.b. and C are sets, then A ∪ (B ∪ C) = (A ∪ B) ∪ C.

ANSWER:

Solution

Step 1:

Consider the three sets A and b and C we have to prove that

 

Which is  associative law of sets for union

Add to cart


Study Tools You Might Need

Not The Solution You Need? Search for Your Answer Here:

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back