document.write( "Question 664426: Given ¬(p∧q), prove (¬p∨¬q). \n" ); document.write( "
Algebra.Com's Answer #413333 by Edwin McCravy(20055)\"\" \"About 
You can put this solution on YOUR website!
\r\n" );
document.write( "¬(p∧q), prove (¬p∨¬q).\r\n" );
document.write( "\r\n" );
document.write( "This is done by a truth table.\r\n" );
document.write( "\r\n" );
document.write( "1. Negation:  Rule for ¬x is: If x has a T, then ¬x has\r\n" );
document.write( "   an F and vice-versa.\r\n" );
document.write( "2. Conjunction: Rule for x∧y is: If x and y both have\r\n" );
document.write( "   T's, x∧y has T, otherwise x∧y has F.  \r\n" );
document.write( "3. Disjunction: Rule for x∨y is: If x and y both have \r\n" );
document.write( "   F's, x∨y has F, otherwise x∨y has T.\r\n" );
document.write( "4. Biconditional:  Rule for x<->y is: If both x and y \r\n" );
document.write( "   have the same truth value, x<->y has T, otherwise F. \r\n" );
document.write( "\r\n" );
document.write( "You need headings as listed below:   \r\n" );
document.write( "\r\n" );
document.write( "p | q | ¬p | ¬q | p∧q | ¬(p∧q) | ¬p∨¬q | ¬(p∧q) <-> (¬p∨¬q) |\r\n" );
document.write( "---------------------------------------------------------------\r\n" );
document.write( "T | T |  F |  F |  T  |    F    |   F   |         T           |\r\n" );
document.write( "T | F |    |    |     |         |       |                     |\r\n" );
document.write( "F | T |    |    |     |         |       |                     |\r\n" );
document.write( "F | F |    |    |     |         |       |                     |\r\n" );
document.write( "\r\n" );
document.write( "The F under ¬p is because there is a T under p, rule 1 above.\r\n" );
document.write( "The F under ¬q is because there is a T under q, rule 1 above.\r\n" );
document.write( "The T under p∧q is because there is a T under both p and q,\r\n" );
document.write( "    rule 2 above.\r\n" );
document.write( "The F under ¬(p∧q) is because there is a T under p∧q,\r\n" );
document.write( "    rule 1 above.\r\n" );
document.write( "The F under ¬p∨¬q is because ¬p and ¬q both have F's\r\n" );
document.write( "    rule 3 above.\r\n" );
document.write( "The T under ¬(p∧q) <-> (¬p∨¬q) is because both ¬(p∧q) and (¬p∨¬q)\r\n" );
document.write( "    have the same truth value F, rule 4\r\n" );
document.write( "\r\n" );
document.write( "Now we fil in the next row:\r\n" );
document.write( "\r\n" );
document.write( "p | q | ¬p | ¬q | p∧q | ¬(p∧q) | ¬p∨¬q | ¬(p∧q) <-> (¬p∨¬q) |\r\n" );
document.write( "---------------------------------------------------------------\r\n" );
document.write( "T | T |  F |  F |  T  |    F    |   F   |         T           |\r\n" );
document.write( "T | F |  F |  T |  F  |    T    |   T   |         T           |\r\n" );
document.write( "F | T |    |    |     |         |       |                     |\r\n" );
document.write( "F | F |    |    |     |         |       |                     |\r\n" );
document.write( "\r\n" );
document.write( "The F under ¬p is because there is a T under p, rule 1 above.\r\n" );
document.write( "The T under ¬q is because there is a F under q, rule 1 above.\r\n" );
document.write( "The F under p∧q is because p and q don't both have T's, rule 2 \r\n" );
document.write( "above.\r\n" );
document.write( "The T under ¬(p∧q) is because there is a F under p∧q,\r\n" );
document.write( "    rule 1 above.\r\n" );
document.write( "The T under ¬p∨¬q is because ¬p and ¬q don't both have F's\r\n" );
document.write( "    rule 3 above.\r\n" );
document.write( "The T under ¬(p∧q) <-> (¬p∨¬q) is because both ¬(p∧q) and (¬p∨¬q)\r\n" );
document.write( "    have the same truth value T, rule 4\r\n" );
document.write( "\r\n" );
document.write( "Now we fil in the third row:\r\n" );
document.write( "\r\n" );
document.write( "p | q | ¬p | ¬q | p∧q | ¬(p∧q) | ¬p∨¬q | ¬(p∧q) <-> (¬p∨¬q) |\r\n" );
document.write( "---------------------------------------------------------------\r\n" );
document.write( "T | T |  F |  F |  T  |    F    |   F   |         T           |\r\n" );
document.write( "T | F |  F |  T |  F  |    T    |   T   |         T           |\r\n" );
document.write( "F | T |  T |  F |  F  |    T    |   T   |         T           |\r\n" );
document.write( "F | F |    |    |     |         |       |                     |\r\n" );
document.write( "\r\n" );
document.write( "The T under ¬p is because there is a F under p, rule 1 above.\r\n" );
document.write( "The F under ¬q is because there is a T under q, rule 1 above.\r\n" );
document.write( "The F under p∧q is because p and q don't both have T's, rule 2 \r\n" );
document.write( "above.\r\n" );
document.write( "The T under ¬(p∧q) is because there is a F under p∧q,\r\n" );
document.write( "    rule 1 above.\r\n" );
document.write( "The T under ¬p∨¬q is because ¬p and ¬q don't both have F's\r\n" );
document.write( "    rule 3 above.\r\n" );
document.write( "The T under ¬(p∧q) <-> (¬p∨¬q) is because both ¬(p∧q) and (¬p∨¬q)\r\n" );
document.write( "    have the same truth value T, rule 4\r\n" );
document.write( "\r\n" );
document.write( "Now we fill in the fourth row:\r\n" );
document.write( "\r\n" );
document.write( "p | q | ¬p | ¬q | p∧q | ¬(p∧q) | ¬p∨¬q | ¬(p∧q) <-> (¬p∨¬q) |\r\n" );
document.write( "---------------------------------------------------------------\r\n" );
document.write( "T | T |  F |  F |  T  |    F    |   F   |         T           |\r\n" );
document.write( "T | F |  F |  T |  F  |    T    |   T   |         T           |\r\n" );
document.write( "F | T |  T |  F |  F  |    T    |   T   |         T           |\r\n" );
document.write( "F | F |  T |  T |  F  |    T    |   T   |         T           |\r\n" );
document.write( "\r\n" );
document.write( "The T under ¬p is because there is a F under p, rule 1 above.\r\n" );
document.write( "The T under ¬q is because there is a F under q, rule 1 above.\r\n" );
document.write( "The F under p∧q is because p and q don't both have T's, rule 2 \r\n" );
document.write( "above.\r\n" );
document.write( "The T under ¬(p∧q) is because there is a F under p∧q,\r\n" );
document.write( "    rule 1 above.\r\n" );
document.write( "The T under ¬p∨¬q is because ¬p and ¬q don't both have F's\r\n" );
document.write( "    rule 3 above.\r\n" );
document.write( "The T under ¬(p∧q) <-> (¬p∨¬q) is because both ¬(p∧q) and (¬p∨¬q)\r\n" );
document.write( "    have the same truth value T, rule 4.\r\n" );
document.write( "\r\n" );
document.write( "Now since there are only T's in the last column, that proves that\r\n" );
document.write( "in every case, the biconditional ¬(p∧q) <-> (¬p∨¬q) is\r\n" );
document.write( "true and therefore ¬(p∧q) and (¬p∨¬q) are equivalent\r\n" );
document.write( "because the biconditional is a tautology.\r\n" );
document.write( "\r\n" );
document.write( "Edwin
\n" ); document.write( "
\n" );