Go ahead, then. Describe how you'd construct the diagonal.
The world awaits your revelation, particularly the part where you have an index into a string of 0's and 1's that isn't a natural number.
jsfisher,
1) Any given P(
N) distinct member ( including {},(1,2,3,..) and any P(
N) member between {} and {1,2,3,...} ) is translatable to <0,1> distinct form.
2) No P(
N) member is an
N member (even under the translation to <0,1> forms, a P(
N) member is an infinite <0,1> distinct form, where a
N member is a finite <0,1> distinct form exactly because the right infinitely long ...00000... of a given
N member (where a mirror image of <0,1> forms is used), is ignored ).
3) The diagonal method is used on the P(
N) members, and the P(
N) member that is not in the range of P(
N), is the inverse of such a diagonal.
4) No 1-to-1 mapping with
N members is needed in order to explicitly define the P(
N) member that is not in the range of P(
N).
5) Since P(
N) is incomplete, then if a 1-to-1 mapping is used between P(
N) members and
N members, it is discovered that also
N is incomplete.
(1) to (4) are already shown in
http://www.internationalskeptics.com/forums/showpost.php?p=6814651&postcount=14126.