# 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 ExprTuple
from proveit.core_expr_types import a_1_to_n
from proveit.numbers import Mult, RationalNonNeg

In [2]:
# build up the expression from sub-expressions
expr = ExprTuple(Mult(a_1_to_n), RationalNonNeg)

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(a_{1} \cdot  a_{2} \cdot  \ldots \cdot  a_{n}, \mathbb{Q}^{\geq 0}\right)

In [5]:
stored_expr.style_options()

namedescriptiondefaultcurrent valuerelated methods
wrap_positionsposition(s) at which wrapping is to occur; 'n' is after the nth comma.()()('with_wrapping_at',)
justificationif any wrap positions are set, justify to the 'left', 'center', or 'right'leftleft('with_justification',)
In [6]:
# display the expression information
stored_expr.expr_info()

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