**Get**the proof of

**his age**,

**Joe"**.

Insert the 4 bold words into alphametic equations:

(I)

**W1+W2=W3**

(II)

**W1-W2=W4**

in such an order that there will be a unique set of non-zero digits (each distinct letter representing a distinct digit) fitting as a solution.

Which digits represent the nine letters a,e, ...t?

REM: I've built this puzzle bottom-up, so there might be solutions different from mine - unlikely, but always welcome.