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

Theorem snmlflim 35317
Description: If 𝐴 is simply normal, then the function 𝐹 of relative density of 𝐵 in the digit string converges to 1 / 𝑅, i.e. the set of occurrences of 𝐵 in the digit string has natural density 1 / 𝑅. (Contributed by Mario Carneiro, 6-Apr-2015.)
Hypotheses
Ref Expression
snml.s 𝑆 = (𝑟 ∈ (ℤ‘2) ↦ {𝑥 ∈ ℝ ∣ ∀𝑏 ∈ (0...(𝑟 − 1))(𝑛 ∈ ℕ ↦ ((♯‘{𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝑥 · (𝑟𝑘)) mod 𝑟)) = 𝑏}) / 𝑛)) ⇝ (1 / 𝑟)})
snml.f 𝐹 = (𝑛 ∈ ℕ ↦ ((♯‘{𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝐵}) / 𝑛))
Assertion
Ref Expression
snmlflim ((𝐴 ∈ (𝑆𝑅) ∧ 𝐵 ∈ (0...(𝑅 − 1))) → 𝐹 ⇝ (1 / 𝑅))
Distinct variable groups:   𝑘,𝑏,𝑛,𝑥,𝐴   𝐵,𝑏,𝑘,𝑛   𝐹,𝑏   𝑟,𝑏,𝑅,𝑘,𝑛,𝑥
Allowed substitution hints:   𝐴(𝑟)   𝐵(𝑥,𝑟)   𝑆(𝑥,𝑘,𝑛,𝑟,𝑏)   𝐹(𝑥,𝑘,𝑛,𝑟)

Proof of Theorem snmlflim
StepHypRef Expression
1 snml.s . . . 4 𝑆 = (𝑟 ∈ (ℤ‘2) ↦ {𝑥 ∈ ℝ ∣ ∀𝑏 ∈ (0...(𝑟 − 1))(𝑛 ∈ ℕ ↦ ((♯‘{𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝑥 · (𝑟𝑘)) mod 𝑟)) = 𝑏}) / 𝑛)) ⇝ (1 / 𝑟)})
21snmlval 35316 . . 3 (𝐴 ∈ (𝑆𝑅) ↔ (𝑅 ∈ (ℤ‘2) ∧ 𝐴 ∈ ℝ ∧ ∀𝑏 ∈ (0...(𝑅 − 1))(𝑛 ∈ ℕ ↦ ((♯‘{𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝑏}) / 𝑛)) ⇝ (1 / 𝑅)))
32simp3bi 1146 . 2 (𝐴 ∈ (𝑆𝑅) → ∀𝑏 ∈ (0...(𝑅 − 1))(𝑛 ∈ ℕ ↦ ((♯‘{𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝑏}) / 𝑛)) ⇝ (1 / 𝑅))
4 eqeq2 2747 . . . . . . . . 9 (𝑏 = 𝐵 → ((⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝑏 ↔ (⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝐵))
54rabbidv 3441 . . . . . . . 8 (𝑏 = 𝐵 → {𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝑏} = {𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝐵})
65fveq2d 6911 . . . . . . 7 (𝑏 = 𝐵 → (♯‘{𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝑏}) = (♯‘{𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝐵}))
76oveq1d 7446 . . . . . 6 (𝑏 = 𝐵 → ((♯‘{𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝑏}) / 𝑛) = ((♯‘{𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝐵}) / 𝑛))
87mpteq2dv 5250 . . . . 5 (𝑏 = 𝐵 → (𝑛 ∈ ℕ ↦ ((♯‘{𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝑏}) / 𝑛)) = (𝑛 ∈ ℕ ↦ ((♯‘{𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝐵}) / 𝑛)))
9 snml.f . . . . 5 𝐹 = (𝑛 ∈ ℕ ↦ ((♯‘{𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝐵}) / 𝑛))
108, 9eqtr4di 2793 . . . 4 (𝑏 = 𝐵 → (𝑛 ∈ ℕ ↦ ((♯‘{𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝑏}) / 𝑛)) = 𝐹)
1110breq1d 5158 . . 3 (𝑏 = 𝐵 → ((𝑛 ∈ ℕ ↦ ((♯‘{𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝑏}) / 𝑛)) ⇝ (1 / 𝑅) ↔ 𝐹 ⇝ (1 / 𝑅)))
1211rspccva 3621 . 2 ((∀𝑏 ∈ (0...(𝑅 − 1))(𝑛 ∈ ℕ ↦ ((♯‘{𝑘 ∈ (1...𝑛) ∣ (⌊‘((𝐴 · (𝑅𝑘)) mod 𝑅)) = 𝑏}) / 𝑛)) ⇝ (1 / 𝑅) ∧ 𝐵 ∈ (0...(𝑅 − 1))) → 𝐹 ⇝ (1 / 𝑅))
133, 12sylan 580 1 ((𝐴 ∈ (𝑆𝑅) ∧ 𝐵 ∈ (0...(𝑅 − 1))) → 𝐹 ⇝ (1 / 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2106  wral 3059  {crab 3433   class class class wbr 5148  cmpt 5231  cfv 6563  (class class class)co 7431  cr 11152  0cc0 11153  1c1 11154   · cmul 11158  cmin 11490   / cdiv 11918  cn 12264  2c2 12319  cuz 12876  ...cfz 13544  cfl 13827   mod cmo 13906  cexp 14099  chash 14366  cli 15517
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-cnex 11209  ax-resscn 11210
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fv 6571  df-ov 7434
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator