I'm going to post another answer with the intent of very simplified mathematical language for, as OP states, $9$th graders.
I assume you know how to define the prime numbers, and can likely list the first few readily. You therefore know there is exactly one even prime, $2$, and all other primes are odd.
Now imagine if both $A$ and $B$ are both odd primes. The difference of two odd numbers is even, and the sum of two odd numbers is even. But then $A-B$ and $A+B$ cannot be prime--there is only one even prime!
Therefore either $A$ or $B$ must be equal to $2$. As $A$ is larger, we see $B=2$.
We now see that we have three odd primes: $(A-2, A, A+2)$. Of this set of numbers, exactly one must be divisible by $3$. We'll show using remainders, as if we were doing grade school division with remainders (which turns out to have powerful applications in higher math).
Suppose $A$ is divisible by $3$: That means $A$ has a remainder of $0$ when divided by $3$. $A+2$ must then have a remainder of $2$. And $A-2$ will have a remainder of $1$. It's not obvious, but this stays true no matter what remainder $A$ actually has--try it out for yourself!!
Now we have three primes, one of which must be divisible by $3$. There's only one prime that first the bill: $3$. Since $1$ and $-1$ aren't prime, we have to have $3 = A-2$. Then our other two numbers are $A=5$ and $A+2=7$.
The use of remainders to prove things like this involves modular arithmetic. Link is to Wikipedia, if you want to learn more.