I've already mentioned in a previous question I am going through the book Discrete Mathematics and Functional Programming by Thomas VanDrunen.
In exercise 3.9.9 from the aforementioned book I've used a premise two times, is it allowed to do so? or is it the case that a given premise should be used only once?
Here's what I am talking about:
(a) $p \implies u$
(b) $x$
(c) $\lnot(p \lor w) \implies r$
(d) $q \implies w$
(e) $x \implies t$
(f) $w \implies u$
(g) $r \lor s$
(h) $r \implies F$
(i) $\therefore t \land s \land u$
This is the way I have proceeded.
(i) $p \implies u$
Using (a), (d), and the transitivity law.
(ii) $t$
By (b), (e), and Modus Ponens.
(iii) $\lnot r$
By (h) and the contradiction law.
(iv) $p \lor w$
Using (c), (iii), Modus Tollens, and Double Negative Law.
(v) $u$
By (iv), (i), (f), and Division Into Cases.
(vi) $s$
Given (iii), (g), and Elimination. And here's exactly where my question arises, since I already used (iii) to deduce (iv), can I use it again over here? Or is it the case that the premises should be used only once? I mean, (iii) remains true the whole time, I don't know why don't use it again.
(vii) $\therefore t \land s \land u$
By (ii), (vi), (v), and Conjunction.
Thanks a lot for your insights.
--
Caleb