Boolean Algebra - simplifing

[Jeorne]

I'm having problems simplifying this boolean logic using the basic laws and theorems with proof.
AB'(C+D)+(C+D)'

The answer should be AB' + C'D', but how is this result reached? Can someone show me the steps and alegebraic theorems used.

All I have is

AB'C + AB'D + C'D'[/code]

 

[amraldo]

That's how I c it
AB'(C+D)+(C+D)'
if (C+D) = 1, then the result is AB'
if (C+D) = 0, then the result is (C+D)'=C'D'

The equation can be rewritten as AB' + C'D'

It is a logical proof rather than a mathematical one.

--
Amr Ali

 

[_Eduardo_]

Using the simplification rule xy'+y = x+y
**broken link removed**

Then (AB')(C+D) + (C+D)' = (AB') + (C+D)' = AB' + C'D'