Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dya2iocival Structured version   Visualization version   GIF version

Theorem dya2iocival 34531
Description: The function 𝐼 returns closed-below open-above dyadic rational intervals covering the real line. This is the same construction as in dyadmbl 25650. (Contributed by Thierry Arnoux, 24-Sep-2017.)
Hypotheses
Ref Expression
sxbrsiga.0 𝐽 = (topGen‘ran (,))
dya2ioc.1 𝐼 = (𝑥 ∈ ℤ, 𝑛 ∈ ℤ ↦ ((𝑥 / (2↑𝑛))[,)((𝑥 + 1) / (2↑𝑛))))
Assertion
Ref Expression
dya2iocival ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → (𝑋𝐼𝑁) = ((𝑋 / (2↑𝑁))[,)((𝑋 + 1) / (2↑𝑁))))
Distinct variable group:   𝑥,𝑛
Allowed substitution hints:   𝐼(𝑥,𝑛)   𝐽(𝑥,𝑛)   𝑁(𝑥,𝑛)   𝑋(𝑥,𝑛)

Proof of Theorem dya2iocival
Dummy variables 𝑚 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq1 7398 . . . 4 (𝑢 = 𝑋 → (𝑢 / (2↑𝑚)) = (𝑋 / (2↑𝑚)))
2 oveq1 7398 . . . . 5 (𝑢 = 𝑋 → (𝑢 + 1) = (𝑋 + 1))
32oveq1d 7406 . . . 4 (𝑢 = 𝑋 → ((𝑢 + 1) / (2↑𝑚)) = ((𝑋 + 1) / (2↑𝑚)))
41, 3oveq12d 7409 . . 3 (𝑢 = 𝑋 → ((𝑢 / (2↑𝑚))[,)((𝑢 + 1) / (2↑𝑚))) = ((𝑋 / (2↑𝑚))[,)((𝑋 + 1) / (2↑𝑚))))
5 oveq2 7399 . . . . 5 (𝑚 = 𝑁 → (2↑𝑚) = (2↑𝑁))
65oveq2d 7407 . . . 4 (𝑚 = 𝑁 → (𝑋 / (2↑𝑚)) = (𝑋 / (2↑𝑁)))
75oveq2d 7407 . . . 4 (𝑚 = 𝑁 → ((𝑋 + 1) / (2↑𝑚)) = ((𝑋 + 1) / (2↑𝑁)))
86, 7oveq12d 7409 . . 3 (𝑚 = 𝑁 → ((𝑋 / (2↑𝑚))[,)((𝑋 + 1) / (2↑𝑚))) = ((𝑋 / (2↑𝑁))[,)((𝑋 + 1) / (2↑𝑁))))
9 dya2ioc.1 . . . 4 𝐼 = (𝑥 ∈ ℤ, 𝑛 ∈ ℤ ↦ ((𝑥 / (2↑𝑛))[,)((𝑥 + 1) / (2↑𝑛))))
10 oveq1 7398 . . . . . 6 (𝑢 = 𝑥 → (𝑢 / (2↑𝑚)) = (𝑥 / (2↑𝑚)))
11 oveq1 7398 . . . . . . 7 (𝑢 = 𝑥 → (𝑢 + 1) = (𝑥 + 1))
1211oveq1d 7406 . . . . . 6 (𝑢 = 𝑥 → ((𝑢 + 1) / (2↑𝑚)) = ((𝑥 + 1) / (2↑𝑚)))
1310, 12oveq12d 7409 . . . . 5 (𝑢 = 𝑥 → ((𝑢 / (2↑𝑚))[,)((𝑢 + 1) / (2↑𝑚))) = ((𝑥 / (2↑𝑚))[,)((𝑥 + 1) / (2↑𝑚))))
14 oveq2 7399 . . . . . . 7 (𝑚 = 𝑛 → (2↑𝑚) = (2↑𝑛))
1514oveq2d 7407 . . . . . 6 (𝑚 = 𝑛 → (𝑥 / (2↑𝑚)) = (𝑥 / (2↑𝑛)))
1614oveq2d 7407 . . . . . 6 (𝑚 = 𝑛 → ((𝑥 + 1) / (2↑𝑚)) = ((𝑥 + 1) / (2↑𝑛)))
1715, 16oveq12d 7409 . . . . 5 (𝑚 = 𝑛 → ((𝑥 / (2↑𝑚))[,)((𝑥 + 1) / (2↑𝑚))) = ((𝑥 / (2↑𝑛))[,)((𝑥 + 1) / (2↑𝑛))))
1813, 17cbvmpov 7486 . . . 4 (𝑢 ∈ ℤ, 𝑚 ∈ ℤ ↦ ((𝑢 / (2↑𝑚))[,)((𝑢 + 1) / (2↑𝑚)))) = (𝑥 ∈ ℤ, 𝑛 ∈ ℤ ↦ ((𝑥 / (2↑𝑛))[,)((𝑥 + 1) / (2↑𝑛))))
199, 18eqtr4i 2787 . . 3 𝐼 = (𝑢 ∈ ℤ, 𝑚 ∈ ℤ ↦ ((𝑢 / (2↑𝑚))[,)((𝑢 + 1) / (2↑𝑚))))
20 ovex 7424 . . 3 ((𝑋 / (2↑𝑁))[,)((𝑋 + 1) / (2↑𝑁))) ∈ V
214, 8, 19, 20ovmpo 7551 . 2 ((𝑋 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑋𝐼𝑁) = ((𝑋 / (2↑𝑁))[,)((𝑋 + 1) / (2↑𝑁))))
2221ancoms 462 1 ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → (𝑋𝐼𝑁) = ((𝑋 / (2↑𝑁))[,)((𝑋 + 1) / (2↑𝑁))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  ran crn 5644  cfv 6516  (class class class)co 7391  cmpo 7393  1c1 11068   + caddc 11070   / cdiv 11838  2c2 12266  cz 12562  (,)cioo 13343  [,)cico 13345  cexp 14068  topGenctg 17457
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pr 5387
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-iota 6472  df-fun 6518  df-fv 6524  df-ov 7394  df-oprab 7395  df-mpo 7396
This theorem is referenced by:  dya2iocress  34532  dya2iocbrsiga  34533  dya2icoseg  34535
  Copyright terms: Public domain W3C validator