Isaac12
- 1
- 0
I need some help on understanding the proof of De Morgan's Law.
(A intersection B)' = A' U B'
I know that it is proof is along the lines of
Let x be in (A intersection B)'.
Then x is NOT in A intersection B
<=> x not in A AND x not in B (use logical connectors, negations, etc)
<=> x in A' OR x in B'
<=> x in A' U B'
but my question is how does the AND become an OR?
(A intersection B)' = A' U B'
I know that it is proof is along the lines of
Let x be in (A intersection B)'.
Then x is NOT in A intersection B
<=> x not in A AND x not in B (use logical connectors, negations, etc)
<=> x in A' OR x in B'
<=> x in A' U B'
but my question is how does the AND become an OR?