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

Solution

Verified

Step 1

1 of 3

DEFINITIONS

$\textbf{Union}$ $A\cup B$ : All elements that are either in $A$ OR in $B$

$\textbf{Intersection}$ $A\cap B$ : All elements that are both in $A$ AND in $B$ .

$\textbf{Complement }\overline{A}$ : All elements in the universal set $U$ NOT in $A$ .

$\textbf{Negation}$ $\neg p$ : not $p$

$\textbf{Disjunction}$ $p\vee q$ : $p$ or $q$

$\textbf{Conjunction}$ $p\wedge q$ : $p$ and $q$

$\emptyset$ represents the $\textbf{empty set}$ and the empty set does not contain any elements (nor sets).

$\textbf{Associative laws for propositions}$ :

(p \vee q) \vee r\equiv p\vee (q\vee r)

(p \wedge q) \wedge r\equiv p\wedge (q\wedge r)

Create a free account to view solutions

By signing up, you accept Quizlet's Terms of Service and Privacy Policy

By signing up, you accept Quizlet's Terms of Service and Privacy Policy

7th Edition•ISBN: 9780073383095 (1 more)Kenneth Rosen

4,283 solutions

8th Edition•ISBN: 9780321964687Richard Johnsonbaugh

4,246 solutions

8th Edition•ISBN: 9781259676512Kenneth Rosen

4,397 solutions

5th Edition•ISBN: 9781337694193 (4 more)Susanna S. Epp

2,641 solutions