Given there are 2 logical variables $p$, $q$ . Show that $\neg(p \Longleftrightarrow q)$ and $p \Longleftrightarrow \neg q$ are logically equivalent without using the truth table.
And here is my steps: $(p \land q) \lor (\neg p \land \neg q)$
I get this). What should I do in order to get rid of it? ps: I am studing from Discrete mathematics and its application 7th edition rosen thanks