Negate the following statements formally so that **no negation symbol remains:** Negate the following statements formally so that no negation symbol remains: 
(i)  $ \ \ \forall y \exists x (y>0 \to x \leq 0 ) \ $
(ii) $ \ \forall x \forall y \exists z(x <z \leq y ) \ $
Answer:
My approach is as follows:
(i)
The negation of the statements in (i) without negation symbol is 
$ \exists y  \ \ s.t. \ \  \forall x (x>0  \to y \leq  0) \ $ 
(ii) 
Given 
$ \forall x \forall y \ \exists z \ ( x <z  \leq y ) \  \\\sim \forall x \forall y \ \exists z \ ( x <z  \wedge z \leq y ) $ 
The negation is given as  
$ \exists x \exists y \ \ s.t. \ \ \forall z  \ ( x \geq z \wedge  z > y ) $ 
Am I true ?
Is there any help ?

You did a lot of work correctly, but in the end both of your answers are incorrect.
For (i) you seem to think that the negation of a conditional $P \rightarrow Q$ is $\neg Q \rightarrow \neg P$, but that is not true. The negation of $P \rightarrow Q$ is $P \land \neg Q$
For (ii), you need to change the $\land $ in your final answer to $\lor$, since the negation of $P \land Q$ is $\neg P \lor \neg Q$
