Expression of type Equals

from the theory of proveit.linear_algebra.scalar_multiplication

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 Function, c, k
from proveit.core_expr_types import Q__b_1_to_j, b_1_to_j, f__b_1_to_j
from proveit.linear_algebra import ScalarMult, VecSum
from proveit.logic import Equals
from proveit.numbers import Mult

# build up the expression from sub-expressions
sub_expr1 = [b_1_to_j]
sub_expr2 = Function(c, sub_expr1)
expr = Equals(VecSum(index_or_indices = sub_expr1, summand = ScalarMult(Mult(k, sub_expr2), f__b_1_to_j), condition = Q__b_1_to_j), ScalarMult(k, VecSum(index_or_indices = sub_expr1, summand = ScalarMult(sub_expr2, f__b_1_to_j), condition = Q__b_1_to_j))).with_wrapping_at(1)

expr:

# 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

# Show the LaTeX representation of the expression for convenience if you need it.
print(stored_expr.latex())

\begin{array}{c} \begin{array}{l} \left[\sum_{b_{1}, b_{2}, \ldots, b_{j}~|~Q\left(b_{1}, b_{2}, \ldots, b_{j}\right)}~\left(\left(k \cdot c\left(b_{1}, b_{2}, \ldots, b_{j}\right)\right) \cdot f\left(b_{1}, b_{2}, \ldots, b_{j}\right)\right)\right] \\  = \left(k \cdot \left[\sum_{b_{1}, b_{2}, \ldots, b_{j}~|~Q\left(b_{1}, b_{2}, \ldots, b_{j}\right)}~\left(c\left(b_{1}, b_{2}, \ldots, b_{j}\right) \cdot f\left(b_{1}, b_{2}, \ldots, b_{j}\right)\right)\right]\right) \end{array} \end{array}

stored_expr.style_options()

name	description	default	current value	related methods
operation	'infix' or 'function' style formatting	infix	infix
wrap_positions	position(s) at which wrapping is to occur; '2 n - 1' is after the nth operand, '2 n' is after the nth operation.	()	(1)	('with_wrapping_at', 'with_wrap_before_operator', 'with_wrap_after_operator', 'without_wrapping', 'wrap_positions')
justification	if any wrap positions are set, justify to the 'left', 'center', or 'right'	center	center	('with_justification',)
direction	Direction of the relation (normal or reversed)	normal	normal	('with_direction_reversed', 'is_reversed')

# display the expression information
stored_expr.expr_info()

	core type	sub-expressions	expression
0	Operation	operator: 1 operands: 2
1	Literal
2	ExprTuple	3, 4
3	Operation	operator: 10 operand: 7
4	Operation	operator: 21 operands: 6
5	ExprTuple	7
6	ExprTuple	24, 8
7	Lambda	parameters: 29 body: 9
8	Operation	operator: 10 operand: 13
9	Conditional	value: 12 condition: 18
10	Literal
11	ExprTuple	13
12	Operation	operator: 21 operands: 14
13	Lambda	parameters: 29 body: 15
14	ExprTuple	16, 26
15	Conditional	value: 17 condition: 18
16	Operation	operator: 19 operands: 20
17	Operation	operator: 21 operands: 22
18	Operation	operator: 23 operands: 29
19	Literal
20	ExprTuple	24, 25
21	Literal
22	ExprTuple	25, 26
23	Variable
24	Variable
25	Operation	operator: 27 operands: 29
26	Operation	operator: 28 operands: 29
27	Variable
28	Variable
29	ExprTuple	30
30	ExprRange	lambda_map: 31 start_index: 32 end_index: 33
31	Lambda	parameter: 37 body: 34
32	Literal
33	Variable
34	IndexedVar	variable: 35 index: 37
35	Variable
36	ExprTuple	37
37	Variable