Wherein I disprove Goldbachs Conjecture (in one specific case)

golbach conjecture:
every even number is the sum of two primes

lets call the primes p and q

lets call our even number p+q=n

we can go further by establishing two additional variables

u=p-1, v=q-1

therefore every even number is the sum of u+v+2, according to goldbach's own reasoning.

in the simplest case...

p=2, q=2, p+q=4

u=1, v=1, u+v+2 = 4

We can therefore make a further conjecture in the simplest case every sum of two primes, less 2, is the sum of two composites. This likely has connections to the abc conjecture for a variety of reasons. But leaving ancillary discussion aside for a moment...

We can generalize to a statement that every even number is the sum of two odd numbers. And every odd number greater than 1 is the sum of an odd number and an even number.

Finding an even number that is not the sum of (p-1)+(q-1) would therefore be equivalent to disproving the goldbach conjecture. Likewise proving every even number is the sum of (p-1)+(q-1) would be the equivalent of proving it.

Proving all even numbers greater than 2 are the sum of two composites + 2 would be proof of goldbachs conjecture, and finding any example or an equation that proves an example exists such that *some* subset of even numbers are NOT the sum of two composites +2, would disprove the conjecture.

Lets start with a simple example:

2+2=4

because 4-2=2, and two is not the sum of two composite numbers goldbachs conjecture must ipso facto be false.

QED

If I've wildly misapprehended the math, please, somebody who is better at it, correct me.

Honestly if this is actually anything, I'd be floored to discover no one has stumbled on this line of reasoning before.