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 11979 | . . . . . . . 8 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℝ) | |
2 | 1 | adantr 483 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 𝑥 ∈ ℝ) |
3 | 2 | lep1d 11565 | . . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 𝑥 ≤ (𝑥 + 1)) |
4 | peano2re 10807 | . . . . . . . 8 ⊢ (𝑥 ∈ ℝ → (𝑥 + 1) ∈ ℝ) | |
5 | 2, 4 | syl 17 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 + 1) ∈ ℝ) |
6 | 2nn 11704 | . . . . . . . . . 10 ⊢ 2 ∈ ℕ | |
7 | nnexpcl 13436 | . . . . . . . . . 10 ⊢ ((2 ∈ ℕ ∧ 𝑦 ∈ ℕ0) → (2↑𝑦) ∈ ℕ) | |
8 | 6, 7 | mpan 688 | . . . . . . . . 9 ⊢ (𝑦 ∈ ℕ0 → (2↑𝑦) ∈ ℕ) |
9 | 8 | adantl 484 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (2↑𝑦) ∈ ℕ) |
10 | 9 | nnred 11647 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (2↑𝑦) ∈ ℝ) |
11 | 9 | nngt0d 11680 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 0 < (2↑𝑦)) |
12 | lediv1 11499 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ (𝑥 + 1) ∈ ℝ ∧ ((2↑𝑦) ∈ ℝ ∧ 0 < (2↑𝑦))) → (𝑥 ≤ (𝑥 + 1) ↔ (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)))) | |
13 | 2, 5, 10, 11, 12 | syl112anc 1370 | . . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 ≤ (𝑥 + 1) ↔ (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)))) |
14 | 3, 13 | mpbid 234 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦))) |
15 | df-br 5059 | . . . . 5 ⊢ ((𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)) ↔ 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ≤ ) | |
16 | 14, 15 | sylib 220 | . . . 4 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ≤ ) |
17 | nndivre 11672 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ (2↑𝑦) ∈ ℕ) → (𝑥 / (2↑𝑦)) ∈ ℝ) | |
18 | 1, 8, 17 | syl2an 597 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 / (2↑𝑦)) ∈ ℝ) |
19 | 1, 4 | syl 17 | . . . . . 6 ⊢ (𝑥 ∈ ℤ → (𝑥 + 1) ∈ ℝ) |
20 | nndivre 11672 | . . . . . 6 ⊢ (((𝑥 + 1) ∈ ℝ ∧ (2↑𝑦) ∈ ℕ) → ((𝑥 + 1) / (2↑𝑦)) ∈ ℝ) | |
21 | 19, 8, 20 | syl2an 597 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → ((𝑥 + 1) / (2↑𝑦)) ∈ ℝ) |
22 | 18, 21 | opelxpd 5587 | . . . 4 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ (ℝ × ℝ)) |
23 | 16, 22 | elind 4170 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ( ≤ ∩ (ℝ × ℝ))) |
24 | 23 | rgen2 3203 | . 2 ⊢ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℕ0 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ( ≤ ∩ (ℝ × ℝ)) |
25 | dyadmbl.1 | . . 3 ⊢ 𝐹 = (𝑥 ∈ ℤ, 𝑦 ∈ ℕ0 ↦ 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉) | |
26 | 25 | fmpo 7760 | . 2 ⊢ (∀𝑥 ∈ ℤ ∀𝑦 ∈ ℕ0 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ( ≤ ∩ (ℝ × ℝ)) ↔ 𝐹:(ℤ × ℕ0)⟶( ≤ ∩ (ℝ × ℝ))) |
27 | 24, 26 | mpbi 232 | 1 ⊢ 𝐹:(ℤ × ℕ0)⟶( ≤ ∩ (ℝ × ℝ)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ∀wral 3138 ∩ cin 3934 〈cop 4566 class class class wbr 5058 × cxp 5547 ⟶wf 6345 (class class class)co 7150 ∈ cmpo 7152 ℝcr 10530 0cc0 10531 1c1 10532 + caddc 10534 < clt 10669 ≤ cle 10670 / cdiv 11291 ℕcn 11632 2c2 11686 ℕ0cn0 11891 ℤcz 11975 ↑cexp 13423 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-div 11292 df-nn 11633 df-2 11694 df-n0 11892 df-z 11976 df-uz 12238 df-seq 13364 df-exp 13424 |
This theorem is referenced by: dyaddisj 24191 dyadmax 24193 dyadmbllem 24194 dyadmbl 24195 opnmbllem 24196 opnmbllem0 34922 mblfinlem2 34924 |
Copyright terms: Public domain | W3C validator |