I am new to discrete math, and I am stuck in a proof that asks me to infer $q \land r$ from the premises $p \land q$ and $p \to r$.
My attempt is first to change $p \to r$ into $\neg p \lor r$ and do the same for inferring $p \land q$ and $p \to r$ to $q \land r$ . But then my proof is stuck. Can anyone give me some advice on how to proceed from here? Or should I not have started this way?
Thank you!
$p$ is true (from $p\land q$), and $p \implies r$, so $r$ is true (modus ponens). Because $q$ is also true (from $p \land q$), then $r$ and $q$ are true, in other words, $q \land r$.