Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  snmlflim Structured version   Unicode version

Theorem snmlflim 25019
Description: If  A is simply normal, then the function  F of relative density of  B in the digit string converges to  1  /  R, i.e. the set of occurences of  B in the digit string has natural density  1  /  R. (Contributed by Mario Carneiro, 6-Apr-2015.)
Hypotheses
Ref Expression
snml.s  |-  S  =  ( r  e.  (
ZZ>= `  2 )  |->  { x  e.  RR  |  A. b  e.  (
0 ... ( r  - 
1 ) ) ( n  e.  NN  |->  ( ( # `  {
k  e.  ( 1 ... n )  |  ( |_ `  (
( x  x.  (
r ^ k ) )  mod  r ) )  =  b } )  /  n ) )  ~~>  ( 1  / 
r ) } )
snml.f  |-  F  =  ( n  e.  NN  |->  ( ( # `  {
k  e.  ( 1 ... n )  |  ( |_ `  (
( A  x.  ( R ^ k ) )  mod  R ) )  =  B } )  /  n ) )
Assertion
Ref Expression
snmlflim  |-  ( ( A  e.  ( S `
 R )  /\  B  e.  ( 0 ... ( R  - 
1 ) ) )  ->  F  ~~>  ( 1  /  R ) )
Distinct variable groups:    k, b, n, x, A    B, b,
k, n    F, b    r, b, R, k, n, x
Allowed substitution hints:    A( r)    B( x, r)    S( x, k, n, r, b)    F( x, k, n, r)

Proof of Theorem snmlflim
StepHypRef Expression
1 snml.s . . . 4  |-  S  =  ( r  e.  (
ZZ>= `  2 )  |->  { x  e.  RR  |  A. b  e.  (
0 ... ( r  - 
1 ) ) ( n  e.  NN  |->  ( ( # `  {
k  e.  ( 1 ... n )  |  ( |_ `  (
( x  x.  (
r ^ k ) )  mod  r ) )  =  b } )  /  n ) )  ~~>  ( 1  / 
r ) } )
21snmlval 25018 . . 3  |-  ( A  e.  ( S `  R )  <->  ( R  e.  ( ZZ>= `  2 )  /\  A  e.  RR  /\ 
A. b  e.  ( 0 ... ( R  -  1 ) ) ( n  e.  NN  |->  ( ( # `  {
k  e.  ( 1 ... n )  |  ( |_ `  (
( A  x.  ( R ^ k ) )  mod  R ) )  =  b } )  /  n ) )  ~~>  ( 1  /  R
) ) )
32simp3bi 974 . 2  |-  ( A  e.  ( S `  R )  ->  A. b  e.  ( 0 ... ( R  -  1 ) ) ( n  e.  NN  |->  ( ( # `  { k  e.  ( 1 ... n )  |  ( |_ `  ( ( A  x.  ( R ^ k ) )  mod  R ) )  =  b } )  /  n ) )  ~~>  ( 1  /  R ) )
4 eqeq2 2445 . . . . . . . . 9  |-  ( b  =  B  ->  (
( |_ `  (
( A  x.  ( R ^ k ) )  mod  R ) )  =  b  <->  ( |_ `  ( ( A  x.  ( R ^ k ) )  mod  R ) )  =  B ) )
54rabbidv 2948 . . . . . . . 8  |-  ( b  =  B  ->  { k  e.  ( 1 ... n )  |  ( |_ `  ( ( A  x.  ( R ^ k ) )  mod  R ) )  =  b }  =  { k  e.  ( 1 ... n )  |  ( |_ `  ( ( A  x.  ( R ^ k ) )  mod  R ) )  =  B }
)
65fveq2d 5732 . . . . . . 7  |-  ( b  =  B  ->  ( # `
 { k  e.  ( 1 ... n
)  |  ( |_
`  ( ( A  x.  ( R ^
k ) )  mod 
R ) )  =  b } )  =  ( # `  {
k  e.  ( 1 ... n )  |  ( |_ `  (
( A  x.  ( R ^ k ) )  mod  R ) )  =  B } ) )
76oveq1d 6096 . . . . . 6  |-  ( b  =  B  ->  (
( # `  { k  e.  ( 1 ... n )  |  ( |_ `  ( ( A  x.  ( R ^ k ) )  mod  R ) )  =  b } )  /  n )  =  ( ( # `  {
k  e.  ( 1 ... n )  |  ( |_ `  (
( A  x.  ( R ^ k ) )  mod  R ) )  =  B } )  /  n ) )
87mpteq2dv 4296 . . . . 5  |-  ( b  =  B  ->  (
n  e.  NN  |->  ( ( # `  {
k  e.  ( 1 ... n )  |  ( |_ `  (
( A  x.  ( R ^ k ) )  mod  R ) )  =  b } )  /  n ) )  =  ( n  e.  NN  |->  ( ( # `  { k  e.  ( 1 ... n )  |  ( |_ `  ( ( A  x.  ( R ^ k ) )  mod  R ) )  =  B }
)  /  n ) ) )
9 snml.f . . . . 5  |-  F  =  ( n  e.  NN  |->  ( ( # `  {
k  e.  ( 1 ... n )  |  ( |_ `  (
( A  x.  ( R ^ k ) )  mod  R ) )  =  B } )  /  n ) )
108, 9syl6eqr 2486 . . . 4  |-  ( b  =  B  ->  (
n  e.  NN  |->  ( ( # `  {
k  e.  ( 1 ... n )  |  ( |_ `  (
( A  x.  ( R ^ k ) )  mod  R ) )  =  b } )  /  n ) )  =  F )
1110breq1d 4222 . . 3  |-  ( b  =  B  ->  (
( n  e.  NN  |->  ( ( # `  {
k  e.  ( 1 ... n )  |  ( |_ `  (
( A  x.  ( R ^ k ) )  mod  R ) )  =  b } )  /  n ) )  ~~>  ( 1  /  R
)  <->  F  ~~>  ( 1  /  R ) ) )
1211rspccva 3051 . 2  |-  ( ( A. b  e.  ( 0 ... ( R  -  1 ) ) ( n  e.  NN  |->  ( ( # `  {
k  e.  ( 1 ... n )  |  ( |_ `  (
( A  x.  ( R ^ k ) )  mod  R ) )  =  b } )  /  n ) )  ~~>  ( 1  /  R
)  /\  B  e.  ( 0 ... ( R  -  1 ) ) )  ->  F  ~~>  ( 1  /  R
) )
133, 12sylan 458 1  |-  ( ( A  e.  ( S `
 R )  /\  B  e.  ( 0 ... ( R  - 
1 ) ) )  ->  F  ~~>  ( 1  /  R ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    = wceq 1652    e. wcel 1725   A.wral 2705   {crab 2709   class class class wbr 4212    e. cmpt 4266   ` cfv 5454  (class class class)co 6081   RRcr 8989   0cc0 8990   1c1 8991    x. cmul 8995    - cmin 9291    / cdiv 9677   NNcn 10000   2c2 10049   ZZ>=cuz 10488   ...cfz 11043   |_cfl 11201    mod cmo 11250   ^cexp 11382   #chash 11618    ~~> cli 12278
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-13 1727  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2417  ax-sep 4330  ax-nul 4338  ax-pow 4377  ax-pr 4403  ax-cnex 9046  ax-resscn 9047
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2285  df-mo 2286  df-clab 2423  df-cleq 2429  df-clel 2432  df-nfc 2561  df-ne 2601  df-ral 2710  df-rex 2711  df-rab 2714  df-v 2958  df-sbc 3162  df-dif 3323  df-un 3325  df-in 3327  df-ss 3334  df-nul 3629  df-if 3740  df-sn 3820  df-pr 3821  df-op 3823  df-uni 4016  df-br 4213  df-opab 4267  df-mpt 4268  df-id 4498  df-xp 4884  df-rel 4885  df-cnv 4886  df-co 4887  df-dm 4888  df-rn 4889  df-res 4890  df-ima 4891  df-iota 5418  df-fun 5456  df-fv 5462  df-ov 6084
  Copyright terms: Public domain W3C validator