# from the theory of proveit.numbers.multiplication¶

In [1]:
import proveit
# Automation is not needed when building an expression:
proveit.defaults.automation = False # This will speed things up.
proveit.defaults.inline_pngs = False # Makes files smaller.
# import Expression classes needed to build the expression
from proveit import ExprRange, ExprTuple, IndexedVar, Variable, a, n
from proveit.logic import InSet
from proveit.numbers import RationalNonNeg, one

In [2]:
# build up the expression from sub-expressions
sub_expr1 = Variable("_a", latex_format = r"{_{-}a}")
expr = ExprTuple(ExprRange(sub_expr1, InSet(IndexedVar(a, sub_expr1), RationalNonNeg), one, n))

expr:
In [3]:
# check that the built expression is the same as the stored expression
assert expr == stored_expr
assert expr._style_id == stored_expr._style_id
print("Passed sanity check: expr matches stored_expr")

Passed sanity check: expr matches stored_expr

In [4]:
# Show the LaTeX representation of the expression for convenience if you need it.
print(stored_expr.latex())

\left(\left(a_{1} \in \mathbb{Q}^{\geq 0}\right), \left(a_{2} \in \mathbb{Q}^{\geq 0}\right), \ldots, \left(a_{n} \in \mathbb{Q}^{\geq 0}\right)\right)

In [5]:
stored_expr.style_options()

no style options
In [6]:
# display the expression information
stored_expr.expr_info()

core typesub-expressionsexpression
0ExprTuple1
1ExprRangelambda_map: 2
start_index: 3
end_index: 4
2Lambdaparameter: 12
body: 5
3Literal
4Variable
5Operationoperator: 6
operands: 7
6Literal
7ExprTuple8, 9
8IndexedVarvariable: 10
index: 12
9Literal
10Variable
11ExprTuple12
12Variable