It seems you want to prove that $\neg A \to (A \to B)$. In words: If proposition $A$ is false, then it must be true that $A\to B$ for any logical proposition $B$, be it true or false.
It can be proven with a truth table or with a formal proof.
Truth table for $\neg A \to (A \to B)$

Proof Table of $A\to B$
Another way to look at it...

Note that when the antecedent $A$ is false (lines 3-4), the implication $A\to B$ is true regardless of the truth value of the consequent $B$.
Formal Proof of $\neg A \to (A \to B)$
(1) $\neg A~~~$ (Assume)
(2) $A~~~$ (Assume)
(3) $\neg B~~~$ (Assume)
(4) $\neg A \land A~~~$ (Join 1, 3)
(5) $\neg \neg B~~~$ (Discharge 3, 4)
(6) $B~~~$ (Eliminate '$\neg \neg$' 5)
(7) $A \to B~~~$ (Discharge 2, 6)
(8) $\neg A \to (A \to B)~~~$ (Discharge 1, 7)
This form of argument is rarely if ever used in daily life since we seldom give much consideration to the implications of a proposition that is known to be false. It is, however, often used in very technical arguments, e.g mathematical proofs (the so-called principle of vacuous truth).