So I previously asked for help a couple hours ago and decided to tackle on this problem:
(A ∨ B) ∧ (A→C) ∧ (B→C)→C
I'm stuck; this is what I have so far:
- A ∨ B (hypothesis)
- A→C (hypothesis)
- B→C (hypothesis)
- A'∨C (2, implication)
- B'∨C (3, implication)
and then I don't know what to do/prove next. Am I on the right track at least?
Notice that: $$ (A' \lor C) \land (B' \lor C) \equiv (A' \land B') \lor C \equiv (A \lor B)' \lor C $$