Theorem rpnnen2 14955

Description: The other half of rpnnen 14956, where we show an injection from sets of positive integers to real numbers. The obvious choice for this is binary expansion, but it has the unfortunate property that it does not produce an injection on numbers which end with all 0's or all 1's (the more well-known decimal version of this is 0.999... 14612). Instead, we opt for a ternary expansion, which produces (a scaled version of) the Cantor set. Since the Cantor set is riddled with gaps, we can show that any two sequences that are not equal must differ somewhere, and when they do, they are placed a finite distance apart, thus ensuring that the map is injective.

Our map assigns to each subset A of the positive integers the number sum_ k e. A ( 3 ^ -u k ) = sum_ k e. NN ( ( F ` A ) ` k ), where ( ( F ` A ) ` k ) = if ( k e. A , ( 3 ^ -u k ) , 0 ) ) (rpnnen2lem1 14943). This is an infinite sum of real numbers (rpnnen2lem2 14944), and since A C_ B implies ( F ` A ) <_ ( F ` B ) (rpnnen2lem4 14946) and ( F ` NN ) converges to 1 / 2 (rpnnen2lem3 14945) by geoisum1 14610, the sum is convergent to some real (rpnnen2lem5 14947 and rpnnen2lem6 14948) by the comparison test for convergence cvgcmp 14548. The comparison test also tells us that A C_ B implies sum_ ( F ` A ) <_ sum_ ( F ` B ) (rpnnen2lem7 14949).

Putting it all together, if we have two sets x =/= y, there must differ somewhere, and so there must be an m such that A. n < m ( n e. x <-> n e. y ) but m e. ( x \ y ) or vice versa. In this case, we split off the first m - 1 terms (rpnnen2lem8 14950) and cancel them (rpnnen2lem10 14952), since these are the same for both sets. For the remaining terms, we use the subset property to establish that sum_ ( F ` y ) <_ sum_ ( F ` ( NN \ { m } ) ) and sum_ ( F ` { m } ) <_ sum_ ( F ` x ) (where these sums are only over ( ZZ>= ` m )), and since sum_ ( F ` ( NN \ { m } ) ) = ( 3 ^ -u m ) / 2 (rpnnen2lem9 14951) and sum_ ( F ` { m } ) = ( 3 ^ -u m ), we establish that sum_ ( F ` y ) < sum_ ( F ` x ) (rpnnen2lem11 14953) so that they must be different. By contraposition (rpnnen2lem12 14954), we find that this map is an injection. (Contributed by Mario Carneiro, 13-May-2013.) (Proof shortened by Mario Carneiro, 30-Apr-2014.) (Revised by NM, 17-Aug-2021.)

Assertion

Ref	Expression
rpnnen2	|- ~P NN ~<_ ( 0 [,] 1 )

Proof of Theorem rpnnen2

Dummy variables x n are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2622	. 2 |- ( x e. ~P NN |-> ( n e. NN |-> if ( n e. x , ( ( 1 / 3 ) ^ n ) , 0 ) ) ) = ( x e. ~P NN |-> ( n e. NN |-> if ( n e. x , ( ( 1 / 3 ) ^ n ) , 0 ) ) )
2	1	rpnnen2lem12 14954	1 |- ~P NN ~<_ ( 0 [,] 1 )

Syntax hints:   ifcif 4086   ~Pcpw 4158   class class class wbr 4653   |-> cmpt 4729  (class class class)co 6650   ~<_ cdom 7953   0cc0 9936   1c1 9937   / cdiv 10684   NNcn 11020   3c3 11071   [,]cicc 12178   ^cexp 12860

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-inf2 8538  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013  ax-pre-sup 10014

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-fal 1489  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-se 5074  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-isom 5897  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-er 7742  df-pm 7860  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959  df-sup 8348  df-inf 8349  df-oi 8415  df-card 8765  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269  df-div 10685  df-nn 11021  df-2 11079  df-3 11080  df-n0 11293  df-z 11378  df-uz 11688  df-rp 11833  df-ico 12181  df-icc 12182  df-fz 12327  df-fzo 12466  df-fl 12593  df-seq 12802  df-exp 12861  df-hash 13118  df-cj 13839  df-re 13840  df-im 13841  df-sqrt 13975  df-abs 13976  df-limsup 14202  df-clim 14219  df-rlim 14220  df-sum 14417

This theorem is referenced by:  rpnnen  14956  opnreen  22634