Let $(G_n)_{n \in N}$ be a directed system of groups and $(i_n : G_n \to G)_n$ their colimit. Let $H \leq G$ be a finitely presented subgroup. Then it is well-known that $H$ is finitely presentable, i.e. $\hom(H,-)$ preserves directed colimits (see Corollary 3.13 in LPAC). In particular $H \hookrightarrow G$ factors as $H \xrightarrow{j} G_n \xrightarrow{i_n} G$ for some $n$. We must have that $j$ is a monomorphism. Hence, $H$ is isomorphic to a subgroup of $G_n$.
For the sake of completeness and because it is so easy, here is a direct proof of this factorization: Say that $H$ is generated by $h_1,\dotsc,h_n \in H$, and that the only necessary defining relations are $R_1(h_1,\dotsc,h_n)=\dotsc=R_m(h_1,\dotsc,h_n)=1$, where $R_i$ are words on $n$ letters. Each $h_i$ lies in the image of some $G_m$. Since the system is directed, we can choose some large $m$ which works for all $h_i$. Say $h_i=i_m(g_i)$. Now make $n$ even larger: Each relation already holds in some $G_n$. Since there are only finitely many, they already hold in $G_n$ for some $n \geq m$. But this means precisely that $h_i \mapsto g_i$ extends to a well-defined homomorphism $H \to G_n$.
As you can see, it is crucial here that $G$ is finitely presented. If $G$ is only finitely generated, but not finitely presented, we can write $G$ as the directed colimit of finitely presented groups $G_n$ (by looking at the finite parts of a presentation of $G$), and we can take $H=G$ as a counterexample. There is no reason why $G$ should be isomorphic to a subgroup of $G_n$. In fact, when $G$ has no recursively enumerable set of relations, then Higman has shown (Subgroups of finitely presented groups, Proceedings of the Royal Society of London. Series A, Mathematical and Physical Sciences, 1961) that $G$ does not embed into any finitely presented group.