Exercise 1.1

Check the distributive laws for and and DeMorgan’s laws.

Answers

Suppose that A, B, and C are sets. First, we show that A (B C) = (A B) (A C).

Proof. We show this as a series of logical equivalences:

x A (B C) x A x B C x A (x B x C) (x A x B) (x A x C) x A B x A C x (A B) (A C),

which of course shows the desired result. □

Next, we show that A (B C) = (A B) (A C).

Proof. We show this in the same way:

x A (B C) x A x B C x A (x B x C) (x A x B) (x A x C) x A B x A C x (A B) (A C),

which of course shows the desired result. □

Now we show the first DeMorgan’s law that A (B C) = (A B) (A C).

Proof. We show this in the same way:

x A (B C) x A xB C x A ¬(x B x C) x A (xB xC) (x A xB) (x A xC) x A B x A C x (A B) (A C),

which is the desired result. □

Lastly, we show that A (B C) = (A B) (A C).

Proof. Again we use a sequence of logical equivalences:

x A (B C) x A xB C x A ¬(x B x C) x A (xB xC) (x A xB) (x A xC) x A B x A C x (A B) (A C),

as desired. □

User profile picture
2019-12-01 00:00
Comments