However, 10,000 cases are inseparable from their origins. Let me express my understanding.

Boolean algebra contains two operations, one is to find the upper bound and the other is to find the lower bound, which are generally expressed as ∨, ∧.

In the textbook above? The maximum lower bound is equal to ∧+,and the minimum upper bound is equal to ∨.

A = A+0-A = A and.

=a+(a？ The complement of a (complement) -a is 0, and the complement of a+a is1.

=(a+a)？ The operation of (a+a (complement))-Boolean algebra satisfies the distribution rate.

= A+A-A-A+。 The maximum lower bound of 1 is (a+a)

A+(b.c)=(a+b)。 (a+c) indicates the distribution rate.

The above two formulas prove that Boolean algebra (the characteristic of general lattice): operations have the laws of distribution and idempotency to elements.