This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: B C BUT such an x may not exist (if A = ) Proving two sets are equal In general to show that X = Y we need to show two things: X Y and Y X Occasionally, however, the proof follows directly by logical equivalence: Example (DeMorgans Law): A B = A B Proof : A B = { x U x A B } = { x U ( x A B ) } = { x U ( x A x B ) } = { x U ( x A ) ( x B ) } = { x U ( x A ) ( x B ) } = { x U ( x A ) ( x B ) } = A B...
View
Full
Document
This note was uploaded on 12/24/2010 for the course CS CS 173 taught by Professor Fleck during the Spring '10 term at University of Illinois, Urbana Champaign.
 Spring '10
 fleck

Click to edit the document details