aboutsummaryrefslogtreecommitdiffhomepage
path: root/doc
diff options
context:
space:
mode:
authorGravatar Maxime Dénès <mail@maximedenes.fr>2017-04-28 11:25:29 +0200
committerGravatar Maxime Dénès <mail@maximedenes.fr>2017-04-28 11:25:29 +0200
commit66a68a4329ce199f25184ba8b2d98b4679e7ddae (patch)
treece90c93341c58e82813da8b1a567ce6a3f3ed424 /doc
parent0a255f51809e8d29a7239bfbd9fe57a8b2b41705 (diff)
parent2ddc9d12bd4616f10245c40bc0c87ae548911809 (diff)
Merge PR#531: Fixing bug #5420 and many similar bugs due to the presence of let-ins
Diffstat (limited to 'doc')
-rw-r--r--doc/refman/RefMan-tac.tex6
1 files changed, 3 insertions, 3 deletions
diff --git a/doc/refman/RefMan-tac.tex b/doc/refman/RefMan-tac.tex
index 3f1241186..0edc66f83 100644
--- a/doc/refman/RefMan-tac.tex
+++ b/doc/refman/RefMan-tac.tex
@@ -2618,9 +2618,9 @@ as the ones described in Section~\ref{Tac-induction}.
In the syntax of the tactic, the identifier {\ident} is the name given
to the induction hypothesis. The natural number {\num} tells on which
premise of the current goal the induction acts, starting
-from 1 and counting both dependent and non dependent
-products. Especially, the current lemma must be composed of at least
-{\num} products.
+from 1, counting both dependent and non dependent
+products, but skipping local definitions. Especially, the current
+lemma must be composed of at least {\num} products.
Like in a {\tt fix} expression, the induction
hypotheses have to be used on structurally smaller arguments.