# Lec0201sol - (Absorption Law = A B C A U(Identity Law = A B C A(B B(Inverse Law = A B C A B C A B(Distributive Law = A B C A B C A B(Commutative

This preview shows page 1. Sign up to view the full content.

Proof of the following set equivalence using a Set Table. ¬ A ¬ B (A B ¬ C) = ¬ (A B C) A B C ¬ (A B C) 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 0 A B C ¬ A ¬ B A B ¬ C ¬ A ¬ B (A B ¬ C) 0 0 0 1 1 0 1 0 0 1 1 1 0 1 0 1 0 1 0 0 1 0 1 1 1 0 0 1 1 0 0 0 1 0 1 1 0 1 0 1 0 1 1 1 0 0 0 1 1 1 1 1 0 0 0 0 Thus, the two sets are equivalent. Using the Set Laws: ¬ (A B C) = ¬ (A B) ¬ C (De Morgan’s) = ( ¬ A ¬ B) ¬ C (De Morgan’s) = ¬ A ¬ B ( ¬ C U) (Identity Law) = ¬ A ¬ B ( ¬ C (A ¬ A) ) (Inverse Law) = ¬ A ¬ B ( ¬ C A) ( ¬ C ¬ A) (Distributive Law) = ( ¬ A ( ¬ A ¬ C)) ¬ B ( ¬ C A) = ¬ A ¬ B ( ¬ C A)
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (Absorption Law) = A B (( C A) U) (Identity Law) = A B (( C A) (B B)) (Inverse Law) = A B ( C A B) ( C A B) (Distributive Law) = A B ( C A B) ( C A B) (Commutative Law) = A B ( C A B) (Absorption Law)...
View Full Document

## This document was uploaded on 07/14/2011.

Ask a homework question - tutors are online