Hello,
I'm having difficulties with proving the following:
A \ (B\C) = (A\B) UNION (A INTERSECTION C)
I know it's correct, I can draw Venn diagrams that show it, but have no idea how to proof it using words (or other statements).
Any help will be appreciated.
Thanks!
The concept is very clear to me, though only because I know negation from other study fields. In the course I'm undertaking now we did not study anything relating to negation of sets thus I'm afraid I cannot use it in profing the statement above (I know... University rules).
Is there any other way to proof it without negation? I do not need nor want a complete solution, just how to start.
Thank you very much for your respond.
Trust me, I had a week long argue over this with my professor, mainly because I'm a long time computer programmer but they don't let us use any previous knowledge to solve basic tasks resulting in a lower-standards solutions.
This approach is what I was looking for, thanks a lot Plato. You've been a big help.