Proof question. Help please!
Suppose \[P \rightarrow Q, R \rightarrow \not Q \]
Prove then \[P \rightarrow \not R \]
prove if P then not R... what are we doing? Are we using truth tables? boolean algebra
no truth tables
boolean algebra
so boolean algebra? that's going to be tought because I learned it the =truth table way omg... sorry man
but I do know that you can use truth tables to verify an answer. so that's a good check.
I just don't get what to do with if then statements: do I change the form or is it already in logical form?
is there another way to write if then statements
You either have to really prove that the statement is true, or you have to disprove it meaning prove the negation of it which is just if not p then r.
err Q ---> not R
why would you want to do that... you can't change theorems.
Well because we would assume P and therefore Q which means Q ---> not R which is what I want
because if p implies Q and Q implies not R, then P implies not R, right?
now I'm lost D:. I'm sorry I'm a newb at proofs unless it's number theory.
okay well thanks anyway
assume P -> R then P -> not Q but contradiction hence assumption must be false, not (P -> R) must be true hence (P -> not R) is true
your way of doing it is also correct and more rigorous: (R -> not Q) = (Q -> not R) hence, P ->Q leads to P -> not R
basically, (if A then B), is equivalent as (if not B then not A)
okay, I just wasn't sure if I could do that. I'm not sure if I can apply a negation to an if then
u can always do that
and what happens if I do
so does the conditional flip with a negation?
yes exactly
Oh okay, so what is the name of that function
I have to list all of my steps
(R -> not Q) is equivalent as (Q -> not R) hence, P -> R leads to P -> Q
this is as rigorous as it gets
but aren't we assuming the negation function is true without stating it?
Well thanks for the help PHP
np
Join our real-time social learning platform and learn together with your friends!