| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dya2iocress | Structured version Visualization version GIF version | ||
| Description: Dyadic intervals are subsets of ℝ. (Contributed by Thierry Arnoux, 18-Sep-2017.) |
| Ref | Expression |
|---|---|
| sxbrsiga.0 | ⊢ 𝐽 = (topGen‘ran (,)) |
| dya2ioc.1 | ⊢ 𝐼 = (𝑥 ∈ ℤ, 𝑛 ∈ ℤ ↦ ((𝑥 / (2↑𝑛))[,)((𝑥 + 1) / (2↑𝑛)))) |
| Ref | Expression |
|---|---|
| dya2iocress | ⊢ ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → (𝑋𝐼𝑁) ⊆ ℝ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sxbrsiga.0 | . . 3 ⊢ 𝐽 = (topGen‘ran (,)) | |
| 2 | dya2ioc.1 | . . 3 ⊢ 𝐼 = (𝑥 ∈ ℤ, 𝑛 ∈ ℤ ↦ ((𝑥 / (2↑𝑛))[,)((𝑥 + 1) / (2↑𝑛)))) | |
| 3 | 1, 2 | dya2iocival 34951 | . 2 ⊢ ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → (𝑋𝐼𝑁) = ((𝑋 / (2↑𝑁))[,)((𝑋 + 1) / (2↑𝑁)))) |
| 4 | simpr 490 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → 𝑋 ∈ ℤ) | |
| 5 | 4 | zred 12806 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → 𝑋 ∈ ℝ) |
| 6 | 2rp 13128 | . . . . . 6 ⊢ 2 ∈ ℝ+ | |
| 7 | 6 | a1i 11 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → 2 ∈ ℝ+) |
| 8 | simpl 488 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → 𝑁 ∈ ℤ) | |
| 9 | 7, 8 | rpexpcld 14394 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → (2↑𝑁) ∈ ℝ+) |
| 10 | 5, 9 | rerpdivcld 13198 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → (𝑋 / (2↑𝑁)) ∈ ℝ) |
| 11 | 1red 11312 | . . . . . 6 ⊢ ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → 1 ∈ ℝ) | |
| 12 | 5, 11 | readdcld 11341 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → (𝑋 + 1) ∈ ℝ) |
| 13 | 12, 9 | rerpdivcld 13198 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → ((𝑋 + 1) / (2↑𝑁)) ∈ ℝ) |
| 14 | 13 | rexrd 11362 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → ((𝑋 + 1) / (2↑𝑁)) ∈ ℝ*) |
| 15 | icossre 13562 | . . 3 ⊢ (((𝑋 / (2↑𝑁)) ∈ ℝ ∧ ((𝑋 + 1) / (2↑𝑁)) ∈ ℝ*) → ((𝑋 / (2↑𝑁))[,)((𝑋 + 1) / (2↑𝑁))) ⊆ ℝ) | |
| 16 | 10, 14, 15 | syl2anc 596 | . 2 ⊢ ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → ((𝑋 / (2↑𝑁))[,)((𝑋 + 1) / (2↑𝑁))) ⊆ ℝ) |
| 17 | 3, 16 | eqsstrd 3942 | 1 ⊢ ((𝑁 ∈ ℤ ∧ 𝑋 ∈ ℤ) → (𝑋𝐼𝑁) ⊆ ℝ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ⊆ wss 3895 ran crn 5651 ‘cfv 6538 (class class class)co 7420 ∈ cmpo 7422 ℝcr 11202 1c1 11204 + caddc 11206 ℝ*cxr 11345 / cdiv 11976 2c2 12400 ℤcz 12696 ℝ+crp 13123 (,)cioo 13479 [,)cico 13481 ↑cexp 14207 topGenctg 17613 |
| 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-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-er 8720 df-en 8977 df-dom 8978 df-sdom 8979 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-div 11977 df-nn 12339 df-2 12408 df-n0 12610 df-z 12697 df-uz 12969 df-rp 13124 df-ico 13485 df-seq 14148 df-exp 14208 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |