UniMaths
Free chapterTry everything here: cards, proofs and practice. Sign up free to save your progress and unlock all 7 chapters.Sign up free
PROOF · 1

Logic and statements

13 concepts · 67 questions

← Back to cards1 / 10
PROOFStep●○○○○new1 Logic and statements
Step 1 of 4 towards a full problem
The problem

Show that (P∨Q)⇒R ≡ (P⇒R)∧(Q⇒R)(P\vee Q)\Rightarrow R\ \equiv\ (P\Rightarrow R)\wedge(Q\Rightarrow R), and use this to explain why a proof by cases is valid.

Rewrite (P∨Q)⇒R(P\vee Q)\Rightarrow R without ⇒\Rightarrow.