Expression of type Lambda

from the theory of proveit.logic.booleans.disjunction

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, m
from proveit.core_expr_types import A_1_to_m
from proveit.logic import Forall, InSet, Or
from proveit.numbers import NaturalPos

# build up the expression from sub-expressions
expr = Lambda(m, Conditional(Forall(instance_param_or_params = [A_1_to_m], instance_expr = Or(A_1_to_m), condition = A_1_to_m), InSet(m, NaturalPos)))

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())

m \mapsto \left\{\forall_{A_{1}, A_{2}, \ldots, A_{m}~|~A_{1}, A_{2}, \ldots, A_{m}}~\left(A_{1} \lor  A_{2} \lor  \ldots \lor  A_{m}\right) \textrm{ if } m \in \mathbb{N}^+\right..

stored_expr.style_options()

no style options

# display the expression information
stored_expr.expr_info()

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