<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Implicational propositional calculus - Page 12 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Implicational_propositional_calculus&amp;p=11">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Implicational_propositional_calculus&amp;p=13">3.Next</a>
</p>
<p>by the induction hypothesis, hence we can infer  This completes the proof of .Now let F be a tautology in variables p<sub>1</sub>, ..., p<sub>n</sub>. We will prove by reverse induction on k = n,...,0 that for every assignment e,The base case k = n follows from a special case of  using<br/>
:and the fact that F->F is a theorem by the deduction theorem.</p>

<p>Assume that  holds for k + 1, we will show it for k. By applying deduction theorem to the induction hypothesis, we obtain<br/>
:by first setting e(p<sub>k+1</sub>) = 0 and second setting</p><p>
<a accesskey="1" href="page.php?w=Implicational_propositional_calculus&amp;p=11">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Implicational_propositional_calculus&amp;p=13">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
