apply suggestions

Author: fchapoton

src/sage/combinat/posets/hasse_cython.pyx

@@ -116,7 +116,7 @@ class IncreasingChains(RecursivelyEnumeratedSet_forest):
             return True
         if self._conversion is not None:
             tup = [self._from_poset[elt] for elt in tup]
-        if any(not (0 <= i < self._n) for i in tup):
+        if not all(0 <= i < self._n for i in tup):
             return False
         y = tup[0]
         for k in range(1, len(tup)):

src/sage/matrix/matrix0.pyx

@@ -5140,9 +5140,9 @@ cdef class Matrix(sage.structure.element.Matrix):
             fac = o1.factor()
             S = sum((pi - 1) * pi**(ei - 1) for pi, ei in fac)
             if fac[0] == (2, 1):
-                impossible_order = not (S <= n + 1)
+                impossible_order = S > n + 1
             else:
-                impossible_order = not (S <= n)
+                impossible_order = S > n
             if impossible_order:
                 return Infinity