Translate the following inference to logic notation: For all x, if z were happy, then z is taking a plane. James is happy or it is sunny. For all x, if z takes a plane, then z is happy. If it is sunny, then James is taking a plane. Therefore James is taking a plane.
forall x: P(x) -> Q(x). P(a) or p. forall x: Q(x) -> P(x). p -> Q(a). Therefore Q(a).