Translate the following inference to logic notation: For all x, if x_4 sleeps, then x_4 is curious. For all x, x_4 is curious if and only if x_4 will sleep. Therefore for all x, if x_4 sleeps, then x_4 is curious.
forall x: P(x) -> Q(x). forall x: Q(x) <-> P(x). Therefore forall x: P(x) -> Q(x).