Translate the following inference to logic notation: There is at least one x for which if x were fast, then x is bored. For all x, x is bored or x is not a lawyer. For all x, if x were bored, then x is fast. Therefore there is at least one x for which if x were a lawyer, then x is fast.
exists x: P(x) -> Q(x). forall x: Q(x) or ~R(x). forall x: Q(x) -> P(x). Therefore exists x: R(x) -> P(x).