language, logic and discrete math

can anyone prove

[(p->q) ^ (q -> r)] 0> (p -> r) <=> T?

Don't use the truth table, use the implication
I guess this won't help you so
¬ = not
+ = or
* = and, ^
p->q = ¬p+q

((p->q) * (q->r))->(p->r)

¬((p->q) * (q->r)) + (p->r)
¬(p->q) + ¬(q->r) + ¬p + r
¬(¬p+q) + ¬(¬q+r) + ¬p + r
p*¬q + q*¬r + ¬p + r
r + q + ¬p + ¬q
q+¬q + ...
1

r + ¬r*q = r+q
¬p + p*¬q = ¬p+¬q
can anyone prove


dear friend, the real question is can you prove ... that.
Well said.
Topic archived. No new replies allowed.