Direct proof

In mathematics and logic, a direct proof is a way of showing the truth or falsehood of a given statement by a straightforward combination of established facts, usually existing lemmas and theorems, without making any further assumptions. In order to directly prove a conditional statement of the form "If p, then q", it suffices to consider the situations in which the statement p is true. Logical deduction is employed to reason from assumptions to conclusion. The type of logic employed is almost invariably firstorder logic, employing the quantifiers for all and there exists. Common proof rules used are modus ponens and universal instantiation.
In contrast, an indirect proof may begin with certain hypothetical scenarios and then proceed to eliminate the uncertainties in each of these scenarios until an inescapable conclusion is forced. For example instead of showing directly p ⇒ q, one proves its contrapositive ~q ⇒ ~p (one assumes ~q and shows that it leads to ~p). Since p ⇒ q and ~q ⇒ ~p are equivalent by the principle of transposition (see law of excluded middle), p ⇒ q is indirectly proved. Proof methods that are not direct include proof by contradiction. Direct proof methods include proof by exhaustion, proof by infinite descent, and proof by induction.
Example
What follows is a simple, direct proof that the sum of two even integers is itself an even number.
Consider two even integers x and y. Since they are even, they can be written as x=2a and y=2b respectively for integers a and b. Then the sum x + y = 2a + 2b = 2(a + b). From this it is clear x+y has 2 as a factor and therefore is even, so the sum of any two even integers is even.
References
 Franklin, J.; A. Daoud (2011). Proof in Mathematics: An Introduction. Sydney: Kew Books. ISBN 0646545094. http://www.maths.unsw.edu.au/~jim/proofs.html. (Ch. 1.)
This logicrelated article is a stub. You can help Wikipedia by expanding it.