diff --git a/src/sage/interfaces/sympy_wrapper.py b/src/sage/interfaces/sympy_wrapper.py
index 19e9b7ce610..35d5fed5ba1 100644
--- a/src/sage/interfaces/sympy_wrapper.py
+++ b/src/sage/interfaces/sympy_wrapper.py
@@ -17,34 +17,123 @@
 from sympy.core.sympify import sympify
 from sympy.sets.sets import Set
 
+
 @sympify_method_args
 class SageSet(Set):
+    r"""
+    Wrapper for a Sage set providing the SymPy Set API.
+
+    Parents in the category :class:`sage.categories.sets_cat.Sets`, unless
+    a more specific method is implemented, convert to SymPy by creating
+    an instance of this class.
+
+    EXAMPLES::
+
+        sage: F = Family([2, 3, 5, 7]); F
+        Family (2, 3, 5, 7)
+        sage: sF = F._sympy_(); sF            # indirect doctest
+        SageSet(Family (2, 3, 5, 7))
+        sage: sF._sage_() is F
+        True
+        sage: bool(sF)
+        True
+        sage: len(sF)
+        4
+        sage: list(sF)
+        [2, 3, 5, 7]
+        sage: sF.is_finite_set
+        True
+    """
 
     def __new__(cls, sage_set):
         return Basic.__new__(cls, sage_set)
 
     def _sage_(self):
+        r"""
+        Return the underlying Sage set of the wrapper ``self``.
+
+        EXAMPLES::
+
+            sage: F = Set([1, 2])
+            sage: F is Set([1, 2])
+            False
+            sage: sF = F._sympy_(); sF
+            SageSet({1, 2})
+            sage: sF._sage_() is F
+            True
+        """
         return self._args[0]
 
     @property
     def is_empty(self):
+        r"""
+        EXAMPLES::
+
+            sage: Empty = Set([])
+            sage: sEmpty = Empty._sympy_()
+            sage: sEmpty.is_empty
+            True
+        """
         return self._sage_().is_empty()
 
     @property
     def is_finite_set(self):
+        r"""
+        EXAMPLES::
+
+            sage: W = WeylGroup(["A",1,1])
+            sage: sW = W._sympy_(); sW
+            SageSet(Weyl Group of type ['A', 1, 1] (as a matrix group acting on the root space))
+            sage: sW.is_finite_set
+            False
+        """
         return self._sage_().is_finite()
 
     @property
     def is_iterable(self):
+        r"""
+        EXAMPLES::
+
+            sage: W = WeylGroup(["A",1,1])
+            sage: sW = W._sympy_(); sW
+            SageSet(Weyl Group of type ['A', 1, 1] (as a matrix group acting on the root space))
+            sage: sW.is_iterable
+            True
+        """
         from sage.categories.enumerated_sets import EnumeratedSets
         return self._sage_() in EnumeratedSets()
 
     def __iter__(self):
+        r"""
+        EXAMPLES::
+
+            sage: sPrimes = Primes()._sympy_(); sPrimes
+            SageSet(Set of all prime numbers: 2, 3, 5, 7, ...)
+            sage: iter_sPrimes = iter(sPrimes)
+            sage: next(iter_sPrimes), next(iter_sPrimes), next(iter_sPrimes)
+            (2, 3, 5)
+        """
         for element in self._sage_():
             yield sympify(element)
 
     def _contains(self, other):
+        """
+        EXAMPLES::
+
+            sage: sPrimes = Primes()._sympy_(); sPrimes
+            SageSet(Set of all prime numbers: 2, 3, 5, 7, ...)
+            sage: 91 in sPrimes
+            False
+        """
         return other in self._sage_()
 
     def __len__(self):
+        """
+        EXAMPLES::
+
+            sage: sB3 = WeylGroup(["B", 3])._sympy_(); sB3
+            SageSet(Weyl Group of type ['B', 3] (as a matrix group acting on the ambient space))
+            sage: len(sB3)
+            48
+        """
         return len(self._sage_())