This is a HW question
Suppose $B \subseteq A$ and $R_a$ is an equivalence relation on A. Let $R_b$ the restriction of $R_a$ to B; that is, $R_b = \{(a,b) \in R_a : a,b \in B\} $ Is $R_b$ an equivalence relation on B.
I know that for am equivalence relation I need the the relation to be reflexive, antisymmetric and transitive.
To me this seems too simple and usually when i think of a HW question that way I am wrong. My reasoning is that if $(a,a) \in A$ then $(a,a) \in B $ because $B \subseteq A$ therefore $R_b$ is reflexive. Then similarly the anti symmetric and transitive properties can be shows.
Your reasoning is not quite right. In order to show that $R_b$ is an equivalence relation on $B,$ you must show the following:
It is fairly straightforward to show each of these using the definition of $R_b,$ since $R_a$ is an equivalence relation on $A$ and $B\subseteq A$. Let me prove the second property as an example, and leave the other two to you.
Note that no mention was made of ordered pairs in $A$ or $B$. (1) There's no reason to suspect that there are any such things. (2) Even if there are ordered pairs in $A$ or $B$, that is not connected to ordered pairs in $R_a$ or $R_b,$ so has nothing to do with the problem at hand. (3) Even if there is some ordered pair in $A,$ we can't conclude that that ordered pair is in $B$ ($B$ is the subset here).