Let A, B and C be sets. Prove that

  • Thread starter Thread starter iHeartof12
  • Start date Start date
  • Tags Tags
    Sets
iHeartof12
Messages
24
Reaction score
0
*Sorry wrong section*
Let A, B and C be sets.
Prove that if A\subseteqB\cupC and A\capB=∅, then A\subseteqC.

My attempted solution:
Assume A\subseteqB\cupC and A\capB=∅.
Then \veex (x\inA\rightarrowx\inB\cupx\inc).

I'm not sure where to start and how to prove this. Any help would be greatly appreciated. Thank you.
 
Last edited:
Physics news on Phys.org
you almost have it.

for all x in A and A is a subset of B U C then x is in B U C
if x is in B U C then x is in B or x is in C

now just describe x with respect to the A \bigcap B = ∅
 
Another perspective: you can maybe rigorize it by saying:

a in B or a in C , but a not in B , so we must have a in C:

Basically, as you rightly concluded, a must be in one

of B or C, but ,by assumption/construction, a is not in B,

so a must be in C.
 
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

Back
Top