Is it true, that odd numbers have only odd divisors? If yes, what would a formal proof look like?
Yes. If $a=2k\vert b$ then there is $d$ such that $b=2kd$, which means $b$ is even.
A number $n$ is odd if $2$ does not divide $n$.
Let $d$ be a divisor of $n$. If $d$ is not odd, then $2\mid d$. But then $2\mid n$ too, so that $n$ cannot be odd as well.
Then odd numbers cannot have divisors that are not odd.
You can use the contrapositive:
If a number has an even divisor then it is even.
This is easily proved because "to divide" is transitive: $$ 2 \mid d \mid n \implies 2 \mid n $$