Theorem dya2iocival 34952

Description: The function 𝐼 returns closed-below open-above dyadic rational intervals covering the real line. This is the same construction as in dyadmbl 25927. (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.

Step	Hyp	Ref	Expression
1		oveq1 7428	. . . 4 ⊢ (𝑢 = 𝑋 → (𝑢 / (2↑𝑚)) = (𝑋 / (2↑𝑚)))
2		oveq1 7428	. . . . 5 ⊢ (𝑢 = 𝑋 → (𝑢 + 1) = (𝑋 + 1))
3	2	oveq1d 7436	. . . 4 ⊢ (𝑢 = 𝑋 → ((𝑢 + 1) / (2↑𝑚)) = ((𝑋 + 1) / (2↑𝑚)))
4	1, 3	oveq12d 7439	. . 3 ⊢ (𝑢 = 𝑋 → ((𝑢 / (2↑𝑚))[,)((𝑢 + 1) / (2↑𝑚))) = ((𝑋 / (2↑𝑚))[,)((𝑋 + 1) / (2↑𝑚))))
5		oveq2 7429	. . . . 5 ⊢ (𝑚 = 𝑁 → (2↑𝑚) = (2↑𝑁))
6	5	oveq2d 7437	. . . 4 ⊢ (𝑚 = 𝑁 → (𝑋 / (2↑𝑚)) = (𝑋 / (2↑𝑁)))
7	5	oveq2d 7437	. . . 4 ⊢ (𝑚 = 𝑁 → ((𝑋 + 1) / (2↑𝑚)) = ((𝑋 + 1) / (2↑𝑁)))
8	6, 7	oveq12d 7439	. . 3 ⊢ (𝑚 = 𝑁 → ((𝑋 / (2↑𝑚))[,)((𝑋 + 1) / (2↑𝑚))) = ((𝑋 / (2↑𝑁))[,)((𝑋 + 1) / (2↑𝑁))))
9		dya2ioc.1	. . . 4 ⊢ 𝐼 = (𝑥 ∈ ℤ, 𝑛 ∈ ℤ ↦ ((𝑥 / (2↑𝑛))[,)((𝑥 + 1) / (2↑𝑛))))
10		oveq1 7428	. . . . . 6 ⊢ (𝑢 = 𝑥 → (𝑢 / (2↑𝑚)) = (𝑥 / (2↑𝑚)))
11		oveq1 7428	. . . . . . 7 ⊢ (𝑢 = 𝑥 → (𝑢 + 1) = (𝑥 + 1))
12	11	oveq1d 7436	. . . . . 6 ⊢ (𝑢 = 𝑥 → ((𝑢 + 1) / (2↑𝑚)) = ((𝑥 + 1) / (2↑𝑚)))
13	10, 12	oveq12d 7439	. . . . 5 ⊢ (𝑢 = 𝑥 → ((𝑢 / (2↑𝑚))[,)((𝑢 + 1) / (2↑𝑚))) = ((𝑥 / (2↑𝑚))[,)((𝑥 + 1) / (2↑𝑚))))
14		oveq2 7429	. . . . . . 7 ⊢ (𝑚 = 𝑛 → (2↑𝑚) = (2↑𝑛))
15	14	oveq2d 7437	. . . . . 6 ⊢ (𝑚 = 𝑛 → (𝑥 / (2↑𝑚)) = (𝑥 / (2↑𝑛)))
16	14	oveq2d 7437	. . . . . 6 ⊢ (𝑚 = 𝑛 → ((𝑥 + 1) / (2↑𝑚)) = ((𝑥 + 1) / (2↑𝑛)))
17	15, 16	oveq12d 7439	. . . . 5 ⊢ (𝑚 = 𝑛 → ((𝑥 / (2↑𝑚))[,)((𝑥 + 1) / (2↑𝑚))) = ((𝑥 / (2↑𝑛))[,)((𝑥 + 1) / (2↑𝑛))))
18	13, 17	cbvmpov 7516	. . . 4 ⊢ (𝑢 ∈ ℤ, 𝑚 ∈ ℤ ↦ ((𝑢 / (2↑𝑚))[,)((𝑢 + 1) / (2↑𝑚)))) = (𝑥 ∈ ℤ, 𝑛 ∈ ℤ ↦ ((𝑥 / (2↑𝑛))[,)((𝑥 + 1) / (2↑𝑛))))
19	9, 18	eqtr4i 2786	. . 3 ⊢ 𝐼 = (𝑢 ∈ ℤ, 𝑚 ∈ ℤ ↦ ((𝑢 / (2↑𝑚))[,)((𝑢 + 1) / (2↑𝑚))))
20		ovex 7454	. . 3 ⊢ ((𝑋 / (2↑𝑁))[,)((𝑋 + 1) / (2↑𝑁))) ∈ V
21	4, 8, 19, 20	ovmpo 7581	. 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑋𝐼𝑁) = ((𝑋 / (2↑𝑁))[,)((𝑋 + 1) / (2↑𝑁))))
22	21	ancoms 464	1 ⊢ ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → (𝑋𝐼𝑁) = ((𝑋 / (2↑𝑁))[,)((𝑋 + 1) / (2↑𝑁))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ran crn 5651  ‘cfv 6539  (class class class)co 7421   ∈ cmpo 7423  1c1 11205   + caddc 11207   / cdiv 11977  2c2 12401  ℤcz 12697  (,)cioo 13480  [,)cico 13482  ↑cexp 14208  topGenctg 17614

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6541  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426

This theorem is used by:  dya2iocress  34953  dya2iocbrsiga  34954  dya2icoseg  34956