Theorem redcwlpo 15545

Description: Decidability of real number equality implies the Weak Limited Principle of Omniscience (WLPO). We expect that we'd need some form of countable choice to prove the converse.

Here's the outline of the proof. Given an infinite sequence F of zeroes and ones, we need to show the sequence is all ones or it is not. Construct a real number A whose representation in base two consists of a zero, a decimal point, and then the numbers of the sequence. This real number will equal one if and only if the sequence is all ones (redcwlpolemeq1 15544). Therefore decidability of real number equality would imply decidability of whether the sequence is all ones.

Because of this theorem, decidability of real number equality is sometimes called "analytic WLPO".

WLPO is known to not be provable in IZF (and most constructive foundations), so this theorem establishes that we will be unable to prove an analogue to qdceq 10314 for real numbers. (Contributed by Jim Kingdon, 20-Jun-2024.)

Assertion

Ref	Expression
redcwlpo	|- ( A. x e. RR A. y e. RR DECID x = y -> om e. WOmni )

Distinct variable group:   x, y

Proof of Theorem redcwlpo

Dummy variables f i j z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 109	. . . . . 6 |- ( ( A. x e. RR A. y e. RR DECID x = y /\ f e. ( { 0 , 1 } ^m NN ) ) -> A. x e. RR A. y e. RR DECID x = y )
2		elmapi 6724	. . . . . . . . 9 |- ( f e. ( { 0 , 1 } ^m NN ) -> f : NN --> { 0 , 1 } )
3	2	adantl 277	. . . . . . . 8 |- ( ( A. x e. RR A. y e. RR DECID x = y /\ f e. ( { 0 , 1 } ^m NN ) ) -> f : NN --> { 0 , 1 } )
4		oveq2 5926	. . . . . . . . . . 11 |- ( i = j -> ( 2 ^ i ) = ( 2 ^ j ) )
5	4	oveq2d 5934	. . . . . . . . . 10 |- ( i = j -> ( 1 / ( 2 ^ i ) ) = ( 1 / ( 2 ^ j ) ) )
6		fveq2 5554	. . . . . . . . . 10 |- ( i = j -> ( f ` i ) = ( f ` j ) )
7	5, 6	oveq12d 5936	. . . . . . . . 9 |- ( i = j -> ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) = ( ( 1 / ( 2 ^ j ) ) x. ( f ` j ) ) )
8	7	cbvsumv 11504	. . . . . . . 8 |- sum_ i e. NN ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) = sum_ j e. NN ( ( 1 / ( 2 ^ j ) ) x. ( f ` j ) )
9	3, 8	trilpolemcl 15527	. . . . . . 7 |- ( ( A. x e. RR A. y e. RR DECID x = y /\ f e. ( { 0 , 1 } ^m NN ) ) -> sum_ i e. NN ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) e. RR )
10		1red 8034	. . . . . . 7 |- ( ( A. x e. RR A. y e. RR DECID x = y /\ f e. ( { 0 , 1 } ^m NN ) ) -> 1 e. RR )
11		eqeq1 2200	. . . . . . . . 9 |- ( x = sum_ i e. NN ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) -> ( x = y <-> sum_ i e. NN ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) = y ) )
12	11	dcbid 839	. . . . . . . 8 |- ( x = sum_ i e. NN ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) -> (DECID x = y <-> DECID sum_ i e. NN ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) = y ) )
13		eqeq2 2203	. . . . . . . . 9 |- ( y = 1 -> ( sum_ i e. NN ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) = y <-> sum_ i e. NN ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) = 1 ) )
14	13	dcbid 839	. . . . . . . 8 |- ( y = 1 -> (DECID sum_ i e. NN ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) = y <-> DECID sum_ i e. NN ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) = 1 ) )
15	12, 14	rspc2v 2877	. . . . . . 7 |- ( ( sum_ i e. NN ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) e. RR /\ 1 e. RR ) -> ( A. x e. RR A. y e. RR DECID x = y -> DECID sum_ i e. NN ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) = 1 ) )
16	9, 10, 15	syl2anc 411	. . . . . 6 |- ( ( A. x e. RR A. y e. RR DECID x = y /\ f e. ( { 0 , 1 } ^m NN ) ) -> ( A. x e. RR A. y e. RR DECID x = y -> DECID sum_ i e. NN ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) = 1 ) )
17	1, 16	mpd 13	. . . . 5 |- ( ( A. x e. RR A. y e. RR DECID x = y /\ f e. ( { 0 , 1 } ^m NN ) ) -> DECID sum_ i e. NN ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) = 1 )
18	3, 8	redcwlpolemeq1 15544	. . . . . 6 |- ( ( A. x e. RR A. y e. RR DECID x = y /\ f e. ( { 0 , 1 } ^m NN ) ) -> ( sum_ i e. NN ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) = 1 <-> A. z e. NN ( f ` z ) = 1 ) )
19	18	dcbid 839	. . . . 5 |- ( ( A. x e. RR A. y e. RR DECID x = y /\ f e. ( { 0 , 1 } ^m NN ) ) -> (DECID sum_ i e. NN ( ( 1 / ( 2 ^ i ) ) x. ( f ` i ) ) = 1 <-> DECID A. z e. NN ( f ` z ) = 1 ) )
20	17, 19	mpbid 147	. . . 4 |- ( ( A. x e. RR A. y e. RR DECID x = y /\ f e. ( { 0 , 1 } ^m NN ) ) -> DECID A. z e. NN ( f ` z ) = 1 )
21	20	ralrimiva 2567	. . 3 |- ( A. x e. RR A. y e. RR DECID x = y -> A. f e. ( { 0 , 1 } ^m NN )DECID A. z e. NN ( f ` z ) = 1 )
22		nnex 8988	. . . 4 |- NN e. _V
23		iswomninn 15540	. . . 4 |- ( NN e. _V -> ( NN e. WOmni <-> A. f e. ( { 0 , 1 } ^m NN )DECID A. z e. NN ( f ` z ) = 1 ) )
24	22, 23	ax-mp 5	. . 3 |- ( NN e. WOmni <-> A. f e. ( { 0 , 1 } ^m NN )DECID A. z e. NN ( f ` z ) = 1 )
25	21, 24	sylibr 134	. 2 |- ( A. x e. RR A. y e. RR DECID x = y -> NN e. WOmni )
26		nnenom 10505	. . 3 |- NN ~~ om
27		enwomni 7229	. . 3 |- ( NN ~~ om -> ( NN e. WOmni <-> om e. WOmni ) )
28	26, 27	ax-mp 5	. 2 |- ( NN e. WOmni <-> om e. WOmni )
29	25, 28	sylib 122	1 |- ( A. x e. RR A. y e. RR DECID x = y -> om e. WOmni )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105  DECID wdc 835   = wceq 1364   e. wcel 2164   A.wral 2472   _Vcvv 2760   {cpr 3619   class class class wbr 4029   omcom 4622   -->wf 5250   ` cfv 5254  (class class class)co 5918   ^m cmap 6702   ~~ cen 6792  WOmnicwomni 7222   RRcr 7871   0cc0 7872   1c1 7873   x. cmul 7877   / cdiv 8691   NNcn 8982   2c2 9033   ^cexp 10609   sum_csu 11496

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-iinf 4620  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-mulrcl 7971  ax-addcom 7972  ax-mulcom 7973  ax-addass 7974  ax-mulass 7975  ax-distr 7976  ax-i2m1 7977  ax-0lt1 7978  ax-1rid 7979  ax-0id 7980  ax-rnegex 7981  ax-precex 7982  ax-cnre 7983  ax-pre-ltirr 7984  ax-pre-ltwlin 7985  ax-pre-lttrn 7986  ax-pre-apti 7987  ax-pre-ltadd 7988  ax-pre-mulgt0 7989  ax-pre-mulext 7990  ax-arch 7991  ax-caucvg 7992

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-if 3558  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-tr 4128  df-id 4324  df-po 4327  df-iso 4328  df-iord 4397  df-on 4399  df-ilim 4400  df-suc 4402  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-isom 5263  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-recs 6358  df-irdg 6423  df-frec 6444  df-1o 6469  df-2o 6470  df-oadd 6473  df-er 6587  df-map 6704  df-en 6795  df-dom 6796  df-fin 6797  df-womni 7223  df-pnf 8056  df-mnf 8057  df-xr 8058  df-ltxr 8059  df-le 8060  df-sub 8192  df-neg 8193  df-reap 8594  df-ap 8601  df-div 8692  df-inn 8983  df-2 9041  df-3 9042  df-4 9043  df-n0 9241  df-z 9318  df-uz 9593  df-q 9685  df-rp 9720  df-ico 9960  df-fz 10075  df-fzo 10209  df-seqfrec 10519  df-exp 10610  df-ihash 10847  df-cj 10986  df-re 10987  df-im 10988  df-rsqrt 11142  df-abs 11143  df-clim 11422  df-sumdc 11497

This theorem is referenced by: (None)