summaryrefslogtreecommitdiff
path: root/doc/refman/Cases.tex
diff options
context:
space:
mode:
Diffstat (limited to 'doc/refman/Cases.tex')
-rw-r--r--doc/refman/Cases.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/refman/Cases.tex b/doc/refman/Cases.tex
index 95411afa..a05231cd 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 :=