I realize that there are similar questions to this one which already exist, I want to make sure my argumentation is sound, or if it's not, then perhaps someone can point it out to me.
Since we have that $\gcd(a,b)=1$, this implies that $1\mid a $ $\land$ $1\mid b$ $\implies$ $a=k\cdot 1$ $\land$ $b=m\cdot 1$ for $m,k\in \mathbb{Z}$. Multiplying by $a$ and $b$ respectively on both sides we get that $a^2 = ak\cdot 1$ $\land$ $b^2=bm \cdot 1$. If we let $c=ak$, $l=mb$, then we have that $a^2 = c\cdot 1$ $\land$ $b^2=l\cdot 1$ $\implies$ $1\mid a^2$ $\land$ $1\mid b^2$. This means that there exist integers $x,y$ such that $a^2x+b^2y=1$ $\implies$ $\gcd(a^2,b^2)=1$.
Am I making a leap in logic or doing something that's wrong? Please let me know.