diff options
| author | filliatr | 2000-12-15 10:28:24 +0000 |
|---|---|---|
| committer | filliatr | 2000-12-15 10:28:24 +0000 |
| commit | f31b0c54021eaf4776bf33cba0451b2b2500fb9b (patch) | |
| tree | 2e6815ea82024d0ad5ac2f076ed28d93d53a3a75 | |
| parent | 2ccb521cf21c1db3d3c49cc547cb446f54f49dd6 (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
| -rw-r--r-- | doc/.cvsignore | 1 | ||||
| -rw-r--r-- | doc/Makefile.in | 4 | ||||
| -rwxr-xr-x | doc/Tutorial.tex | 3 |
3 files changed, 6 insertions, 2 deletions
diff --git a/doc/.cvsignore b/doc/.cvsignore index 4174e5c73c..648f312ff4 100644 --- a/doc/.cvsignore +++ b/doc/.cvsignore @@ -26,3 +26,4 @@ doc-html.tar.gz all-ps-docs.tar.gz config.cache config.status +Makefile diff --git a/doc/Makefile.in b/doc/Makefile.in index a9712fb797..7c49bda1b5 100644 --- a/doc/Makefile.in +++ b/doc/Makefile.in @@ -198,8 +198,8 @@ demos-programs: Recursive-Definition.v.tex: ./title.tex Recursive-Definition.tex -Tutorial.v.dvi: ./title.tex Tutorial.tex -Tutorial.v.pdf: ./title.tex Tutorial.tex +Tutorial.v.dvi: ./title.tex Tutorial.v.tex +Tutorial.v.pdf: ./title.tex Tutorial.v.tex # RefMan-ppr.v.tex: ../tactics/eqdecide.cmo diff --git a/doc/Tutorial.tex b/doc/Tutorial.tex index d554675f1b..477dc9ac44 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 |