Steps for Solving Symbolic Logic Proofs

[sugars225]

Can someone help with this proof:

G→(PVE), P→N, E→C, -(NVC) ㅏ-G

This is what I have done so far
1 (1) G→(PVE) Assumption
2 (2) P→N Assumption
3 (3) E→C Assumption
4 (4) -(NVC) Assumption

what do I do if here?

 

[JonF]

Start by using De Morgan’s Law on -(NVC).

Hint you’re also going to have to use:

The idempotent property (or reduction or elimination, there’s a lot of names for it) of “and”
Modus Tollens
De Morgan's Law again.

 

[yossell]

What system have you been given to work in? Natural deduction? if so, what rules? Truth-tables? Or something else?