Theorem unary_mult_reduction of type Forall

from the theory of proveit.numbers.multiplication

see dependencies

import proveit
# Automation is not needed when only building an expression:
proveit.defaults.automation = False # This will speed things up.
proveit.defaults.inline_pngs = False # Makes files smaller.
%load_theorem_expr # Load the stored theorem expression as 'stored_expr'
# import the special expression
from proveit.numbers.multiplication import unary_mult_reduction

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

Passed sanity check: unary_mult_reduction matches stored_expr

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

\forall_{a}~\left(\left[\cdot\right]\left(a\right) = a\right)

stored_expr.style_options()

name	description	default	current value	related methods
with_wrapping	If 'True', wrap the Expression after the parameters	None	None/False	('with_wrapping',)
condition_wrapping	Wrap 'before' or 'after' the condition (or None).	None	None/False	('with_wrap_after_condition', 'with_wrap_before_condition')
wrap_params	If 'True', wraps every two parameters AND wraps the Expression after the parameters	None	None/False	('with_params',)
justification	justify to the 'left', 'center', or 'right' in the array cells	center	center	('with_justification',)

# display the expression information
stored_expr.expr_info()

	core type	sub-expressions	expression
0	Operation	operator: 1 operand: 3
1	Literal
2	ExprTuple	3
3	Lambda	parameter: 10 body: 4
4	Operation	operator: 5 operands: 6
5	Literal
6	ExprTuple	7, 10
7	Operation	operator: 8 operand: 10
8	Literal
9	ExprTuple	10
10	Variable