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 12253 | . . . . . . . 8 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℝ) | |
2 | 1 | adantr 480 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 𝑥 ∈ ℝ) |
3 | 2 | lep1d 11836 | . . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 𝑥 ≤ (𝑥 + 1)) |
4 | peano2re 11078 | . . . . . . . 8 ⊢ (𝑥 ∈ ℝ → (𝑥 + 1) ∈ ℝ) | |
5 | 2, 4 | syl 17 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 + 1) ∈ ℝ) |
6 | 2nn 11976 | . . . . . . . . . 10 ⊢ 2 ∈ ℕ | |
7 | nnexpcl 13723 | . . . . . . . . . 10 ⊢ ((2 ∈ ℕ ∧ 𝑦 ∈ ℕ0) → (2↑𝑦) ∈ ℕ) | |
8 | 6, 7 | mpan 686 | . . . . . . . . 9 ⊢ (𝑦 ∈ ℕ0 → (2↑𝑦) ∈ ℕ) |
9 | 8 | adantl 481 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (2↑𝑦) ∈ ℕ) |
10 | 9 | nnred 11918 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (2↑𝑦) ∈ ℝ) |
11 | 9 | nngt0d 11952 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 0 < (2↑𝑦)) |
12 | lediv1 11770 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ (𝑥 + 1) ∈ ℝ ∧ ((2↑𝑦) ∈ ℝ ∧ 0 < (2↑𝑦))) → (𝑥 ≤ (𝑥 + 1) ↔ (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)))) | |
13 | 2, 5, 10, 11, 12 | syl112anc 1372 | . . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 ≤ (𝑥 + 1) ↔ (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)))) |
14 | 3, 13 | mpbid 231 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦))) |
15 | df-br 5071 | . . . . 5 ⊢ ((𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)) ↔ 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ≤ ) | |
16 | 14, 15 | sylib 217 | . . . 4 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ≤ ) |
17 | nndivre 11944 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ (2↑𝑦) ∈ ℕ) → (𝑥 / (2↑𝑦)) ∈ ℝ) | |
18 | 1, 8, 17 | syl2an 595 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 / (2↑𝑦)) ∈ ℝ) |
19 | 1, 4 | syl 17 | . . . . . 6 ⊢ (𝑥 ∈ ℤ → (𝑥 + 1) ∈ ℝ) |
20 | nndivre 11944 | . . . . . 6 ⊢ (((𝑥 + 1) ∈ ℝ ∧ (2↑𝑦) ∈ ℕ) → ((𝑥 + 1) / (2↑𝑦)) ∈ ℝ) | |
21 | 19, 8, 20 | syl2an 595 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → ((𝑥 + 1) / (2↑𝑦)) ∈ ℝ) |
22 | 18, 21 | opelxpd 5618 | . . . 4 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ (ℝ × ℝ)) |
23 | 16, 22 | elind 4124 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ( ≤ ∩ (ℝ × ℝ))) |
24 | 23 | rgen2 3126 | . 2 ⊢ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℕ0 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ( ≤ ∩ (ℝ × ℝ)) |
25 | dyadmbl.1 | . . 3 ⊢ 𝐹 = (𝑥 ∈ ℤ, 𝑦 ∈ ℕ0 ↦ 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉) | |
26 | 25 | fmpo 7881 | . 2 ⊢ (∀𝑥 ∈ ℤ ∀𝑦 ∈ ℕ0 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ( ≤ ∩ (ℝ × ℝ)) ↔ 𝐹:(ℤ × ℕ0)⟶( ≤ ∩ (ℝ × ℝ))) |
27 | 24, 26 | mpbi 229 | 1 ⊢ 𝐹:(ℤ × ℕ0)⟶( ≤ ∩ (ℝ × ℝ)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∀wral 3063 ∩ cin 3882 〈cop 4564 class class class wbr 5070 × cxp 5578 ⟶wf 6414 (class class class)co 7255 ∈ cmpo 7257 ℝcr 10801 0cc0 10802 1c1 10803 + caddc 10805 < clt 10940 ≤ cle 10941 / cdiv 11562 ℕcn 11903 2c2 11958 ℕ0cn0 12163 ℤcz 12249 ↑cexp 13710 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-n0 12164 df-z 12250 df-uz 12512 df-seq 13650 df-exp 13711 |
This theorem is referenced by: dyaddisj 24665 dyadmax 24667 dyadmbllem 24668 dyadmbl 24669 opnmbllem 24670 opnmbllem0 35740 mblfinlem2 35742 |
Copyright terms: Public domain | W3C validator |