class_docstr: The "inverse" of another monomial order.
  
  If O is any monomial order, we can construct another monomial order iO
  such that `A >_{iO} B` if and only if `B >_O A`. This is useful for
  constructing local orders.
  
  Note that many algorithms only work with *global* orders.
  
  For example, in the inverse lexicographic order on a single variable `x`,
  high powers of `x` count as small:
  
  >>> from sympy.polys.orderings import lex, InverseOrder
  >>> ilex = InverseOrder(lex)
  >>> ilex((5,)) < ilex((0,))
  True
code: def __eq__(self, other):
      return isinstance(other, InverseOrder) and other.O == self.O
  
imports: from __future__ import annotations
  from sympy.core import Symbol
  from sympy.utilities.iterables import iterable
label_desc: Use image node_id 5 for calling the InverseOrder obj's underlying member method code with example usage: obj.__eq__(other) and returns: unknown