logo

Expression of type And

from the theory of proveit.logic.booleans.disjunction

In [1]:
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 A, B
from proveit.logic import And, Boolean, InSet, Not
In [2]:
# build up the expression from sub-expressions
expr = And(InSet(B, Boolean), Not(And(Not(A), Not(B))))
expr:
In [3]:
# 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
In [4]:
# Show the LaTeX representation of the expression for convenience if you need it.
print(stored_expr.latex())
\left(B \in \mathbb{B}\right) \land (\lnot \left((\lnot A) \land (\lnot B)\right))
In [5]:
stored_expr.style_options()
namedescriptiondefaultcurrent valuerelated methods
operation'infix' or 'function' style formattinginfixinfix
wrap_positionsposition(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')
justificationif any wrap positions are set, justify to the 'left', 'center', or 'right'centercenter('with_justification',)
In [6]:
# display the expression information
stored_expr.expr_info()
 core typesub-expressionsexpression
0Operationoperator: 9
operands: 1
1ExprTuple2, 3
2Operationoperator: 4
operands: 5
3Operationoperator: 14
operand: 8
4Literal
5ExprTuple17, 7
6ExprTuple8
7Literal
8Operationoperator: 9
operands: 10
9Literal
10ExprTuple11, 12
11Operationoperator: 14
operand: 16
12Operationoperator: 14
operand: 17
13ExprTuple16
14Literal
15ExprTuple17
16Variable
17Variable