Users' Mathboxes Mathbox for Jim Kingdon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  nconstwlpolem Unicode version

Theorem nconstwlpolem 13584
Description: Lemma for nconstwlpo 13585. (Contributed by Jim Kingdon, 23-Jul-2024.)
Hypotheses
Ref Expression
nconstwlpo.f  |-  ( ph  ->  F : RR --> ZZ )
nconstwlpo.0  |-  ( ph  ->  ( F `  0
)  =  0 )
nconstwlpo.rp  |-  ( (
ph  /\  x  e.  RR+ )  ->  ( F `  x )  =/=  0
)
nconstwlpo.g  |-  ( ph  ->  G : NN --> { 0 ,  1 } )
nconstwlpo.a  |-  A  = 
sum_ i  e.  NN  ( ( 1  / 
( 2 ^ i
) )  x.  ( G `  i )
)
Assertion
Ref Expression
nconstwlpolem  |-  ( ph  ->  ( A. y  e.  NN  ( G `  y )  =  0  \/  -.  A. y  e.  NN  ( G `  y )  =  0 ) )
Distinct variable groups:    x, A    y, A    x, F    y, F    i, G, y    ph, x    ph, y, i
Allowed substitution hints:    A( i)    F( i)    G( x)

Proof of Theorem nconstwlpolem
Dummy variable  a is distinct from all other variables.
StepHypRef Expression
1 breq2 3965 . . . . . . . . . . . 12  |-  ( x  =  A  ->  (
0  <  x  <->  0  <  A ) )
2 fveq2 5461 . . . . . . . . . . . . 13  |-  ( x  =  A  ->  ( F `  x )  =  ( F `  A ) )
32neeq1d 2342 . . . . . . . . . . . 12  |-  ( x  =  A  ->  (
( F `  x
)  =/=  0  <->  ( F `  A )  =/=  0 ) )
41, 3imbi12d 233 . . . . . . . . . . 11  |-  ( x  =  A  ->  (
( 0  <  x  ->  ( F `  x
)  =/=  0 )  <-> 
( 0  <  A  ->  ( F `  A
)  =/=  0 ) ) )
5 elrp 9540 . . . . . . . . . . . . . 14  |-  ( x  e.  RR+  <->  ( x  e.  RR  /\  0  < 
x ) )
6 nconstwlpo.rp . . . . . . . . . . . . . 14  |-  ( (
ph  /\  x  e.  RR+ )  ->  ( F `  x )  =/=  0
)
75, 6sylan2br 286 . . . . . . . . . . . . 13  |-  ( (
ph  /\  ( x  e.  RR  /\  0  < 
x ) )  -> 
( F `  x
)  =/=  0 )
87expr 373 . . . . . . . . . . . 12  |-  ( (
ph  /\  x  e.  RR )  ->  ( 0  <  x  ->  ( F `  x )  =/=  0 ) )
98ralrimiva 2527 . . . . . . . . . . 11  |-  ( ph  ->  A. x  e.  RR  ( 0  <  x  ->  ( F `  x
)  =/=  0 ) )
10 nconstwlpo.g . . . . . . . . . . . 12  |-  ( ph  ->  G : NN --> { 0 ,  1 } )
11 nconstwlpo.a . . . . . . . . . . . 12  |-  A  = 
sum_ i  e.  NN  ( ( 1  / 
( 2 ^ i
) )  x.  ( G `  i )
)
1210, 11trilpolemcl 13557 . . . . . . . . . . 11  |-  ( ph  ->  A  e.  RR )
134, 9, 12rspcdva 2818 . . . . . . . . . 10  |-  ( ph  ->  ( 0  <  A  ->  ( F `  A
)  =/=  0 ) )
1413necon2bd 2382 . . . . . . . . 9  |-  ( ph  ->  ( ( F `  A )  =  0  ->  -.  0  <  A ) )
1514imp 123 . . . . . . . 8  |-  ( (
ph  /\  ( F `  A )  =  0 )  ->  -.  0  <  A )
1610adantr 274 . . . . . . . . . . . 12  |-  ( (
ph  /\  E. y  e.  NN  ( G `  y )  =  1 )  ->  G : NN
--> { 0 ,  1 } )
17 simpr 109 . . . . . . . . . . . . 13  |-  ( (
ph  /\  E. y  e.  NN  ( G `  y )  =  1 )  ->  E. y  e.  NN  ( G `  y )  =  1 )
18 fveqeq2 5470 . . . . . . . . . . . . . 14  |-  ( y  =  a  ->  (
( G `  y
)  =  1  <->  ( G `  a )  =  1 ) )
1918cbvrexv 2678 . . . . . . . . . . . . 13  |-  ( E. y  e.  NN  ( G `  y )  =  1  <->  E. a  e.  NN  ( G `  a )  =  1 )
2017, 19sylib 121 . . . . . . . . . . . 12  |-  ( (
ph  /\  E. y  e.  NN  ( G `  y )  =  1 )  ->  E. a  e.  NN  ( G `  a )  =  1 )
2116, 11, 20nconstwlpolemgt0 13583 . . . . . . . . . . 11  |-  ( (
ph  /\  E. y  e.  NN  ( G `  y )  =  1 )  ->  0  <  A )
2221ex 114 . . . . . . . . . 10  |-  ( ph  ->  ( E. y  e.  NN  ( G `  y )  =  1  ->  0  <  A
) )
2322con3d 621 . . . . . . . . 9  |-  ( ph  ->  ( -.  0  < 
A  ->  -.  E. y  e.  NN  ( G `  y )  =  1 ) )
2423adantr 274 . . . . . . . 8  |-  ( (
ph  /\  ( F `  A )  =  0 )  ->  ( -.  0  <  A  ->  -.  E. y  e.  NN  ( G `  y )  =  1 ) )
2515, 24mpd 13 . . . . . . 7  |-  ( (
ph  /\  ( F `  A )  =  0 )  ->  -.  E. y  e.  NN  ( G `  y )  =  1 )
26 ralnex 2442 . . . . . . 7  |-  ( A. y  e.  NN  -.  ( G `  y )  =  1  <->  -.  E. y  e.  NN  ( G `  y )  =  1 )
2725, 26sylibr 133 . . . . . 6  |-  ( (
ph  /\  ( F `  A )  =  0 )  ->  A. y  e.  NN  -.  ( G `
 y )  =  1 )
2827r19.21bi 2542 . . . . 5  |-  ( ( ( ph  /\  ( F `  A )  =  0 )  /\  y  e.  NN )  ->  -.  ( G `  y )  =  1 )
2910ad2antrr 480 . . . . . . 7  |-  ( ( ( ph  /\  ( F `  A )  =  0 )  /\  y  e.  NN )  ->  G : NN --> { 0 ,  1 } )
30 simpr 109 . . . . . . 7  |-  ( ( ( ph  /\  ( F `  A )  =  0 )  /\  y  e.  NN )  ->  y  e.  NN )
3129, 30ffvelrnd 5596 . . . . . 6  |-  ( ( ( ph  /\  ( F `  A )  =  0 )  /\  y  e.  NN )  ->  ( G `  y
)  e.  { 0 ,  1 } )
32 elpri 3579 . . . . . 6  |-  ( ( G `  y )  e.  { 0 ,  1 }  ->  (
( G `  y
)  =  0  \/  ( G `  y
)  =  1 ) )
3331, 32syl 14 . . . . 5  |-  ( ( ( ph  /\  ( F `  A )  =  0 )  /\  y  e.  NN )  ->  ( ( G `  y )  =  0  \/  ( G `  y )  =  1 ) )
3428, 33ecased 1328 . . . 4  |-  ( ( ( ph  /\  ( F `  A )  =  0 )  /\  y  e.  NN )  ->  ( G `  y
)  =  0 )
3534ralrimiva 2527 . . 3  |-  ( (
ph  /\  ( F `  A )  =  0 )  ->  A. y  e.  NN  ( G `  y )  =  0 )
3635orcd 723 . 2  |-  ( (
ph  /\  ( F `  A )  =  0 )  ->  ( A. y  e.  NN  ( G `  y )  =  0  \/  -.  A. y  e.  NN  ( G `  y )  =  0 ) )
3710adantr 274 . . . . . . . . 9  |-  ( (
ph  /\  A. y  e.  NN  ( G `  y )  =  0 )  ->  G : NN
--> { 0 ,  1 } )
38 simpr 109 . . . . . . . . 9  |-  ( (
ph  /\  A. y  e.  NN  ( G `  y )  =  0 )  ->  A. y  e.  NN  ( G `  y )  =  0 )
3937, 11, 38nconstwlpolem0 13582 . . . . . . . 8  |-  ( (
ph  /\  A. y  e.  NN  ( G `  y )  =  0 )  ->  A  = 
0 )
4039fveq2d 5465 . . . . . . 7  |-  ( (
ph  /\  A. y  e.  NN  ( G `  y )  =  0 )  ->  ( F `  A )  =  ( F `  0 ) )
41 nconstwlpo.0 . . . . . . . 8  |-  ( ph  ->  ( F `  0
)  =  0 )
4241adantr 274 . . . . . . 7  |-  ( (
ph  /\  A. y  e.  NN  ( G `  y )  =  0 )  ->  ( F `  0 )  =  0 )
4340, 42eqtrd 2187 . . . . . 6  |-  ( (
ph  /\  A. y  e.  NN  ( G `  y )  =  0 )  ->  ( F `  A )  =  0 )
4443ex 114 . . . . 5  |-  ( ph  ->  ( A. y  e.  NN  ( G `  y )  =  0  ->  ( F `  A )  =  0 ) )
4544con3d 621 . . . 4  |-  ( ph  ->  ( -.  ( F `
 A )  =  0  ->  -.  A. y  e.  NN  ( G `  y )  =  0 ) )
4645imp 123 . . 3  |-  ( (
ph  /\  -.  ( F `  A )  =  0 )  ->  -.  A. y  e.  NN  ( G `  y )  =  0 )
4746olcd 724 . 2  |-  ( (
ph  /\  -.  ( F `  A )  =  0 )  -> 
( A. y  e.  NN  ( G `  y )  =  0  \/  -.  A. y  e.  NN  ( G `  y )  =  0 ) )
48 nconstwlpo.f . . . . 5  |-  ( ph  ->  F : RR --> ZZ )
4948, 12ffvelrnd 5596 . . . 4  |-  ( ph  ->  ( F `  A
)  e.  ZZ )
50 0z 9157 . . . 4  |-  0  e.  ZZ
51 zdceq 9218 . . . 4  |-  ( ( ( F `  A
)  e.  ZZ  /\  0  e.  ZZ )  -> DECID  ( F `  A )  =  0 )
5249, 50, 51sylancl 410 . . 3  |-  ( ph  -> DECID  ( F `  A )  =  0 )
53 exmiddc 822 . . 3  |-  (DECID  ( F `
 A )  =  0  ->  ( ( F `  A )  =  0  \/  -.  ( F `  A )  =  0 ) )
5452, 53syl 14 . 2  |-  ( ph  ->  ( ( F `  A )  =  0  \/  -.  ( F `
 A )  =  0 ) )
5536, 47, 54mpjaodan 788 1  |-  ( ph  ->  ( A. y  e.  NN  ( G `  y )  =  0  \/  -.  A. y  e.  NN  ( G `  y )  =  0 ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    \/ wo 698  DECID wdc 820    = wceq 1332    e. wcel 2125    =/= wne 2324   A.wral 2432   E.wrex 2433   {cpr 3557   class class class wbr 3961   -->wf 5159   ` cfv 5163  (class class class)co 5814   RRcr 7710   0cc0 7711   1c1 7712    x. cmul 7716    < clt 7891    / cdiv 8524   NNcn 8812   2c2 8863   ZZcz 9146   RR+crp 9538   ^cexp 10396   sum_csu 11227
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1481  ax-10 1482  ax-11 1483  ax-i12 1484  ax-bndl 1486  ax-4 1487  ax-17 1503  ax-i9 1507  ax-ial 1511  ax-i5r 1512  ax-13 2127  ax-14 2128  ax-ext 2136  ax-coll 4075  ax-sep 4078  ax-nul 4086  ax-pow 4130  ax-pr 4164  ax-un 4388  ax-setind 4490  ax-iinf 4541  ax-cnex 7802  ax-resscn 7803  ax-1cn 7804  ax-1re 7805  ax-icn 7806  ax-addcl 7807  ax-addrcl 7808  ax-mulcl 7809  ax-mulrcl 7810  ax-addcom 7811  ax-mulcom 7812  ax-addass 7813  ax-mulass 7814  ax-distr 7815  ax-i2m1 7816  ax-0lt1 7817  ax-1rid 7818  ax-0id 7819  ax-rnegex 7820  ax-precex 7821  ax-cnre 7822  ax-pre-ltirr 7823  ax-pre-ltwlin 7824  ax-pre-lttrn 7825  ax-pre-apti 7826  ax-pre-ltadd 7827  ax-pre-mulgt0 7828  ax-pre-mulext 7829  ax-arch 7830  ax-caucvg 7831
This theorem depends on definitions:  df-bi 116  df-dc 821  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1740  df-eu 2006  df-mo 2007  df-clab 2141  df-cleq 2147  df-clel 2150  df-nfc 2285  df-ne 2325  df-nel 2420  df-ral 2437  df-rex 2438  df-reu 2439  df-rmo 2440  df-rab 2441  df-v 2711  df-sbc 2934  df-csb 3028  df-dif 3100  df-un 3102  df-in 3104  df-ss 3111  df-nul 3391  df-if 3502  df-pw 3541  df-sn 3562  df-pr 3563  df-op 3565  df-uni 3769  df-int 3804  df-iun 3847  df-br 3962  df-opab 4022  df-mpt 4023  df-tr 4059  df-id 4248  df-po 4251  df-iso 4252  df-iord 4321  df-on 4323  df-ilim 4324  df-suc 4326  df-iom 4544  df-xp 4585  df-rel 4586  df-cnv 4587  df-co 4588  df-dm 4589  df-rn 4590  df-res 4591  df-ima 4592  df-iota 5128  df-fun 5165  df-fn 5166  df-f 5167  df-f1 5168  df-fo 5169  df-f1o 5170  df-fv 5171  df-isom 5172  df-riota 5770  df-ov 5817  df-oprab 5818  df-mpo 5819  df-1st 6078  df-2nd 6079  df-recs 6242  df-irdg 6307  df-frec 6328  df-1o 6353  df-oadd 6357  df-er 6469  df-en 6675  df-dom 6676  df-fin 6677  df-pnf 7893  df-mnf 7894  df-xr 7895  df-ltxr 7896  df-le 7897  df-sub 8027  df-neg 8028  df-reap 8429  df-ap 8436  df-div 8525  df-inn 8813  df-2 8871  df-3 8872  df-4 8873  df-n0 9070  df-z 9147  df-uz 9419  df-q 9507  df-rp 9539  df-ico 9776  df-fz 9891  df-fzo 10020  df-seqfrec 10323  df-exp 10397  df-ihash 10627  df-cj 10719  df-re 10720  df-im 10721  df-rsqrt 10875  df-abs 10876  df-clim 11153  df-sumdc 11228
This theorem is referenced by:  nconstwlpo  13585
  Copyright terms: Public domain W3C validator