I am trying to show that $\neg (A \land B)$ implies $\neg A \lor \neg B$ in Intuitionistic Propositional Calculus (IPC) with the added inference rule of ''Weak excluded middle," which is that you can invoke $\neg \neg P \lor \neg P$.
My idea is to assume assume $\neg \neg A \lor \neg A$. If $\neg A$, the result follows. So we have to deal with $\neg \neg A$. So assume either $\neg \neg B \lor \neg B$. If $\neg B$, the result follows. So we have $\neg \neg A \land \neg \neg B$. Assumedly, one can prove $\neg (\neg A \lor \neg B)$ from this, and then finish the proof. But I am stuck on that last step of showing $\neg \neg A \land \neg \neg B \Rightarrow \neg (\neg A \lor \neg B)$. I know this follows from the truth tables, but I am trying to do this just using the inference rules of the system I'm working in.
