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