1. G => (S&T)         Premise 

2. (S v T) => J       Premise

3. G                  Premise

4. S & T              3,1 Modus Ponens (MP)

5. S                  4 Simplification (SIMP)

6. S v T              5 Addition (ADD)

7. J                  6,2 MP



--------

There are other ways to go that are equally valid.  One example: we could have used T true on line 5 and ADDed S on line 6. 

 

RELATED QUESTIONS

 1. [J v (N & T)]
2.  ~(~T -> S)     /     J


i need help solving this proof 

 (answered by guest567)

How would you prove this argument valid ? 
1. A > H
2. G > S
3. ~ K > (A v G) 
4. ~ K  (answered by math_helper)

Eight rules of implication 
1. G>(S•T)
2.(SvT)>J
3.G.... (answered by ikleyn,math_tutor2020)

Please help me answer this. Thank you in advance
I.	Construct formal proof of validity... (answered by Edwin McCravy)

how to proof the arguments:

1. T ⊃ G
2. S ⊃ G 
∴ (T ∨ S)... (answered by Edwin McCravy)

1. (F . M) > (S v T) 2. (~S v A) > F 3. (~S v B) > M 4. ~S . G                    / T  (answered by jim_thompson5910)

Construct a proof in Natural Deduction for the following argument.  Show the proof.  Do... (answered by jim_thompson5910)

Example:
1.	A
2.	A>B	/ B
3.	B	1,2 MP		←You add this line


1.	G > H
2.	~H	/... (answered by ikleyn)

1.  ~J v ~L
2.  ~(J * L) -> ~M
3.  ~E v (M v ~S)           /  ~(S * E)  (answered by jim_thompson5910)