Boolean Identities

Sometimes, a given Boolean expression isn't written in its simplest form, but we can simplify it. This table contains several identities, which are pairs of expressions that are equivalent to each other and can be used to simplify Boolean expressions:

NameAND versionOR version
Identity Law$1x = x$$0 + x = x$
Null Law$0x = 0$$1 + x = 1$
Idempotent Law$xx = x$$x + x = x$
Inverse Law$xx' = 0$$x + x' = 1$
Commutative Law$xy = yx$$x + y = y + x$
Associative Law$(xy)z = x(yz)$$(x + y) + z = x + (y + z)$
Distributive Law$x + yz = (x + y)(x + z)$$x(y + z) = xy + xz$
Absorption Law$x(x + y) = x$$x + xy = x$
DeMorgan's Law$(xy)' = x' + y'$$(x + y)' = x'y'$
Double Complement Law$(x')'= x'' = x$