Let A and B be sets. Show that

Printable View

- June 24th 2007, 01:05 PMDiscreteset problems
Let A and B be sets. Show that

- June 24th 2007, 01:51 PMIlaggoodly
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 - June 24th 2007, 01:53 PMDiscrete
that's an easy way to proof it, is there any way that you can show me?

- June 24th 2007, 02:18 PMIlaggoodly
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)

- June 24th 2007, 02:37 PMPlato
Do you know that if

*P*is true then*PvQ*is also true for**any**?*Q*

If so, then must be a true statement. Thus that proves that . - June 24th 2007, 02:48 PMSoroban
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.

Quote:

Let A and B be sets. Show that:

We have: . . . . . definition of set subtraction

. . . . . . . . . . associative and commutative properties of intersection

. . . . . .

. . . . . .

- June 24th 2007, 09:31 PMTheRekz
is there any way to change the subset operator into a union or intersection logical operator, to prove part a??

- June 25th 2007, 03:53 AMPlato