In propositional logic, biconditional introduction is a valid rule of inference. It allows for one to infer a biconditional from two conditional statements. The rule makes it possible to introduce a biconditional statement into a logical proof. If
P
→
Q
is true, and if
Q
→
P
is true, then one may infer that
P
↔
Q
is true. For example, from the statements "if I'm breathing, then I'm alive" and "if I'm alive, then I'm breathing", it can be inferred that "I'm breathing if and only if I'm alive". Biconditional introduction is the converse of biconditional elimination. The rule can be stated formally as:
P
→
Q
,
Q
→
P
∴
P
↔
Q
where the rule is that wherever instances of "
P
→
Q
" and "
Q
→
P
" appear on lines of a proof, "
P
↔
Q
" can validly be placed on a subsequent line.
The biconditional introduction rule may be written in sequent notation:
(
P
→
Q
)
,
(
Q
→
P
)
⊢
(
P
↔
Q
)
where
⊢
is a metalogical symbol meaning that
P
↔
Q
is a syntactic consequence when
P
→
Q
and
Q
→
P
are both in a proof;
or as the statement of a truth-functional tautology or theorem of propositional logic:
(
(
P
→
Q
)
∧
(
Q
→
P
)
)
→
(
P
↔
Q
)
where
P
, and
Q
are propositions expressed in some formal system.
