You want to prove that
I would do it by contradiction.
Suppose that .
Then that means that .
From which we get so .
Also we get so .
Do you see the contradiction?
Hello,
This is my first time posting a question on this forum and I am a newbie in the field of discrete mathematics.
I uploaded question number 9a which I've been trying to solve for the last 3 days without much success, as well as my attempt at solving it.
Any suggestions would be welcome!
First of all, let me thank you for your kind help.
If I got your idea right, then since t cannot be both an element of C and an element of the complement of C, we deduce that the opposite is correct concerning the first line. That is, the left side is a subset of the right side.
I was trying to get to having the same expressions on both sides of the equation by using the consistency principle, since that is what is expected from me. Elegant solutions never hurt anyone though.
Thank you once more!
First this is not an equation. Moreover, it turnout to be rather messy to expand the LHS.
I am not sure that is really the best way to proceed. I did not see a way to do it easily.
There is a simple demonstration using Venn diagrams.
To use the pick-a-point proof may be the best alterative to what I posted.
Actually I came to the posted proof as a result of starting out that way.
Expanding the LHS doesn't look so bad. What about the following
(Assuming the convention that binds more strongly than , of course.)
Now we have decomposed the original LHS into a union of three sets, the first is a subset of A (since intersecting A with any other set gives a subset of A), the second is a subset of B (again, because this is an intersection of B with another set) and the third is the empty set. Hence the whole union is contained in the union of A and B.
More formally, this is last step uses the following general rule: If and then . Which is just another way of saying that is a "least upper bound" operator in the boolean lattice of subsets of a given universal set: if Z is an upper bound for both X and Y then it is also an upper bound for .
Similarly, intersection of sets is a "greatest lower bound" operator in that boolean lattice.
I have gotten so much help from this website and the wonderful people here. I can follow Failure's elegant proof. What my professor was looking for from my class was more of a continuation and definition oriented proof.
=
=
= =
= { x | x (A AND B) }
= { x | x A AND x B }
x, x A OR x B which is the definition of a subset.
Failure's proof is much more elegant not to mention shorter. However if you're just beginning with the definitions etc. this may be more what your professor is looking for. I also hope I got it right!
I don't see how you get this from the preceding line, I must admit.
One thing I believe to know for sure: so something is amiss here.
=
=
= { x | x (A AND B) }
= { x | x A AND x B }
x, x A OR x B which is the definition of a subset.
Failure's proof is much more elegant not to mention shorter. However if you're just beginning with the definitions etc. this may be more what your professor is looking for. I also hope I got it right!
I am still learning this and prone to mistakes. Perhaps I misinterpreted C', which I took to be the complement of C.
In that case, C C' would be the null set by the complement law.
Then by the associative propery, (B C') C = B (C' C).
Of course B null = B
And it looks like I made a mistake in the last line. I had mistakenly taken B B first instead of using the absorbtion law.
Thank you again for your expert help! And please continue to critique. It is the best way to learn.