Math Is Fun Forum

Steve James

Guest

Discrete Math - Prove p → q using inference laws and equivalences. Arg

0
down vote
favorite
I am trying to figure out the following proof but not sure if what I have so far makes sense. Can you guys help me?

1. (r ∧ ¬s) ∨ (q ∧ ¬s)
2. ¬s → ((p ∧ r) → u)
3. u → (s ∧ ¬t)
-----------------------
Prove from the previous arguments. p → q

4. (p ∧ r) → (s ∧ ¬t) Hypothetical Argument 2 and 3
5. ¬s → (s ∧ ¬t) Hypothetical Argument 2 and 3
6.
Where should I go from here and is step 6 even valid?

anonimnystefy

Real Member

From: Harlan's World

Registered: 2011-05-23

Posts: 16,049

Re: Discrete Math - Prove p → q using inference laws and equivalences. Arg

I suggest you first change the implications to conjunctions. They are much easier to manipulate.

---

“Here lies the reader who will never open this book. He is forever dead.
“Taking a new step, uttering a new word, is what people fear most.” ― Fyodor Dostoyevsky, Crime and Punishment
The knowledge of some things as a function of age is a delta function.