as a counter-example Z2 x Z2 is not cyclic, as it has no element of order 4:
(0,0) is of order 1
(1,0) + (1,0) = (0,0)
(0,1) + (0,1) = (0,0)
(1,1) + (1,1) = (0,0)
so all other elements are of order 2.
in fact, it is not hard to show that if G is abelian (and AxB is abelian if A and B are, which is certainly true if A and B are cyclic) that
|xy| ≤ lcm(|x|,|y|), so if gcd(m,n) ≠ 1, then Zm x Zn cannot possibly be isomorphic to Zmn, since there aren't any elements of order mn.
on the other hand, the CRT is equivalent to saying
k → (k (mod m), k (mod n)) is an isomorphism of Zmn with Zm x Zn when gcd(m,n) = 1. this is clearly a homomorphism, so showing it's surjective is the hard part (which is really the same thing as showing (1,1) generates the direct product).
(actually the CRT usually gives the inverse isomorphism, and the construction of the solution to:
x = a mod m
x = b mod n
actually gives us the inverse isomorphism, which is the pre-image of the isomorphism above of (a,b):
x = an[n-1]m + bm[m-1]n (mod mn),
where [n-1]m denotes the inverse of n (mod m), which exists only when gcd(m,n) = 1).
i always knew that that "least common multiple" stuff they made me suffer through in grade school while doing fractions would pay off someday.