Thus, the goal of a conditional proof is to demonstrate that if the CPA were true, then the desired conclusion necessarily follows.
Conditional proofs are of great importance in mathematics.
A famous network of conditional proofs is the NP-complete class of complexity theory.
Similarly, the Riemann hypothesis has many consequences already proven.
As an example of a conditional proof in symbolic logic, suppose we want to prove A → C (if A, then C) from the first two premises below: