I have the theorem below, similar to the Chinese remainder theorem, written in some old notes of mine during my undergraduate degree and have a proof for it, but I want to use it in some work now and would rather avoid writing out a full proof. I am looking for a book or some other material I can refer to with this result in it. I have looked at several number theory books but have been unable to find it stated.
A system of $ r$ linear congruences $$\begin{align*} x &\equiv b_{1}\pmod{n_1}\\ x &\equiv b_{2}\pmod{n_2}\\ &\vdots\\ x &\equiv b_{r}\pmod{n_r}\\ \end{align*}$$ has a simultaneous solution if and only if $ hcf( n_{i} , n_{j} ) $ divides $ b _{j} - b _{i} $ for each pair $ i , j \in \{ 1, \dots , r \} $. Furthermore a solution is unique modulo $ lcm ( n_{1} , n_{2} , \dots , n _{r} ) $ if it exists.