Fitch-Style Proof Hi I'm having trouble solving a Fitch Style Proof and I was hoping someone would be able to help me.
Premises:

$A \land (B \lor C)$
  $B \to D$
  $C \to E$

Goal: $\neg E \to D$
Thank You

Do a proof by contradiction. Assume $\neg E \wedge \neg D$. Then we have from $A \wedge (B \vee C)$ that $B \vee C$. If $B$, then $D$, which contradicts $\neg D$. If $C$ then $E$ which contradicts $\neg E$.
