# Logic: Negating if then statement

1. Sep 7, 2010

### mohabitar

I'm trying to negate this statement and wanna make sure I'm doing it right.
(p$$\vee$$q) ---> (p $$\wedge$$ q)

So I dont negate both sides do I or else that would just make them equal out again? So I just negated the left side, so $$\neg$$(p$$\vee$$q) is equivalent to $$\neg$$p$$\wedge$$$$\neg$$q

So thats the answer I got:
$$\neg$$p$$\wedge$$$$\neg$$q ---> (p $$\wedge$$ q)

2. Sep 8, 2010

### JonF

p=>q = ~p or q

Using de morgans law : ~(p=>q) = ~(~p or q) = p and ~q

So ~(p or q implies p and q) = p or q and ~(q and p) -> p or q and ~q or ~p -> p xor q

3. Sep 8, 2010

### mohabitar

Sorry Im new to all this and what you have up there is very confusing. I cant really tell whats going on and what the final answer is. Anyway you can use the actual math symbols and break the steps into separate lines? I'd really appreciate it :)

4. Sep 8, 2010

### vela

Staff Emeritus
JonF's already done too much work for you. It's against the forum rules to simply do the problems for you. You're supposed to work them out yourself.

Use the fact that you can write p→q as (~p)∨q. The latter form is easier to see how to negate.

5. Sep 8, 2010

### mohabitar

Ya you're right sorry..I was just having a hard time understanding the symbols he was using but I think I got it now..so the final answer I got was:

(p v q) ^ (~p v ~q)