It seems to me that that this is true:
In the category of Sets, transfinite composition of monomorphisms is again a monomorphism.
Explicitly, given a $\lambda$-sequence $$X_0 \xrightarrow{f_1} X_1 \cdots $$ Each map $f_i$ is a monomorphism, then is the canonical $$ g:X_0 \rightarrow colim_{i < \lambda} X_i$$ A monomorphism?
Is this true more generally in other categories?
My thoughts: In sets there are explicit description of colimit. So I suppose we do this by some kind of ordinal induction?
We know this is true for successor ordinals. $\beta \le \lambda$. If $\beta\le \lambda$ is a limit ordinal, then we have $$g:X_0 \rightarrow X_\beta \simeq colim_{j< \beta} X_j$$ By property of ordinals, being totally ordered, exists some $k <\beta$, such that $$f_k(x)=f_k(y) \in X_k$$ By hypothesis, $x=y$.