3
$\begingroup$

Just starting to learn proofs and could use some feedback:

Statement: Let A, B, and C be nonempty sets. If $A-B \subseteq C$ and $A \not \subseteq C,$ then $A \cap B \not = \emptyset$.

Proof: Since $A \not \subseteq C$, there exists an $x \in A$ such that $x \not \in C.$

Since $x \not \in C$ and $A - B \subseteq C$, $x \not \in A - B$. Since $x \in A$ and $x \not \in A - B$, $x \in B$.

Hence $x \in A \cap B$. That is, $A \cap B \not = \emptyset.$

Thank you.

Idle Math Guy

$\endgroup$
5
  • 2
    $\begingroup$ looks good to me $\endgroup$
    – Andreas Blass
    Sep 29, 2016 at 18:44
  • 3
    $\begingroup$ It's OK, but it much simpler to use the contradiction: if $A\cap B=\varnothing$ then $A-B=A$, and immediate contradiction. $\endgroup$
    – Canis Lupus
    Sep 29, 2016 at 18:48
  • 1
    $\begingroup$ It's important to note that $-$ is the complement, and does not refer to the Minkowski difference. $\endgroup$
    – LinAlg
    Sep 29, 2016 at 18:58
  • 1
    $\begingroup$ A - B is set difference. i.e. All the elements in the set A that are not in the set B. ${ x | (x \in A) \land (x \not \in B)}$. $\endgroup$
    – Idle Fool
    Sep 29, 2016 at 19:42
  • $\begingroup$ @Idle Math Guy:Was your original question answered? If so, please, provide an answer and so mark your question as settled. $\endgroup$
    – Moritz
    Oct 1, 2016 at 15:32

1 Answer 1

Reset to default
0
$\begingroup$

Proof is a valid proof. I do like the contradiction route that Corvus used...I think it is more concise.

$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .