Thread: Proof By Contradiction

Hello,

Can someone please help me with this proof?

(A-C)∩(C-B) = 0.

Do I start off by....

suppose: ~[(A-C)∩(C-B) = 0.] ?

Also, does this (0 ∩ B') equal the empty set?

Thanks...

PS. ' indicates the complement.

Why not start by the mere definition? Suppose ...from here the way to get a contradiction is straightforward and thus no such element can exist...

Tonio

Thats exactly what I did, i'm not sure if I did it correctly though.

This is what I got :

(A ∩ 0) ∩ B'

(0 ∩ B')

0

is that correct?

Originally Posted by l flipboi l

Thats exactly what I did, i'm not sure if I did it correctly though.

This is what I got :

(A ∩ 0) ∩ B'

(0 ∩ B')

0

is that correct?

I've no idea what you had in mind, even assuming that ...how did you come up with the above? Besides this, for any set X, so from

the first line you get the empty set...

Tonio

Originally Posted by tonio

I've no idea what you had in mind, even assuming that ...how did you come up with the above? Besides this, for any set X, so from

the first line you get the empty set...

Tonio

I excluded alot of the work, but I used the commutative and associative property to get c and c' to cancel out.

which brought me to my answer

Originally Posted by l flipboi l

I excluded alot of the work, but I used the commutative and associative property to get c and c' to cancel out.

which brought me to my answer

Good, but then why did you say you "did exactly the same" as I did?!!

Tonio

Thanks for the help! I meant, I set it up like how you did.