Translate the following inference to logic notation: Thomas is playing a game or William is happy. For all x, y will work. For all x, if y plays a game, then y is not working. Therefore William is happy.
P(a) or p. forall x: Q(x). forall x: P(x) -> ~Q(x). Therefore p.