Can we prove undefinability theorem first (using techniques that are different from Godel's) and then deduce Incompleteness from it?

Question

I asked a related question about the matter here in philosophy platform where it was suggested to ask a modified version of the question on Math.se

My question is, Is there any known way to prove undefinability theorem using technique different than that of Godel and then deduce Incompleteness from it?