Exportation (logic)

Transformation rules
Propositional calculus
Rules of inference
Implication introduction / elimination (modus ponens) Biconditional introduction / elimination Conjunction introduction / elimination Disjunction introduction / elimination Disjunctive / hypothetical syllogism Constructive / destructive dilemma Absorption / modus tollens / modus ponendo tollens
Rules of replacement
Associativity Commutativity Distributivity Double negation De Morgan's laws Transposition Material implication Exportation Tautology Negation introduction
Predicate logic
Universal generalization / instantiation Existential generalization / instantiation

Exportation is a valid rule of replacement in propositional logic. The rule allows conditional statements having conjunctive antecedents to be replaced by statements having conditional consequents and vice versa in logical proofs. It is the rule that:

$((P\land Q)\to R)\Leftrightarrow (P\to (Q\to R))$

Where "$\Leftrightarrow$" is a metalogical symbol representing "can be replaced in a proof with."

Formal notation

The exportation rule may be written in sequent notation:

$((P\land Q)\to R)\dashv \vdash (P\to (Q\to R))$

where $\dashv \vdash$ is a metalogical symbol meaning that $(P\to (Q\to R))$ is a syntactic equivalent of $((P\land Q)\to R)$ in some logical system;

or in rule form:

${\frac {(P\land Q)\to R}{P\to (Q\to R)}}$, ${\frac {P\to (Q\to R)}{(P\land Q)\to R}}.$

where the rule is that wherever an instance of "$(P\land Q)\to R$" appears on a line of a proof, it can be replaced with "$P\to (Q\to R)$" and vice versa;

or as the statement of a truth-functional tautology or theorem of propositional logic:

$((P\land Q)\to R)\leftrightarrow (P\to (Q\to R))$

where $P$, $Q$, and $R$ are propositions expressed in some logical system.

Natural language

Truth values

At any time, if P→Q is true, it can be replaced by P→(P∧Q).
One possible case for P→Q is for P to be true and Q to be true; thus P∧Q is also true, and P→(P∧Q) is true.
Another possible case sets P as false and Q as true. Thus, P∧Q is false and P→(P∧Q) is false; false→false is true.
The last case occurs when both P and Q are false. Thus, P∧Q is false and P→(P∧Q) is true.

Example

It rains and the sun shines implies that there is a rainbow.
Thus, if it rains, then the sun shines implies that there is a rainbow.

Proof

The following proof uses Material Implication, double negation, De Morgan's Laws, the negation of the conditional statement, the Associative Property of conjunction, the negation of another conditional statement, and double negation again, in that order to derive the result.

Proposition	Derivation
$P\rightarrow (Q\rightarrow R)$	Given
$\neg P\lor (Q\rightarrow R)$	Material implication
$\neg P\lor (\neg Q\lor R)$	Material implication
$(\neg P\lor \neg Q)\lor R$	Associativity
$\neg (P\land Q)\lor R$	De Morgan's law
$(P\land Q)\rightarrow R$	Material implication

Relation to functions

Exportation is associated with Currying via the Curry–Howard correspondence.