Subset

${\displaystyle A\subseteq B}$

• ${\displaystyle \{x\mid x\in A{\hbox{ then }}x\in B\}}$

Subset means for all x, if x is in A then x is also in B.

Proper Subset

${\displaystyle A\subset B}$

• ${\displaystyle \{x\mid x\in A{\hbox{ then }}x\in B{\hbox{ and }}A\neq B\}}$

Union

${\displaystyle \bigcup A}$

• ${\displaystyle \{x\mid x\in \bigcup A{\hbox{ iff }}y\in A{\hbox{ s.t. }}x\in y\}}$

${\displaystyle A\cup B}$

• ${\displaystyle \{x\mid x\in A{\hbox{ or }}x\in B\}}$

Intersection

${\displaystyle \bigcap A}$

• ${\displaystyle \{x\mid {\hbox{for all }}a\in A,x\in a\}}$

${\displaystyle A\cap B}$

• ${\displaystyle \{x\mid x\in A{\hbox{ and }}x\in B\}}$

Empty Set

${\displaystyle \emptyset }$

• ${\displaystyle {\hbox{There is a set }}A{\hbox{ s.t. }}\{x\mid x\notin A\}}$

Minus

${\displaystyle A-B}$

• ${\displaystyle \{x\mid x\in A{\hbox{ and }}x\notin B\}}$

Powerset

${\displaystyle {\mathcal {P}}(A)}$

• ${\displaystyle \{x\mid x\subseteq A\}}$

Ordered Pair

${\displaystyle \langle a,b\rangle }$

• ${\displaystyle \{\{a\},\{a,b\}\}}$

Cartesian Product

${\displaystyle A\times B}$

• ${\displaystyle A\times B=\{x\mid x=\langle a,b\rangle {\hbox{ for some }}a\in A{\hbox{ and some }}b\in B\}}$

or

• ${\displaystyle \{\langle a,b\rangle \mid a\in A{\hbox{ and }}b\in B\}}$

Relation

A set of ordered pairs

Equivalence Relations

• Reflexive: A binary relation R on A is reflexive iff for all a in A, <a, a> in R
• Symmetric: A rel R is symmetric iff for all a, b if <a, b> in R then <b, a> R
• Transitive: A relation R is transitive iff for all a, b, and c if <a, b> in R and <b, c> in R then <a, c> in R

Partial Ordering

• Transitive and,
• Irreflexive: for all a, <a, a> not in R

If, then

Prove if x then y

Suppose x

...

...

so, y

If and only If

Prove x iff y

suppose x

...

...

so, y

suppose y

...

...

so, x

Equality

Prove x = y

show x subset y

and

show y subset x

Non-Equality

Prove x != y

x = {has p}

y = {has p}

a in x, but a not in y