Axiom empty_conjunction of type And

from the theory of proveit.logic.booleans.conjunction

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_axiom_expr # Load the stored axiom expression as 'stored_expr'
# import the special expression
from proveit.logic.booleans.conjunction import empty_conjunction

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

Passed sanity check: empty_conjunction matches stored_expr

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

\left[\land\right]\left(\right)

stored_expr.style_options()

name	description	default	current value	related methods
operation	'infix' or 'function' style formatting	infix	infix
as_total_ordering	When 'True', style the conjunction as a total ordering (e.g. x < y < z from (x < y) and (y < z))	None	None/False	('with_total_ordering_style',)

# display the expression information
stored_expr.expr_info()

	core type	sub-expressions	expression
0	Operation	operator: 1 operands: 2
1	Literal
2	ExprTuple