CSE 215 Lecture 19: Set Theory
Document Summary
Let s be a set ( a collection of elements with no duplicates) Here, both a and b could be equal, meaning it is the same set. A s means that a is an element of s. A s means that a is not an element of s. A = {x s | p(x)} is the set of all elements of x of s such that p(x). A b forall x, if x a then x b. A b thereexists x such that x a and x b. A is a proper subset of b (a b) {1} {1, {1}} this is equal since both sets contain 1. {1} {1, {1}} this is also true since the set on the right contains a subset within a set of. There is at least one element in b that is not in a.