Proving Equality of Sets - A Quick Question

[jgens]

I just have a very quick (and simple) question: When trying to prove equalities like A \cup (B \cup C) = (A \cup B) \cup C, is it sufficient to note that both sets consist of all elements x such that x \in A, x \in B or x \in C? Or do I need to go through proving that each set is a subset of the other and consequently deduce that the two sets are equal?

I already know that the second procedure works and although the first one seems make intuitive sense, I'm concerned that it isn't considered sufficient or formal. I would appreciate any feedback. Thanks!

 

[Apteronotus]

I would definitely go about it the second way; ie. show that each set is a subset of the other.

 

[alyks]

Yes. I would first assume that x is an element of the left hand side and do a prove by cases, then do the same assuming x is an element of the right hand side.

 

[jgens]

Alright, that's what I've been doing. Thanks for the feedback.

 

[Fredrik]

Since two sets are equal if and only if they have the same members, the first method is equally valid. But when you consider more difficult problems, it's going to be much more difficult to explicitly write down a set of conditions on x that are satisfied if and only if x is a member of the set on the left (or the set on the right).

 

[Landau]

The key here is to notice that this is just the 'set-theoretic translation' of the corresponding (obvious) fact from logic:
P\vee(Q\vee R)\equiv(P\vee Q)\vee R.

So my preferred proof would be:

x\in A\ \cup \ (B\ \cup \ C)\Leftrightarrow (x\in A)\ \vee \ (x\in B\ \vee \ x\in C)\Leftrightarrow(x\in A\ \cup \ B)\ \vee \ (x\in C)\Leftrightarrow x\in (A\ \cup \ B)\ \cup \ C.