Click and drag the given steps to their corresponding step number to prove (A - C) ∩ (C - B) = 0. 

Transcribed Image Text:

Step 1 Suppose that x € (A - C) n (C- B). Then x € (A - C) and x € (C- B) Step 2 Then x € (A - C) and x € (C- B) Step 3 The first of these statements implies by definition that x € C, while the second implies that x € C. Step 4 This is contradiction. Hence the interaction of (A - C) and (C- B) is the empty set. The first of these statements implies by definition that x ¢ C, while the second implies that x E C. Step 1 Suppose that x € (A - C) n (C- B). Then x € (A - C) and x € (C- B) Step 2 Then x € (A - C) and x € (C- B) Step 3 The first of these statements implies by definition that x € C, while the second implies that x € C. Step 4 This is contradiction. Hence the interaction of (A - C) and (C- B) is the empty set. The first of these statements implies by definition that x ¢ C, while the second implies that x E C.