diff options
| author | cpaulin | 2006-06-05 14:10:26 +0000 |
|---|---|---|
| committer | cpaulin | 2006-06-05 14:10:26 +0000 |
| commit | b52c15bcfc7f76f3f8bf80aec05f7c4624fd05f7 (patch) | |
| tree | 778ed83334df4ac8f0f6d702646912e691f6c26c /doc/refman/Cases.tex | |
| parent | 653efc5491d9b9c253047b4700695c2493e9a19d (diff) | |
nouveaux parametres
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@8896 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'doc/refman/Cases.tex')
| -rw-r--r-- | doc/refman/Cases.tex | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/refman/Cases.tex b/doc/refman/Cases.tex index 95411afae9..a05231cd19 100644 --- a/doc/refman/Cases.tex +++ b/doc/refman/Cases.tex @@ -444,7 +444,7 @@ Inductive LE : nat -> nat -> Prop := \end{coq_example} We can use multiple patterns to write the proof of the lemma - \texttt{(n,m:nat) (LE n m)}\verb=\/=\texttt{(LE m n)}: + \texttt{forall (n m:nat), (LE n m)}\verb=\/=\texttt{(LE m n)}: \begin{coq_example} Fixpoint dec (n m:nat) {struct n} : LE n m \/ LE m n := |