$$p\rightarrow q$$ $$\neg p$$ $$\overline{\therefore \neg q}$$
We were given a task to prove the validity of this argument (assuming the statement above is the same as: $(p \rightarrow q) \wedge \neg p \Rightarrow \neg q$).
I concluded with the argument to be valid. If $q$ is $0$, then the conclusion is $1$. For $p \rightarrow q$ to be true, then $p$ has to be $0$. Then $\neg p$ is $1$. This makes LHS and RHS to be $1$. Did I understand this correctly, or am I mistaken?