# Law of Excluded Middle in Logic Proof

I'm having some difficulty doing a proof for the following:

$$\neg A \vee \neg(\neg B \wedge (\neg A \vee B))$$

It is said that you could use the law of excluded middles.

Any help or guidance would be appreciated. Thanks in advance!

-
Are you just trying to simplify the expression given? Otherwise, I don't see what to prove. – yunone Apr 2 '11 at 0:05
@yunone: I think you have to prove that the expression is a tautology. – alejopelaez Apr 2 '11 at 0:09
I think you can just apply De Morgan's laws and the distributive laws, and arrive at a tautology of the form $A \vee \sim A$ – alejopelaez Apr 2 '11 at 0:10
@Pel, ah ok, thanks for the explanation. – yunone Apr 2 '11 at 0:14

as required.

-