$$m^{ed} \equiv m \bmod n$$ $n =pq$, so by Chinese Remainder Theorem it is equivalent to $$m^{ed} \equiv m \bmod 𝑝, m^{ed} \equiv m \bmod q$$ where $n=p\cdot q$
So how did 2 come from 1 by the Chinese remainder theorem? I know Chinese algorithm but How did $m^{ed} \equiv m \bmod p$ and $q$ come?