As the title says, is this true?
$$(\lnot P \to \lnot Q) \to (P \to Q)$$
The truth table is
\begin{array}{rrrrrr} P & Q & \lnot P & \lnot Q & \lnot P \to \lnot Q & P \to Q & (\lnot P \to \lnot Q) \to (P \to Q) \\ \hline T & T & F & F & T & T & T \\ T & F & F & T & T & F & F \\ F & T & T & F & F & T & T \\ F & F & T & T & T & T & T \\ \end{array}
It seems like it's true from the table.
If it is true, is it true because $$(\lnot P \to \lnot Q) \to (P \to Q)$$ has the same truth table corresponding to the $\to$ connective which is false only when the antecedent is T but the consequent is F?
Or is it true because the statement is true when the premises of $\lnot P \to \lnot Q$ and $P \to Q$ are true?
If it's not true, why not?