Why are two isomorphic objects "categorically the same"? If I understand correctly, in category theory, two objects $X,Y$ are isomorphic if there exists a morphism $f:X\to Y$, and a morphism $f^{-1}:Y\to X$ such that $f\circ f^{-1}=id_Y$ and $f^{-1}\circ f=id_X$.
Why does this imply that we can treat the two objects as "equivalent" within a category?
For example, the categorical product is "unique up to isomorphism". Why does this imply that we can "pretend as if there is only one categorical product"?
 A: A first point is that this process of identifying isomorphic objects comes with practise : with practise, you'll start noticing that any "categorical property" an object has is shared by every object that is isomorphic to it; and you'll start being able to see why it makes sense to identify isomorphic objects.
So the best way to understand what's happening is to take a lot of examples and work through them to see why it makes sense. Now if you want a general argument, here's sort of one :
Suppose $f:A\to B$ is an isomorphism in a category $C$.
Suppose now you have a complicated situation involving $A$, and many other morphisms $f_i :A\to C_i, i\in I$, $g_j: B_j\to A$, satisfying certain equations (some involving $A$, others not involving it). It's the stuff that's interesting to you about $A$. 
Well now you can transport this situation to the same situation about $B$ : put $f'_i = f_i\circ f^{-1} : B\to C_i$, $g'_j := f\circ g_j : B_j\to B$. This situation will satisfy the same equations as the one before : those not involving $A$ will be the same by replacing every $f_i, g_j$ by $f'_i, g'_j$; those involving $A$ will be the same but replacing every occurrence of $A$ by $B$ and conjugating by $f,f^{-1}$ to make things consistent. That is because $ff^{-1} = id_B, f^{-1}f =id_A$ and identities are neutral.
What this means is that if you have an interesting situation about an object $A$ in a category $C$, this situation being all about $C$-properties, and an isomorphism $f:A\to B$, then by conjugating by $f$ or $f^{-1}$ whenever it makes sense will give the same interesting situation about the object $B$. 
In other words, along $f$, you cannot distinguish between $A$ and $B$ by properties of $C$: if you cannot distinguish between them, if they have the same properties, they're "essentially the same" - that's what we mean when we say we can identify isomorphic objects. 
Note, however, that the identification, the process of saying they are the same involves not just saying that $A$ and $B$ are isomorphic, but picking a specific isomorphism. It's very important to note that we can identify to isomorphic objects so long as we have a specific isomorphism in mind. 
For instance, for the categorical product, there is a unique isomorphism that commutes with the projections: it's the one we're considering. 
A: The following answer provide another, hopefully convincing, argument on why in category theory one can indentify isomorphic objects.
Categories of (multi-sorted) structures.
When dealing with categories of structures isomorphisms are bijective mapping preserving the structure. Basically this amounts saying that isomorphisms are ways to parametrize/rename the elements of one structure with names of another.
In this context changing the elements used for representing the structure does not change the structures, exactly like changing between decimal or hexadecimal basis does not change the structure of natural numbers. So isomorphic structures can and should be considered the same. 
Also, when we fix the isomorphism we can identify elements of the two structures that are related by the isomorphism (but we have to keep track of the isomorphism considered, since different isomorphisms identify different pairs of elements).
With this little premise we can provide two reasons for why isomorphic objects should be considered the same in CT.
Philosophical reason.
One why to think about categories is to consider the objects as some abstract structures (like elements of a set can be thought as abstract points) and the morphisms as some abstract ways of relating them. 
If we follow this point of view, and think category theory as a theory of abstract structures, then it should be natural to consider equal isomorphic objects, by abstaction of the structures' paradigm "isomorphic structures are the same".
Technical reason.
In this part we will make the previous argument formal but in order to do so we need a little premise on presheaves, also I will show an application of Yoneda Lemma which I consider particularly enlightening, so hold on and follow me.
A presheaf, on a category $\mathbf C$, is a functor $P \colon \mathbf C^\text{op} \to \mathbf{Set}$. You can think a presheaf as a multi-sorted algebra whose carriers are the sets $(P(c))_{c \in \mathbf C}$ and operations are the $(P(\sigma))_{x,y \in \mathbf C,\sigma \in \mathbf C[x,y]}$. Natural transformations are exactly homomorphisms for these algebras.
Now the yoneda embedding
$$ y \colon \mathbf C \to [\mathbf C^\text{op},\mathbf {Set}]$$
$$y(c) = \mathbf C[-,c]$$
provides an isomorphism between the category $\mathbf C$ (which as an algebraic structure) with a category of presheaves, namely the category of the presheaves of the representable presheaves.
From the discourse on isomorphisms of structures above we should think these two categories as being the same and we could identify (via the yoneda embedding) every object $c$ with the algebraic structure $y(c)=\mathbf C[-,c]$.
We now are ready to our final claim.
Let $c_1$ and $c_2$ be two isomorphic objects of $\mathbf C$. Clearly the algebras $\mathbf C[-,c_1]$ and $C[-,c_2]$ must be isomorphic as well.
Now putting together what we said in the beginning,
we can identify the $c_i$'s with their algebras, the $\mathbf C[-,c_i]$'s. 
But since the $\mathbf C[-,c_i]$'s are isomorphic structures they should be regarded as the same, and so by a transitivity argument it should be natural to consider also $c_1$ and $c_2$ to be the same.
Hopefully this more practical argument will help you strenghten the belief that isomorphic objects can and should be considered the same.
I apologize for being so long, but I do not think I could have shorten this answer.
A: In a category we can only talk about properties in terms of morphisms and objects and their relations (diagrams). Any object that can be talked about or defined in those terms can be replaced by an isomorphic object without changing the truth of statements. So within the framework of category theory, these objects can be interchanged everywhere they are used in statements. This is what identity "means" within a logical framework.
A: There are some really good answers here. 
Here is another one which try to approach the question from another perspective.
Two categories are considered the same if they are related by categorical equivalences. These are basically couples of functors which are inverse to each other up to natural-isomorphisms.
One of the key property is that every category $\mathbf C$ is equivalent to its skeleton,
that is basically a full-subcategory containing a unique object for each isomorphism-class of objects of $\mathbf C$.
This implies that when we are studying a category we could pass to one of its skeleton where isomorphic objects are the same. So it does make sense to consider two isomorphic objects as the same, because when seen through the equivalence they are really the same.
One could wonder on why we want to use the concept of equivalence of categories in the first place. But that is a long story for another time.
Edit: and that time is now.
Basically the reason why equivalence is correct notion of sameness for categories is due to the following fact.

Categorical equivalences are functors that preserve the truth of logical formulas in the categories, seen as models of the theory of categories.

This means that every closed statement that holds in a category does hold in every equivalent category.
I hope this helps.
