Propositional Logic: Conditional Proof

43 Views Asked by At

I'm learning how to prove statements using the rules of inference, and now I'm stuck in this problem where I have to use the conditional proof to prove it. It says: $P\to (Q \lor R)$, $S \to ¬Q ⇒ (P \land S) \to R$

So, we want to prove $(P \land S) \to R$

If anyone could explain this it would be very helpful! Thanks!

So far this is what I got but I feel it's the wrong approach...

  1. P∧S
  2. P
  3. $P\to (Q \lor R)$
  4. Q∨R