Principle of Dilemma/Formulation 1/Reverse Implication

Theorem

 * $q \vdash \left({p \implies q}\right) \land \left({\neg p \implies q}\right)$

Proof

 * align="right" | 2 ||
 * align="right" | 1
 * $p \implies q$
 * SI
 * 1
 * True Statement is Implied by Every Statement
 * align="right" | 3 ||
 * align="right" | 1
 * $\neg p \implies q$
 * SI
 * 1
 * True Statement is Implied by Every Statement
 * 1
 * True Statement is Implied by Every Statement