]> matita.cs.unibo.it Git - helm.git/blob - matita/matita/help/C/html/tac_weproceedbyinduction.html
Install into doc the PDF and HTML manuals
[helm.git] / matita / matita / help / C / html / tac_weproceedbyinduction.html
1 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
2 <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>we proceed by induction on</title><link rel="stylesheet" type="text/css" href="docbook.css" /><meta name="generator" content="DocBook XSL Stylesheets Vsnapshot" /><link rel="home" href="index.html" title="Matita V0.99.5 User Manual (rev. 0.99.5 )" /><link rel="up" href="sec_declarative_tactics.html" title="Chapter 8. Declarative Tactics" /><link rel="prev" href="tac_andelim.html" title="we have" /><link rel="next" href="tac_weproceedbycases.html" title="we proceed by cases on" /></head><body><a xmlns="" href="../../../"><div class="matita_logo"><img src="figures/matita.png" alt="Tiny Matita logo" /><span>Matita Home</span></div></a><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">we proceed by induction on</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="tac_andelim.html">Prev</a> </td><th width="60%" align="center">Chapter 8. Declarative Tactics</th><td width="20%" align="right"> <a accesskey="n" href="tac_weproceedbycases.html">Next</a></td></tr></table><hr /></div><div class="sect1"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="tac_weproceedbyinduction"></a>we proceed by induction on</h2></div></div></div><p><strong class="userinput"><code>we proceed by induction on t to prove P</code></strong></p><p>
3       </p><div class="variablelist"><dl class="variablelist"><dt><span class="term">Synopsis:</span></dt><dd><p><span class="bold"><strong>we proceed by induction on</strong></span> <span class="emphasis"><em><a class="link" href="sec_terms.html#grammar.term">term</a></em></span> <span class="bold"><strong> to prove </strong></span> <span class="emphasis"><em><a class="link" href="sec_terms.html#grammar.term">term</a></em></span> </p></dd><dt><span class="term">Pre-condition:</span></dt><dd><p>The type of <span class="command"><strong>t</strong></span> must be an inductive type and <span class="command"><strong>P</strong></span> must be identical to the current conclusion.
4         </p></dd><dt><span class="term">Action:</span></dt><dd><p>It applies the induction principle on <span class="command"><strong>t</strong></span> to prove <span class="command"><strong>P</strong></span>.</p></dd><dt><span class="term">New sequents to prove:</span></dt><dd><p>It opens a new sequent for each constructor of the type of <span class="command"><strong>t</strong></span>, each with the conclusion <span class="command"><strong>P</strong></span> instantiated for the constructor. For the inductive constructors (i.e. if the inductive type is <span class="command"><strong>T</strong></span>, constructors with an argument of type <span class="command"><strong>T</strong></span>), the conclusion is a logical implication, where the antecedent is the inductive hypothesis for the constructor, and the consequent is <span class="command"><strong>P</strong></span>.</p></dd></dl></div><p>
5     </p></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="tac_andelim.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="sec_declarative_tactics.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="tac_weproceedbycases.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">we have </td><td width="20%" align="center"><a accesskey="h" href="index.html">Home</a></td><td width="40%" align="right" valign="top"> we proceed by cases on</td></tr></table></div></body></html>