The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$ with all parts repeated at least once equals the number of partitions of $n$ where all parts must be even or congruent to $3 \pmod 6$. These partition theorems were further extended by Glaisher, Andrews, Subbarao, Nyirenda and Mugwangwavari. In this paper, we utilize the Chinese remainder theorem to prove a comprehensive partition theorem that encompasses all existing partition theorems. We also give a natural generalization of Euler's theorem based on a special complete residue system. Furthermore, we establish interesting congruence connections between the partition function $p(n)$ and related partition functions.