Rule of Distribution

Definition
Conjunction distributes over disjunction:


 * $$p \and \left({q \or r}\right) \dashv \vdash \left({p \and q}\right) \or \left({p \and r}\right)$$
 * $$\left({q \or r}\right) \and p \dashv \vdash \left({q \and p}\right) \or \left({r \and p}\right)$$

Disjunction distributes over conjunction:


 * $$p \or \left({q \and r}\right) \dashv \vdash \left({p \or q}\right) \and \left({p \or r}\right)$$
 * $$\left({q \and r}\right) \or p \dashv \vdash \left({q \or p}\right) \and \left({r \or p}\right)$$

Its abbreviation in a tableau proof is $$\text{Dist}$$.

Proof by Natural Deduction
By the Tableau method:

Then we use the Rule of Commutation:

Proof by Truth Table
We apply the Method of Truth Tables to the proposition.

As can be seen by inspection, the truth values under the main connectives match for all models.

$$\begin{array}{|ccccc||ccccccc|} \hline p & \and & (q & \or & r) & (p & \and & q) & \or & (p & \and & r) \\ \hline F & F & F & F & F & F & F & F & F & F & F & F \\ F & F & F & T & T & F & F & F & F & F & F & T \\ F & F & T & T & F & F & F & T & F & F & F & F \\ F & F & T & T & T & F & F & T & F & F & F & T \\ T & F & F & F & F & T & F & F & F & T & F & F \\ T & T & F & T & T & T & F & F & T & T & T & T \\ T & T & T & T & F & T & T & T & T & T & F & F \\ T & T & T & T & T & T & T & T & T & T & T & T \\ \hline \end{array}$$

$$\left({q \or r}\right) \and p \dashv \vdash \left({q \and p}\right) \or \left({r \and p}\right)$$ is demonstrated similarly.

Proof by Natural Deduction
By the Tableau method:

Then we use the Rule of Commutation:

Proof by Truth Table
We apply the Method of Truth Tables to the proposition.

As can be seen by inspection, the truth values under the main connectives match for all models.

$$\begin{array}{|ccccc||ccccccc|} \hline p & \or & (q & \and & r) & (p & \or & q) & \and & (p & \or & r) \\ \hline F & F & F & F & F & F & F & F & F & F & F & F \\ F & F & F & F & T & F & F & F & F & F & T & T \\ F & F & T & F & F & F & T & T & F & F & F & F \\ F & T & T & T & T & F & T & T & T & F & T & T \\ T & T & F & F & F & T & T & F & T & T & T & F \\ T & T & F & F & T & T & T & F & T & T & T & T \\ T & T & T & F & F & T & T & T & T & T & T & F \\ T & T & T & T & T & T & T & T & T & T & T & T \\ \hline \end{array}$$

$$\left({q \and r}\right) \or p \dashv \vdash \left({q \or p}\right) \and \left({r \or p}\right)$$ is demonstrated similarly.