![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dyadf | Structured version Visualization version GIF version |
Description: The function 𝐹 returns the endpoints of a dyadic rational covering of the real line. (Contributed by Mario Carneiro, 26-Mar-2015.) |
Ref | Expression |
---|---|
dyadmbl.1 | ⊢ 𝐹 = (𝑥 ∈ ℤ, 𝑦 ∈ ℕ0 ↦ ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩) |
Ref | Expression |
---|---|
dyadf | ⊢ 𝐹:(ℤ × ℕ0)⟶( ≤ ∩ (ℝ × ℝ)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | zre 12561 | . . . . . . . 8 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℝ) | |
2 | 1 | adantr 481 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 𝑥 ∈ ℝ) |
3 | 2 | lep1d 12144 | . . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 𝑥 ≤ (𝑥 + 1)) |
4 | peano2re 11386 | . . . . . . . 8 ⊢ (𝑥 ∈ ℝ → (𝑥 + 1) ∈ ℝ) | |
5 | 2, 4 | syl 17 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 + 1) ∈ ℝ) |
6 | 2nn 12284 | . . . . . . . . . 10 ⊢ 2 ∈ ℕ | |
7 | nnexpcl 14039 | . . . . . . . . . 10 ⊢ ((2 ∈ ℕ ∧ 𝑦 ∈ ℕ0) → (2↑𝑦) ∈ ℕ) | |
8 | 6, 7 | mpan 688 | . . . . . . . . 9 ⊢ (𝑦 ∈ ℕ0 → (2↑𝑦) ∈ ℕ) |
9 | 8 | adantl 482 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (2↑𝑦) ∈ ℕ) |
10 | 9 | nnred 12226 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (2↑𝑦) ∈ ℝ) |
11 | 9 | nngt0d 12260 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 0 < (2↑𝑦)) |
12 | lediv1 12078 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ (𝑥 + 1) ∈ ℝ ∧ ((2↑𝑦) ∈ ℝ ∧ 0 < (2↑𝑦))) → (𝑥 ≤ (𝑥 + 1) ↔ (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)))) | |
13 | 2, 5, 10, 11, 12 | syl112anc 1374 | . . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 ≤ (𝑥 + 1) ↔ (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)))) |
14 | 3, 13 | mpbid 231 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦))) |
15 | df-br 5149 | . . . . 5 ⊢ ((𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)) ↔ ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩ ∈ ≤ ) | |
16 | 14, 15 | sylib 217 | . . . 4 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩ ∈ ≤ ) |
17 | nndivre 12252 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ (2↑𝑦) ∈ ℕ) → (𝑥 / (2↑𝑦)) ∈ ℝ) | |
18 | 1, 8, 17 | syl2an 596 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 / (2↑𝑦)) ∈ ℝ) |
19 | 1, 4 | syl 17 | . . . . . 6 ⊢ (𝑥 ∈ ℤ → (𝑥 + 1) ∈ ℝ) |
20 | nndivre 12252 | . . . . . 6 ⊢ (((𝑥 + 1) ∈ ℝ ∧ (2↑𝑦) ∈ ℕ) → ((𝑥 + 1) / (2↑𝑦)) ∈ ℝ) | |
21 | 19, 8, 20 | syl2an 596 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → ((𝑥 + 1) / (2↑𝑦)) ∈ ℝ) |
22 | 18, 21 | opelxpd 5715 | . . . 4 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩ ∈ (ℝ × ℝ)) |
23 | 16, 22 | elind 4194 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩ ∈ ( ≤ ∩ (ℝ × ℝ))) |
24 | 23 | rgen2 3197 | . 2 ⊢ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℕ0 ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩ ∈ ( ≤ ∩ (ℝ × ℝ)) |
25 | dyadmbl.1 | . . 3 ⊢ 𝐹 = (𝑥 ∈ ℤ, 𝑦 ∈ ℕ0 ↦ ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩) | |
26 | 25 | fmpo 8053 | . 2 ⊢ (∀𝑥 ∈ ℤ ∀𝑦 ∈ ℕ0 ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩ ∈ ( ≤ ∩ (ℝ × ℝ)) ↔ 𝐹:(ℤ × ℕ0)⟶( ≤ ∩ (ℝ × ℝ))) |
27 | 24, 26 | mpbi 229 | 1 ⊢ 𝐹:(ℤ × ℕ0)⟶( ≤ ∩ (ℝ × ℝ)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3061 ∩ cin 3947 ⟨cop 4634 class class class wbr 5148 × cxp 5674 ⟶wf 6539 (class class class)co 7408 ∈ cmpo 7410 ℝcr 11108 0cc0 11109 1c1 11110 + caddc 11112 < clt 11247 ≤ cle 11248 / cdiv 11870 ℕcn 12211 2c2 12266 ℕ0cn0 12471 ℤcz 12557 ↑cexp 14026 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7364 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7855 df-1st 7974 df-2nd 7975 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-er 8702 df-en 8939 df-dom 8940 df-sdom 8941 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11445 df-neg 11446 df-div 11871 df-nn 12212 df-2 12274 df-n0 12472 df-z 12558 df-uz 12822 df-seq 13966 df-exp 14027 |
This theorem is referenced by: dyaddisj 25112 dyadmax 25114 dyadmbllem 25115 dyadmbl 25116 opnmbllem 25117 opnmbllem0 36519 mblfinlem2 36521 |
Copyright terms: Public domain | W3C validator |