Is the sum of two distinct primes an injective function on integers? Is the sum of two unique primes always unique? I.e is it an injective function on integers? For example, $89 + 2 = 91$ and there's no other sum of two different primes that's equal to $91$.
It's been a long time since I did a proper proof but I checked it programmatically for the first $10^4$ primes and it seems to hold true. How can I prove that though? 
PS: This was true by definition if it was multiplication, but I don't see the connection from the definition to addition. 

Huh? What!? Ever hear of the Goldbach conjecture? 

Is the sum of two unique primes always unique?

No, not at all. In fact, if $n$ is an even integer greater than $38$, it's probably the sum of two distinct primes in more than one way. For example, $$40 = 37 + 3 = 29 + 11 = 23 + 17.$$
The situation is different for odd numbers, of course. If $n$ is odd, there is only one way, or no way at all, to represent it as a sum of two distinct primes. That is if $n = p + 2$, where $p$ is an odd prime. So with $91$, you observed that $89 + 2 = 91$. But there's no such expression for $87$, since $85$ is obviously not prime.
However, if you allow $-2$, then $87 = 89 + (-2)$. This neither bolsters nor undermines my faith in the Goldbach conjecture.
