Question about proof of associative law for sets

pamparana
Messages
123
Reaction score
0
Hello,

Trying to go through Tom Apostle text on Calculus. There is an exercise about proving the associative law for sets:

So, (A U B) U C = A U (B U C)

So, if we assume x to be an element in set in left hand side, than we can say x belongs at least to either A, B or C which in turn means that x is also an element in set in right hand side and then we can say that the LHS and RHS are subsets of each other...

Is this a valid proof? I am never sure with these. It is really tricky to prove such ideas that we take for granted in every day life!

Anyway, I would be really grateful for any help you can give this old man.

/Luca
 
Physics news on Phys.org
Hi pamparana,

What it comes down to is that "or" (http://en.wikipedia.org/wiki/Logical_disjunction" for
((p or q) or r)
and
(p or (q or r))
are the same.
 
Last edited by a moderator:
pamparana said:
Hello,

Trying to go through Tom Apostle text on Calculus. There is an exercise about proving the associative law for sets:

So, (A U B) U C = A U (B U C)

So, if we assume x to be an element in set in left hand side, than we can say x belongs at least to either A, B or C which in turn means that x is also an element in set in right hand side and then we can say that the LHS and RHS are subsets of each other...

Is this a valid proof? I am never sure with these. It is really tricky to prove such ideas that we take for granted in every day life!

Anyway, I would be really grateful for any help you can give this old man.

/Luca

You are essentially correct. (The other post is correct too, but is really a round-a-bout way to assume exactly what you want to prove). You might see the proof of your statement organized formally this way.

<br /> \begin{align*}<br /> x \in (A \cup B) \cup C &amp; \leftrightarrow x \in (A \cup B) \text{ or } x \in C \\<br /> &amp; \leftrightarrow x \in A \text{ or } x \in B \text{ or } x \in C \\<br /> &amp; \leftrightarrow x \in A \text{ or } x \in (B \cup C) \\<br /> &amp; \leftrightarrow x \in A \cup (B \cup C)<br /> \end{align*}<br />

I've use \leftrightarrow to represent the phrase "if and only if" (I couldn't get the usual double arrow to work, sorry).
Hope this helps.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Replies
18
Views
2K
Replies
3
Views
2K
Replies
1
Views
1K
Replies
5
Views
2K
Replies
13
Views
1K
Replies
5
Views
2K
Back
Top