readily_provable_number_set

proveit.numbers.readily_provable_number_set(expr, \*, automation=True, must_be_direct=False, default=None, _check_order_against_zero=True)

Return the most restrictive number set that the given expression may readily be proven to be within. The expression may also be an ExprRange where each instance is in the number set.

Return the default (possibly None) if there are no readily provable number memberships.

If automation is disabled, only return a number set in which membership has already been proven.

If must_be_direct is True, don’t account for known/provable equalities of the element.

_check_order_against_zero is set to False internally to avoid infinite recursion.