# Theory of proveit.logic.booleans.conjunction¶

Theory for the conjunction operation And ($\land$). And may operate on any number of Boolean operands and only evaluates to TRUE if all of the operands are TRUE. If any operand is FALSE then the And operation evaluates to FALSE. The operation is only defined when all of the operands are Boolean; therefore, if the evaluation of the And operation is a Boolean, all of the operands must be Boolean values.

In [1]:
import proveit
%theory


### Local content of this theory

common expressions axioms theorems demonstrations