This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CPSC 121 Lecture 30 March 25, 2009 Menu March 25, 2009 Topics: Set Theory (cont’d) Functions Reading: Today: Epp 5.2 Next: Epp 5.3 Epp 7.1 Reminders: No labs final partweek of classes (April 6–8) — submit all remaining lab work during the week of March 30–April 3 Quiz 2 posted — solutions posted to Sample Solutions area of the course WebCT site Assignment 4 due Friday, April 3 (by 17:00) Final exam Friday, April 17, 7:00pm, SRC A READ the WebCT Vista course announcements board Set Theory (cont’d) Let’s quickly review “Proof 1” of A ∩ B = A ∪ B (one variant of De Morgan’s laws for sets). Recall, we used set builder notation and logical equivalences in our proof. Example 1: We use set builder notation and logical equivalences to Prove: A ∩ B = A ∪ B (De Morgan law for sets) Proof 1: A ∩ B = { x  x / ∈ A ∩ B } definition of complement = { x  x ∈ A ∩ B } definition of / ∈ = { x  x ∈ A ∧ x ∈ B } definition of intersection = { x  x ∈ A ∨...
View
Full
Document
This note was uploaded on 01/09/2010 for the course CPSC 121 taught by Professor Belleville during the Spring '08 term at UBC.
 Spring '08
 BELLEVILLE

Click to edit the document details