# Theory of proveit.logic.booleans.disjunction¶

Theory for the disjunction operation Or ($\lor$). Or may operate on any number of Boolean operands and only evaluates to FALSE if all of the operands are FALSE. If any operand is TRUE then the Or operation evaluates to TRUE. The operation is only defined when all of the operands are Boolean; therefore, if the evaluation of the Or 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