logo

Expression of type Implies

from the theory of proveit.numbers.summation

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, Lambda, a, b, l
from proveit.logic import Equals, Forall, Implies, InSet
from proveit.numbers import Add, Integer, Mult, one
In [2]:
# build up the expression from sub-expressions
sub_expr1 = Add(l, one)
sub_expr2 = InSet(l, Integer)
sub_expr3 = Mult(a, b, sub_expr1)
sub_expr4 = Mult(Mult(a, b), sub_expr1)
expr = Implies(Forall(instance_param_or_params = [l], instance_expr = Equals(sub_expr3, sub_expr4), domain = Integer), Equals(Lambda(l, Conditional(sub_expr3, sub_expr2)), Lambda(l, Conditional(sub_expr4, sub_expr2))).with_wrapping_at(2)).with_wrapping_at(2)
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())
\begin{array}{c} \begin{array}{l} \left[\forall_{l \in \mathbb{Z}}~\left(\left(a \cdot b \cdot \left(l + 1\right)\right) = \left(\left(a \cdot b\right) \cdot \left(l + 1\right)\right)\right)\right] \Rightarrow  \\ \left(\begin{array}{c} \begin{array}{l} \left[l \mapsto \left\{a \cdot b \cdot \left(l + 1\right) \textrm{ if } l \in \mathbb{Z}\right..\right] =  \\ \left[l \mapsto \left\{\left(a \cdot b\right) \cdot \left(l + 1\right) \textrm{ if } l \in \mathbb{Z}\right..\right] \end{array} \end{array}\right) \end{array} \end{array}
In [5]:
stored_expr.style_options()
namedescriptiondefaultcurrent valuerelated methods
operation'infix' or 'function' style formattinginfixinfix
wrap_positionsposition(s) at which wrapping is to occur; '2 n - 1' is after the nth operand, '2 n' is after the nth operation.()(2)('with_wrapping_at', 'with_wrap_before_operator', 'with_wrap_after_operator', 'without_wrapping', 'wrap_positions')
justificationif any wrap positions are set, justify to the 'left', 'center', or 'right'centercenter('with_justification',)
directionDirection of the relation (normal or reversed)normalnormal('with_direction_reversed', 'is_reversed')
In [6]:
# display the expression information
stored_expr.expr_info()
 core typesub-expressionsexpression
0Operationoperator: 1
operands: 2
1Literal
2ExprTuple3, 4
3Operationoperator: 5
operand: 8
4Operationoperator: 17
operands: 7
5Literal
6ExprTuple8
7ExprTuple9, 10
8Lambdaparameter: 34
body: 11
9Lambdaparameter: 34
body: 12
10Lambdaparameter: 34
body: 14
11Conditionalvalue: 15
condition: 16
12Conditionalvalue: 21
condition: 16
13ExprTuple34
14Conditionalvalue: 22
condition: 16
15Operationoperator: 17
operands: 18
16Operationoperator: 19
operands: 20
17Literal
18ExprTuple21, 22
19Literal
20ExprTuple34, 23
21Operationoperator: 28
operands: 24
22Operationoperator: 28
operands: 25
23Literal
24ExprTuple32, 33, 27
25ExprTuple26, 27
26Operationoperator: 28
operands: 29
27Operationoperator: 30
operands: 31
28Literal
29ExprTuple32, 33
30Literal
31ExprTuple34, 35
32Variable
33Variable
34Variable
35Literal