Prove: $b|a \iff A \subseteq B$

Question

Let $a, b \in \mathbb Z$, and

$$ A = \{x \in \mathbb Z : a|x\} $$ $$ B = \{y \in \mathbb Z : b|y \} $$ Prove: $$b|a \iff A \subseteq B$$

---

Assuming $A \subseteq B$ , I can understand that there exists and element in sets A and B where $x = y$ and since $ka = x$ and $lb=y$ for some integers $ k $ and $l$, $ka=lb$ and so $$ b = (k/l) a $$ The only problem I am getting now is that I can't prove that $k/l$ is an integer. I have hit a wall.

Answer 1

Let's be methodical and prove the equivalence as a double implication.

So assume $b|a$. And consider $x\in A$. This means $a|x$. But $b|a$ so we have $a=k\cdot b$ and $x=k'\cdot a$; so we have $x=kk'\cdot b$ and $b|x$ i.e $x\in B$. Therefore $A\subset B$

Now assume $A\subset B$ meaning any element of $A$ is an element of $B$. In particular $a\in A\subset B$ because $a|a$; so $a\in B$ i.e $b|a$.

And we're done.

Answer 2

Assume $A\subset B.$

Notice $a|a $ so $a\in A\subset B $ so $b|a $.

Assume $b|a $

then $a=kb $. If $x \in A $ then $x=ma=mkb $ so $b|x $ so $x\in B $. So $A \subset B$