Expression of type Bijections

from the theory of proveit.numbers.modular

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 N, a, b
from proveit.logic import Bijections
from proveit.numbers import Interval, one, subtract, zero

# build up the expression from sub-expressions
expr = Bijections(Interval(a, b), Interval(zero, subtract(N, one)))

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

\left[\{a~\ldotp \ldotp~b\} \xrightarrow[\text{onto}]{\text{1-to-1}} \{0~\ldotp \ldotp~N - 1\}\right]

stored_expr.style_options()

name	description	default	current value	related methods
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.	()	()	('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',)

# 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: 6 operands: 5
4	Operation	operator: 6 operands: 7
5	ExprTuple	8, 9
6	Literal
7	ExprTuple	10, 11
8	Variable
9	Variable
10	Literal
11	Operation	operator: 12 operands: 13
12	Literal
13	ExprTuple	14, 15
14	Variable
15	Operation	operator: 16 operand: 18
16	Literal
17	ExprTuple	18
18	Literal