diff --git a/base/docs/helpdb.jl b/base/docs/helpdb.jl
index 871f1d5efaf46..674a1f21ee038 100644
--- a/base/docs/helpdb.jl
+++ b/base/docs/helpdb.jl
@@ -7932,7 +7932,11 @@ doc"""
 ```rst
 ..  IntSet([itr])
 
-Construct a sorted set of the integers generated by the given iterable object, or an empty set. Implemented as a bit string, and therefore designed for dense integer sets. Only non-negative integers can be stored. If the set will be sparse (for example holding a single very large integer), use :obj:`Set` instead.
+Construct a sorted set of positive ``Int``\ s generated by the given iterable
+object, or an empty set. Implemented as a bit string, and therefore designed
+for dense integer sets. Only ``Int``\ s greater than 0 can be stored. If the
+set will be sparse (for example holding a few very large integers), use
+:obj:`Set` instead.
 ```
 """
 IntSet
diff --git a/doc/stdlib/collections.rst b/doc/stdlib/collections.rst
index 205803a1af761..931ca6c045c3a 100644
--- a/doc/stdlib/collections.rst
+++ b/doc/stdlib/collections.rst
@@ -895,7 +895,11 @@ Set-Like Collections
 
    .. Docstring generated from Julia source
 
-   Construct a sorted set of the integers generated by the given iterable object, or an empty set. Implemented as a bit string, and therefore designed for dense integer sets. Only non-negative integers can be stored. If the set will be sparse (for example holding a single very large integer), use :obj:`Set` instead.
+   Construct a sorted set of positive ``Int``\ s generated by the given iterable
+   object, or an empty set. Implemented as a bit string, and therefore designed
+   for dense integer sets. Only ``Int``\ s greater than 0 can be stored. If the
+   set will be sparse (for example holding a few very large integers), use
+   :obj:`Set` instead.
 
 .. function:: union(s1,s2...)
               ∪(s1,s2...)