Ask a New Question
Menu

#2: Use a proof by contradiction to prove:

For all sets A, B, C, D if A intersection C= { },
then (A x B) intersection (C x D) = { }.

This is my proof so far, but I don't know how to solve it fully.

Assume that (A x B) ⋂ (C x D) = { }. Then (m, n) ∈ (A x B) ⋂ (C x D). This means that (m, n) ∈ (A x B) and (m, n) ∈ (C x D). Thus, m∈A and n∈B. Also, m∈C and n∈D. Thus, m∈A and m∈C. Therefore, m ∈ (A⋂C) ... contradiction ... (A x B) ⋂ (C x D) = { } is false.
Therefore, (A x B) ⋂ (C x D) = { } is true.

Similar Questions
  1. #2: Use a proof by contradiction to prove:For all sets A, B, C, D if A intersection C= { }, then (A x B) intersection (C x D) =
    1. answers icon 0 answers
  2. #2: Use a proof by contradiction to prove:For all sets A, B, C, D if A intersection C= { }, then (A x B) intersection (C x D) =
    1. answers icon 0 answers
  3. prove that if n is an integer and 3n+2 is even, then n is even usinga)a proof by contraposition b)a proof by contradiction I'll
    1. answers icon 0 answers
  4. Show that the equation x^4 + 4x + c = 0 has at most two real roots.I believe we're supposed to prove this by proof of
    1. answers icon 0 answers
more similar questions