document.write( "Question 973154: 1. P v R\r
\n" );
document.write( "\n" );
document.write( "2. R -> Q ////// :. (P v Q)
\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #595394 by solver91311(24713)![]() ![]() You can put this solution on YOUR website! \r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Prove by exhaustive cases:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Since P v R is given, the case P and case R are exhaustive.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Assume P. Then P v Q by Disjunction Introduction.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Assume R. Then Q from R -> Q by Modus Ponens and then P v Q by Disjuction Introduction.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "John \n" ); document.write( " \n" ); document.write( "My calculator said it, I believe it, that settles it\r \n" ); document.write( "\n" ); document.write( " |