Changes

|}

|}

What we have harvested is the succulent equivalent of a disjunctive normal form (DNF) for the proposition with which we started.  Remembering that a blank node is the graphical equivalent of a logical value <math>\operatorname{true},</math> we can read this brand of DNF in the following manner:

The final graph in the sequence of equivalents is a disjunctive normal form (DNF) for the proposition on the left hand side of the equation <math>\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))} = \texttt{(} p \texttt{(} q r \texttt{))}.</math> Remembering that a blank node is the graphical equivalent of a logical value <math>\operatorname{true},</math> the resulting DNF can be read as follows:

{| align="center" cellpadding="8" style="text-align:center; width:90%"

{| align="center" cellpadding="8" style="text-align:center; width:90%"

|}

|}

It remains to show that the right hand side of the equation <math>\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))} = \texttt{(} p \texttt{(} q r \texttt{))}</math> is logically equivalent to the DNF just obtained.  The remainder of the needed chain of equations is as follows:  

It remains to show that the right hand side of the equation <math>\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))} = \texttt{(} p \texttt{(} q r \texttt{))}</math> is logically equivalent to the DNF just obtained.  The needed chain of equations is as follows:  

{| align="center" cellpadding="8" style="text-align:center; width:90%"

{| align="center" cellpadding="8" style="text-align:center; width:90%"