I am wondering about the use of a meta-meta-theory in proving statements of the form "$\phi$ is independent of $\mathcal{T}$" in mathematical logic.
Short question: Is using a result from the meta-meta-theory, for example a nonstandard model of the meta-theory, allowed in proving/disproving the independence of a result in the theory itself?
Long question:
Assume for the sake of this post that we are working in the framework of model theory, and that we are using ZFC to develop all of the ideas (languages, structures, theories, and so on). Call this meta-theory mZFC (distinguished from the theory of ZFC which is a formal set of statements in mZFC). Consider the question of whether ZFC proves the continuum hypothesis, i.e. $$ \text{Does } ZFC \vDash CH ? \;\; \text{Does } ZFC \vDash \lnot CH ? $$ My understanding (which could be incorrect) is that we can construct specific models of $ZFC$ in $mZFC$, call them $M$ and $M'$, such that $M, M' \vDash ZFC$, but $M \vDash CH$ and $M' \vDash \lnot CH$, showing that the above statements are both false, i.e. that CH is independent of ZFC.
Now, it seems that since we have shown $CH$ to be independent of $ZFC$, that in future work we could reasonably assume that the meta-theory $mZFC$ satsifies (or does not satisfy) $mCH$ (since models of the meta-theory exist either way). For instance, hypothetically we could prove the independence of some other sentence $\phi$ from $ZFC$ by constructing models $N, N' \vDash ZFC$ which do and do not satisfy $\phi$--but whose existence depends on $mCH$! Specifically, I am imagining a situation where we deliberately construct a model $N$ such that $\aleph_0 < |N| < 2^{\aleph_0}$.
Would such a construction be considered a valid proof that $\phi$ is independent of $ZFC$, or would it be considered a proof of some other (more meta) result? If the former, is there a standard way to distinguish exactly how many levels of meta were used in an independence result--or is multiple meta levels equivalent to just one?
I hope my question is not too confusing! Thanks.