Translate the following inference to logic notation: If Charles cooks, then Charles is bored. For all x, if x were bored, then x is cooking. Therefore if Charles were bored, then Charles is cooking.
P(a) -> Q(a). forall x: Q(x) -> P(x). Therefore Q(a) -> P(a).