I'm used to the natural deduction rules, myself (elimination and introduction rules for each symbol). You want to assume , and show that is the result.
So, start with:
assumption
assumption
assumption
intro
elimination
Can you take it from here?
I am having trouble solving the following problem:
Prove that:
follows from the premisesCode:A -> (C /\ D)
My first question is:Code:(A V D) -> C (A /\ C) -> D
Are there any rules regarding what can you do when you have something of the form
Like, is it possible to decompose it in something likeCode:(A V B) -> C?
? It seems like you can't. I've triedCode:(A -> C) V (B -> C)
But then I don't know what to do with that, too.Code:-(A V B) V C
Any guidance here would be appreciated
Yeah, that works. You have a few redundant steps there. I would do it this way, picking up from where I left off:
1. assumption
2. assumption
3. assumption
4. intro: 3
5. elim: 1, 4
6. intro: 3, 5
7. elim: 2, 6
8. intro: 5, 7
Therefore,
9. intro: 3, 8.
LaTeX Tutorial located on the LaTeX Help subforum.
Edit: Oh, I guess you can use LaTeX already. You can use \color{red} among some other color choices, to avoid having to drop out of LaTeX like that. For example:
(I realise you may or may not have been referring to formatting.)