SOLUTION: Prove ¬F =⇒ G, F =⇒ H ∴ G ∨ H

Algebra.Com
Question 1169463: Prove ¬F =⇒ G, F =⇒ H ∴ G ∨ H
Answer by math_helper(2461)   (Show Source): You can put this solution on YOUR website!

1. ~F --> G
2. F --> H
3.:: ~F Conditional Proof (CP) assumption #1
4.:: G 3,1 Modus Ponens (MP)
5.:: F CP, assumption #2
6.:: H 5,2 MP
7.:: G v H 3-4 and 5-6, Proof by Cases (PBC)
8. G v H 3-7 CP
In words: if we assume ~F, G must be true. If we assume F, then H must be true. Since F v ~F must be true, G v H must be true.

RELATED QUESTIONS

f(g(h(-2))) (answered by stanbon)
f•(h•g)](3) (answered by math-vortex)
y=f+g+h/7 (answered by Alan3354)
subsets of f,g,h (answered by Fombitz)
Solve: F/(G -> H) v (~G ->... (answered by solver91311)
F > ~G ~F > (H > ~G) (~I v ~H) > ~~G ~I /... (answered by jim_thompson5910)
(f⊃g) v h/∼ f ∼G... (answered by Solver92311)
Given: ABCD is a parallelogram; (answered by macston)
Given: E(-2,3) F(-2,-2) G(3,-2) H(3,3) Prove: EFGH is a rhombus (answered by MathLover1)