I'm reading this book as an introduction to category and I have a problem with the definition of the dual category given on page 25. The right way to get the dual category can be described by turning around arrows and permuting the order of their composition. However I don't know how this works out with the statement
$\text{hom}_{\bf{A^{OP}}}(A,B)=\text{hom}_{\bf{A}}(B,A).$
The set of morphisms $\text{hom}_{\bf{A}}(B,A)$ is already defined and the category $\bf{A}^{OP}$ is sopposed to contain morphisms, which are turned around, i.e. morphisms with different domain and codomain. How can these new ones equal the one from the first category? I remember reading this before in a book, and although the english wikipedia doesn't use this expression, the russian (?) one seems to use this definition as well.
So say I have a category $\bf{C}$ with only two objects $a,b$, as well as a single morphism $f$ from $a$ to $b$. From the description I think the dual category $\bf{C}^{OP}$ is the one with $a,b$ and an arrow from $b$ to $a$. How does the formula work if this new morphism isn't contained in $\bf{C}$, so that $\text{hom}_{\bf{C}}(b,a)$ is essentially empty?