changeset 10888 | f321d21b9a6b |
parent 10857 | 47b1f34ddd09 |
child 10978 | 5eebea8f359f |
--- a/doc-src/TutorialI/Sets/sets.tex Fri Jan 12 17:59:37 2001 +0100 +++ b/doc-src/TutorialI/Sets/sets.tex Fri Jan 12 18:00:12 2001 +0100 @@ -402,7 +402,7 @@ \rulename{n_subsets} \end{isabelle} Writing $|A|$ as $n$, the last of these theorems says that the number of -$k$-element subsets of~$A$ is $n \choose k$. +$k$-element subsets of~$A$ is $\binom{n}{k}$. \begin{warn} The term \isa{Finite\ A} is an abbreviation for