Proof of Goldbach's binary conjecture

Abstract

: The proof includes a column of similar steps and its aspects, treated in a special way. The concept of Unique Path of primes is explained and its effects are shown. In the midway of the proof, it is postponed for a while and a deviation from the course is taken to introduce a probably new axiom. Afterwards the proof restarts again, then definitions of 'list' & 'choice' are given and a claim is proved regarding them, two lemmas and their effects on the choice of a recycled prime discussed, hence using the axiom and other results the conjecture is proved. Please note : Every symbol 'p' with or without any suffix denotes some prime number. a|b means a divides b and a®b means a doesn't divide b. n is a natural number. The word 'prime' will hereafter mean prime number and 'even' mean even positive integer. The sign ' ' means 'there ∃ exist'. alternative