solve using inference and logic equivalence rules

[beast]

without using a truth table prove the following:

(j--->a) and (s--->h) and (j or s) ---> (a--->j) or (h--->s)

[nona.m.nona]

without using a truth table prove the following:

(j--->a) and (s--->h) and (j or s) ---> (a--->j) or (h--->s)

I would suggest proceeding by contrapositive or contradiction. Make assumptions about the "then a-then-j or h-then-s", and see where this leads.

If you are working with a different method of your preference, kindly please reply with your efforts thus far. Thank you.