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