Set Theory - Proving Contrapositive

AI Thread Summary
The discussion revolves around proving the contrapositive of a set theory statement involving subsets. The original statement asserts that if B ∩ C is a subset of A, then (C - A) ∪ (B - A) is empty. Participants struggle with set notation and the correct formulation of the contrapositive, ultimately concluding that the contrapositive is: if (C - A) ∪ (B - A) is not empty, then B ∩ C is not a subset of A. The conversation highlights the importance of correctly identifying the order of statements in contrapositives. Overall, the participants clarify the logical structure necessary for proving the contrapositive in set theory.
rooski
Messages
60
Reaction score
0

Homework Statement



using set theroetic notation, write down and prove the contra-positive of:

GOD WHAT IS WRONG WITH LATEX? It is completely ruining my set notation! And i can't fix it!

If B \cap C \subseteq A Then (C-A) u (B-A) is empty.

The Attempt at a Solution



I'm awful with set notation and finding inverses of things. Here's my guess at what the contra-positive is:

if B \cup C \notin A then ( C - A ) \cup ( B - A ) is empty
 
Last edited:
Physics news on Phys.org
deleted
 
The contrapositive of p→q is (not q)→(not p). Try again.
 
Hmm.

If B \cap C is not a subset of A then (C-A) U (B-A) is not empty

is that the contrapositive?
 
No. Note the order of p and q switch in the contrapositive.

Original statement: If X is a dog, X has four legs.
Contrapositive: If X does not have four legs, X is not a dog.
 
If (C-A) U (B-A) is not empty then B \cap C is not a subset of A.

I think that's right. unless i did something wrong with inverting the logical statements.
 
That's correct.
 
Back
Top