The proof is the same as in cauchy-sequence-in-mean. I will only indicate the changes needed if you do not assume that $\mu$ is not finite. I use $\mathfrak{M}$ to denote the $\sigma$-algebra as in my previous answer.
Instead of $\mathfrak{M}$ you consider the family
$$\mathfrak{M}':=\{E\in \mathfrak{M}:\, \mu(E)<\infty\}.$$
You can identify $\mathfrak{M}'$ with a closed subset of $L^1$. Then you define $\mathcal{C}_{k}$ as before, using $\mathfrak{M}'$ instead of $\mathfrak{M}$.
To prove that $\mathcal{C}_{k}$ is closed in $L^1$ you consider $\left\{ \chi_{E_{j}}\right\} \subset\mathcal{C}_{k}$ converging in $L_{1}$
to some function $f$. By extracting a subsequence (not relabeled), if
necessary, you can assume that $\chi_{E_{j}}\left( x\right) \rightarrow f(x)$
for $\mu$ a.e. $x\in X$ and that $\chi_{E_{j}}(x)\le g(x)$ for all $x$ and $j$ and for some integrable function $g$ (see Lemma below). Hence, you can apply Lebesgue dominated convergence theorem as before to conclude that $\mathcal{C}_{k}$ is closed. You then continue as before and use Baire's theorem.
Lemma Assume that
$f_n\to f$ in $L^1$. Then there is a subsequence such that $|f_n(x)|\le g(x)$ for some integrable function $g$.
Proof: For every $k\in\mathbb{N}$ find an
integer $n_{k}\in\mathbb{N}$ such that
$$
\int_{X}\left\vert f_{n_{k}}\,-f\right\vert \,d\mu\leq\frac{1}{2^{k}}.
$$
The sequence $\left\{ n_{k}\right\} _{k\in\mathbb{N}}$ can be chosen to be
strictly increasing. For $x\in X$ define
$$
w\left( x\right) :=\sum_{k=1}^{\infty}\left\vert f_{n_{k}}\left( x\right)
-f\left( x\right) \right\vert .
$$
Then
$$
\int_{X}w\,d\mu\leq1.
$$
Hence $w\left( x\right)
<\infty$ for $\mu$ a.e. $x\in X$. At any such point $x\in X$ we have that
$$
\lim_{k\rightarrow\infty}\left\vert f_{n_{k}}\left( x\right) -f\left(
x\right) \right\vert =0.
$$
Finally, observe that
$$
\left\vert f_{n_{k}}\left( x\right) \right\vert \leq\left\vert f_{n_{k}%
}\left( x\right) -f\left( x\right) \right\vert +\left\vert f\left(
x\right) \right\vert \leq w\left( x\right) +\left\vert f\left( x\right)
\right\vert =:g\left( x\right)
$$
for all $x\in X$ and $k\in\mathbb{N}$. This concludes the proof.