Predicate logic

• How to Prove (∀x P(x) → A) → ∃x(P(x) → A)
  A classical proof uses cases on A and requires a nonempty domain; the statement is not generally valid in intuitionistic logic.
• How to Translate an Argument into Symbolic Logic
  Translate an argument by identifying its premises and conclusion, assigning symbols, matching logical connectives, and checking scope and meaning.