hey proof is not complete yet :D 

I had forgotten cases where there is none relative prime from 0 to n part, in such case but then the even number wont be addition of 2 prime numbers, so in such cases goldbach conjecture is wrong. 

e.g. number being factor of 2 to n  and thereby 2 to n being from C2

then -> if we take a number from there eg. a  = n -k   and a being prime

then a + b = 2n which means b should be also divisible by a  (since 2n is as a is from C2) which makes inherently b nonprime.

so thereby in such cases it could be that Goldbach conjecture is wrong. e.g. in cases like this.

so Goldbach conjecture is only true when there is any factor in C1 in 0 to n half region that is prime. if there is none, Goldbach conjecture is wrong. 

e.g. for numbers like :    2*3* ... * n  ->  for 2n. 

if there is numbers like

e.g.  2n! - n! = n then for those numbers Goldbach conjecture is wrong. 

so to test if Goldbach conjecture is true for every nuber one should prove there is no anyn number like 2n! - n! = n 

so my proof seems as incomplete.