logo

Expression of type ExprTuple

from the theory of proveit.numbers.addition

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.
%load_expr # Load the stored expression as 'stored_expr'
# import Expression classes needed to build the expression
from proveit import Conditional, ExprTuple, Lambda, b
from proveit.core_expr_types import a_1_to_i, c_1_to_j
from proveit.logic import InSet
from proveit.numbers import Add, Real, greater
In [2]:
# build up the expression from sub-expressions
expr = ExprTuple(Lambda(b, Conditional(greater(Add(a_1_to_i, b, c_1_to_j), b), InSet(b, Real))))
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(b \mapsto \left\{\left(a_{1} +  a_{2} +  \ldots +  a_{i} + b+ c_{1} +  c_{2} +  \ldots +  c_{j}\right) > b \textrm{ if } b \in \mathbb{R}\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
1Lambdaparameter: 15
body: 3
2ExprTuple15
3Conditionalvalue: 4
condition: 5
4Operationoperator: 6
operands: 7
5Operationoperator: 8
operands: 9
6Literal
7ExprTuple15, 10
8Literal
9ExprTuple15, 11
10Operationoperator: 12
operands: 13
11Literal
12Literal
13ExprTuple14, 15, 16
14ExprRangelambda_map: 17
start_index: 20
end_index: 18
15Variable
16ExprRangelambda_map: 19
start_index: 20
end_index: 21
17Lambdaparameter: 27
body: 22
18Variable
19Lambdaparameter: 27
body: 23
20Literal
21Variable
22IndexedVarvariable: 24
index: 27
23IndexedVarvariable: 25
index: 27
24Variable
25Variable
26ExprTuple27
27Variable