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