Hello,

I have the following First order Logic statement:

If F(x) is not true then no H(y,x) satisfiesG(x)

(∀x ¬F(x)) ⇒¬∃y G(y) ˄ H(y,x)

I have to change this to get:

(∃y G(y) ˄ H(y,x))) ⇒ ((∀x F(x))

Is this possible? I can possibly modify the first statement so as to prove the latter. What would be a way to do this while staying within the domain of the Logic Statement given above.