Mathematical Proof/Appendix/Answer Key/Mathematical Proof/Methods of Proof/Constructive Proof

From testwiki
Revision as of 21:20, 17 January 2008 by 129.219.202.114 (talk)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Problem 1.1) First, we wish to show that A(BC)(AB)(AC). Let xA(BC). Then xA or xBC.

case 1: xA
xAAB so that xAB
xAAC so that xAC
xAB and xAC so that x(AB)(AC)

case 2: xBC
xB and xC
xBABso that xAB
xCAC so that xAC
xAB and xAC so that x(AB)(AC)

Since in both cases, x(AB)(AC), we know that A(BC)(AB)(AC)

Now we wish to show that (AB)(AC)A(BC). Let x(AB)(AC). Then xAB and xAC.

case 1a: xA
xAA(BC) so that xA(BC)

case 1b: xB
We can't actually say anything we want to with just this, so we have to also add in xAC
case 2a: xA : SEE CASE 1a
case 2b: xC
We now have xB and xC so that xBC
Of course, since xBCA(BC), it follows that xA(BC).
Since both cases 2a and 2b yield xA(BC), we know that it follows from 1b.

Since in both cases 1a and 1b, xA(BC), we know that (AB)(AC)A(BC).

Since both A(BC)(AB)(AC) and (AB)(AC)A(BC), it follows (finally) that A(BC)=(AB)(AC).


--will continue later, feel free to refine it if you feel it can be--