The converse of the statement (forallx)(P(x)rightarrowQ(x))(\\forall x)(P(x) \\rightarrow Q(x))(forallx)(P(x)rightarrowQ(x)) is:
(forallx)(Q(x)rightarrowP(x))(\\forall x)(Q(x) \\rightarrow P(x))(forallx)(Q(x)rightarrowP(x))
(existsx)(Q(x)rightarrowP(x))(\\exists x)(Q(x) \\rightarrow P(x))(existsx)(Q(x)rightarrowP(x))
(forallx)(negP(x)rightarrownegQ(x))(\\forall x)(\\neg P(x) \\rightarrow \\neg Q(x))(forallx)(negP(x)rightarrownegQ(x))
(forallx)(negQ(x)rightarrownegP(x))(\\forall x)(\\neg Q(x) \\rightarrow \\neg P(x))(forallx)(negQ(x)rightarrownegP(x))