Let A and B be sets. Show that
there is a simple methodology to showing things about sets, ill show you how to do the second one,
let x \in A, we need to show , by the definition of union, all elements in A must be in .
well maybe that one was the wrong one to werk, since it was rather easy... :P
if you want to prove something weth sets, the general procedure is to examine each element in the sets, so what can you say about an element in the difference of (B-A) (recall the definition of difference being, all elements in B that are NOT elements in A)
Hello, Discrete!
The second one can be proved with various set theorems.
I don't know the names that you've been taught,
. . so I'll let you supply some of the reasons.
Let A and B be sets. Show that:
We have: . . . . . definition of set subtraction
. . . . . . . . . . associative and commutative properties of intersection
. . . . . .
. . . . . .