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 12323 | . . . . . . . 8 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℝ) | |
2 | 1 | adantr 481 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 𝑥 ∈ ℝ) |
3 | 2 | lep1d 11906 | . . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 𝑥 ≤ (𝑥 + 1)) |
4 | peano2re 11148 | . . . . . . . 8 ⊢ (𝑥 ∈ ℝ → (𝑥 + 1) ∈ ℝ) | |
5 | 2, 4 | syl 17 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 + 1) ∈ ℝ) |
6 | 2nn 12046 | . . . . . . . . . 10 ⊢ 2 ∈ ℕ | |
7 | nnexpcl 13795 | . . . . . . . . . 10 ⊢ ((2 ∈ ℕ ∧ 𝑦 ∈ ℕ0) → (2↑𝑦) ∈ ℕ) | |
8 | 6, 7 | mpan 687 | . . . . . . . . 9 ⊢ (𝑦 ∈ ℕ0 → (2↑𝑦) ∈ ℕ) |
9 | 8 | adantl 482 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (2↑𝑦) ∈ ℕ) |
10 | 9 | nnred 11988 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (2↑𝑦) ∈ ℝ) |
11 | 9 | nngt0d 12022 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 0 < (2↑𝑦)) |
12 | lediv1 11840 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ (𝑥 + 1) ∈ ℝ ∧ ((2↑𝑦) ∈ ℝ ∧ 0 < (2↑𝑦))) → (𝑥 ≤ (𝑥 + 1) ↔ (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)))) | |
13 | 2, 5, 10, 11, 12 | syl112anc 1373 | . . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 ≤ (𝑥 + 1) ↔ (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)))) |
14 | 3, 13 | mpbid 231 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦))) |
15 | df-br 5075 | . . . . 5 ⊢ ((𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)) ↔ 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ≤ ) | |
16 | 14, 15 | sylib 217 | . . . 4 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ≤ ) |
17 | nndivre 12014 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ (2↑𝑦) ∈ ℕ) → (𝑥 / (2↑𝑦)) ∈ ℝ) | |
18 | 1, 8, 17 | syl2an 596 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 / (2↑𝑦)) ∈ ℝ) |
19 | 1, 4 | syl 17 | . . . . . 6 ⊢ (𝑥 ∈ ℤ → (𝑥 + 1) ∈ ℝ) |
20 | nndivre 12014 | . . . . . 6 ⊢ (((𝑥 + 1) ∈ ℝ ∧ (2↑𝑦) ∈ ℕ) → ((𝑥 + 1) / (2↑𝑦)) ∈ ℝ) | |
21 | 19, 8, 20 | syl2an 596 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → ((𝑥 + 1) / (2↑𝑦)) ∈ ℝ) |
22 | 18, 21 | opelxpd 5627 | . . . 4 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ (ℝ × ℝ)) |
23 | 16, 22 | elind 4128 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ( ≤ ∩ (ℝ × ℝ))) |
24 | 23 | rgen2 3120 | . 2 ⊢ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℕ0 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ( ≤ ∩ (ℝ × ℝ)) |
25 | dyadmbl.1 | . . 3 ⊢ 𝐹 = (𝑥 ∈ ℤ, 𝑦 ∈ ℕ0 ↦ 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉) | |
26 | 25 | fmpo 7908 | . 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 1539 ∈ wcel 2106 ∀wral 3064 ∩ cin 3886 〈cop 4567 class class class wbr 5074 × cxp 5587 ⟶wf 6429 (class class class)co 7275 ∈ cmpo 7277 ℝcr 10870 0cc0 10871 1c1 10872 + caddc 10874 < clt 11009 ≤ cle 11010 / cdiv 11632 ℕcn 11973 2c2 12028 ℕ0cn0 12233 ℤcz 12319 ↑cexp 13782 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 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 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-2 12036 df-n0 12234 df-z 12320 df-uz 12583 df-seq 13722 df-exp 13783 |
This theorem is referenced by: dyaddisj 24760 dyadmax 24762 dyadmbllem 24763 dyadmbl 24764 opnmbllem 24765 opnmbllem0 35813 mblfinlem2 35815 |
Copyright terms: Public domain | W3C validator |