Translate the following inference to logic notation: For all x, x_5 will sleep if and only if x_5 is poor. For all x, x_5 will cook. For all x, if x_5 cooks, then x_5 is poor. Therefore for all x, x_5 is poor.
forall x: P(x) <-> Q(x). forall x: R(x). forall x: R(x) -> Q(x). Therefore forall x: Q(x).