aboutsummaryrefslogtreecommitdiffhomepage
path: root/doc/Tutorial.tex
diff options
context:
space:
mode:
authorGravatar filliatr <filliatr@85f007b7-540e-0410-9357-904b9bb8a0f7>2000-12-15 10:28:24 +0000
committerGravatar filliatr <filliatr@85f007b7-540e-0410-9357-904b9bb8a0f7>2000-12-15 10:28:24 +0000
commitf31b0c54021eaf4776bf33cba0451b2b2500fb9b (patch)
tree2e6815ea82024d0ad5ac2f076ed28d93d53a3a75 /doc/Tutorial.tex
parent2ccb521cf21c1db3d3c49cc547cb446f54f49dd6 (diff)
un Reset Initial dans Tutorial.tex
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@8147 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'doc/Tutorial.tex')
-rwxr-xr-xdoc/Tutorial.tex3
1 files changed, 3 insertions, 0 deletions
diff --git a/doc/Tutorial.tex b/doc/Tutorial.tex
index d554675f1..477dc9ac4 100755
--- a/doc/Tutorial.tex
+++ b/doc/Tutorial.tex
@@ -1249,6 +1249,9 @@ Reset bool.
\subsection{Simple proofs by induction}
%CP Pourquoi ne pas commencer par des preuves d'egalite entre termes
% convertibles.
+\begin{coq_eval}
+Reset Initial.
+\end{coq_eval}
Let us now show how to do proofs by structural induction. We start with easy
properties of the \verb:plus: function we just defined. Let us first