doc-src/TutorialI/Fun/document/fun0.tex
changeset 27167 a99747ccba87
parent 27015 f8537d69f514
child 40406 313a24b66a8d
--- a/doc-src/TutorialI/Fun/document/fun0.tex	Thu Jun 12 14:20:07 2008 +0200
+++ b/doc-src/TutorialI/Fun/document/fun0.tex	Thu Jun 12 14:20:25 2008 +0200
@@ -322,7 +322,7 @@
 \isacommand{apply}\isa{{\isacharparenleft}induct{\isacharunderscore}tac} $x@1 \dots x@n$ \isa{rule{\isacharcolon}} $f$\isa{{\isachardot}induct{\isacharparenright}}
 \end{quote}\index{*induct_tac (method)}%
 where $x@1~\dots~x@n$ is a list of free variables in the subgoal and $f$ the
-name of a function that takes an $n$ arguments. Usually the subgoal will
+name of a function that takes $n$ arguments. Usually the subgoal will
 contain the term $f x@1 \dots x@n$ but this need not be the case. The
 induction rules do not mention $f$ at all. Here is \isa{sep{\isachardot}induct}:
 \begin{isabelle}