Translate the following inference to logic notation: For all x, y will work if and only if y is excited. For all x, y is excited or y will not work. Therefore for all x, if y works, then y is excited.
forall x: P(x) <-> Q(x). forall x: Q(x) or ~P(x). Therefore forall x: P(x) -> Q(x).