I'm having a lot of trouble trying to solve this. Any help would be greatly appreciated, I just can't seem to go any further!
"Give syntactic proofs for the following sequent using only propositional logic rules."
And the proof to prove is:
$$ p \land \neg q \rightarrow \neg p \vdash p \rightarrow q $$
I tried to assume p ( to use the -> introduction rule) and then use the MT to get $$ \neg (p \land \neg q) $$ but I get into this loop of introducing negations and trying to solve bottom!!