1. (A∨~B)→(F∨(R∙G))   Premise

2. A                  Premise          

3. F→L                Premise

4. (R∙G)→T            Premise

5. (L∨T)→S            Premise

6. A v ~B             2  Addition (ADD)

7.  F v (R∙G)         6,1  Modus Ponens (MP)

8. L v T             7,3,4  Constructive Dilemma (CD)

9. S                  8,5  MP  (conclusion)



—————————

After reviewing my first answer, I realized that the conditional proof was not only incorrect, it was unnecessary.

 

RELATED QUESTIONS

1.   (Q∨R)→(W∨U)             
2.   W→P                     
3.   (answered by jim_thompson5910)

Solve use reductio ad absurdum
1.  ~P→(R∙S)           
2.... (answered by math_helper)

1.  (E∨F)→~G 2.  ~H 3.  H∨K 4.  (K∨L)→E ∴... (answered by jim_thompson5910)

1.    (A∨G)→K                            
2.    K→(B→F)           (answered by solver91311)

1. (Q∨R)→(W∨U)
2. W→P
3. Q∙T
4. U→Z
5. S→M
 (answered by jim_thompson5910)

1.	~P∨Q
2.	Q→R ∴ P→R

1.	R∨~Q
2.	P→Q
3.	~R        (answered by Edwin McCravy)

Complete the following proofs using the Conditional Proof method.

1)	1. ~(P ∙... (answered by solver91311)

Can you please help me solve this proof? I am stuck at line six. 

1.   (A → E)... (answered by jim_thompson5910)

write a direct proof using the eight rules of inference 

(C → Q) • (~L →... (answered by Edwin McCravy)