recursively enumerable lang. closure proof morphism

Is there any way, how I can prove closure recursively enumerable lang.
under morphism only using turing machines?
I've suggested:
on the first tape I have input
on the second tape there is every word and its substitution

.