I'm very new to natural deduction and have been stuck trying to prove this argument all day:
$A\to ¬B,$
$¬B\to ¬C,$
Therefore, $C\to ¬A$.
I've been told I need to use modus tollens on the first premise, but I am not sure what to use it on/what to assume, as I thought using modus tollens on premise 1 would yield $B$, which I don't need, instead of $\lnot A.$
Thank you.
Assuming the availability of Modus Tollens rule, we have :
1) $A \to \lnot B$ --- premise
2) $\lnot B \to \lnot C$ --- premise
3) $C$ --- assumed [a]
4) $\lnot C$ --- assumed [b]
5) $\lnot \lnot C$ --- from 3) and 4) by $\lnot$elim followed by $\lnot$-intro (also called Double Negation introduction), discharging [b]
6) $\lnot \lnot B$ --- from 5) and 2) by MT
7) $\lnot A$ --- from 6) and 1) by MT
Note : without MT the proof is quite simple :
1) $A \to \lnot B$ --- premise
2) $\lnot B \to \lnot C$ --- premise
3) $C$ --- assumed [a]
4) $A$ --- assumed [b]
5) $\lnot B$ --- from 4) and 1) by $\to$-elim
6) $\lnot C$ --- from 5) and 2) by $\to$-elim
7) $\lnot A$ --- from 4) with 3) and 6) by $\lnot$-elim followed by $\lnot$-intro, discharging [b]