| 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 12472 | . . . . . . . 8 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℝ) | |
| 2 | 1 | adantr 480 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 𝑥 ∈ ℝ) |
| 3 | 2 | lep1d 12053 | . . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 𝑥 ≤ (𝑥 + 1)) |
| 4 | peano2re 11286 | . . . . . . . 8 ⊢ (𝑥 ∈ ℝ → (𝑥 + 1) ∈ ℝ) | |
| 5 | 2, 4 | syl 17 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 + 1) ∈ ℝ) |
| 6 | 2nn 12198 | . . . . . . . . . 10 ⊢ 2 ∈ ℕ | |
| 7 | nnexpcl 13981 | . . . . . . . . . 10 ⊢ ((2 ∈ ℕ ∧ 𝑦 ∈ ℕ0) → (2↑𝑦) ∈ ℕ) | |
| 8 | 6, 7 | mpan 690 | . . . . . . . . 9 ⊢ (𝑦 ∈ ℕ0 → (2↑𝑦) ∈ ℕ) |
| 9 | 8 | adantl 481 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (2↑𝑦) ∈ ℕ) |
| 10 | 9 | nnred 12140 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (2↑𝑦) ∈ ℝ) |
| 11 | 9 | nngt0d 12174 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 0 < (2↑𝑦)) |
| 12 | lediv1 11987 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ (𝑥 + 1) ∈ ℝ ∧ ((2↑𝑦) ∈ ℝ ∧ 0 < (2↑𝑦))) → (𝑥 ≤ (𝑥 + 1) ↔ (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)))) | |
| 13 | 2, 5, 10, 11, 12 | syl112anc 1376 | . . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 ≤ (𝑥 + 1) ↔ (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)))) |
| 14 | 3, 13 | mpbid 232 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦))) |
| 15 | df-br 5092 | . . . . 5 ⊢ ((𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)) ↔ 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ≤ ) | |
| 16 | 14, 15 | sylib 218 | . . . 4 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ≤ ) |
| 17 | nndivre 12166 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ (2↑𝑦) ∈ ℕ) → (𝑥 / (2↑𝑦)) ∈ ℝ) | |
| 18 | 1, 8, 17 | syl2an 596 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → (𝑥 / (2↑𝑦)) ∈ ℝ) |
| 19 | 1, 4 | syl 17 | . . . . . 6 ⊢ (𝑥 ∈ ℤ → (𝑥 + 1) ∈ ℝ) |
| 20 | nndivre 12166 | . . . . . 6 ⊢ (((𝑥 + 1) ∈ ℝ ∧ (2↑𝑦) ∈ ℕ) → ((𝑥 + 1) / (2↑𝑦)) ∈ ℝ) | |
| 21 | 19, 8, 20 | syl2an 596 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → ((𝑥 + 1) / (2↑𝑦)) ∈ ℝ) |
| 22 | 18, 21 | opelxpd 5655 | . . . 4 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ (ℝ × ℝ)) |
| 23 | 16, 22 | elind 4150 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ0) → 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ( ≤ ∩ (ℝ × ℝ))) |
| 24 | 23 | rgen2 3172 | . 2 ⊢ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℕ0 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ( ≤ ∩ (ℝ × ℝ)) |
| 25 | dyadmbl.1 | . . 3 ⊢ 𝐹 = (𝑥 ∈ ℤ, 𝑦 ∈ ℕ0 ↦ 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉) | |
| 26 | 25 | fmpo 8000 | . 2 ⊢ (∀𝑥 ∈ ℤ ∀𝑦 ∈ ℕ0 〈(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))〉 ∈ ( ≤ ∩ (ℝ × ℝ)) ↔ 𝐹:(ℤ × ℕ0)⟶( ≤ ∩ (ℝ × ℝ))) |
| 27 | 24, 26 | mpbi 230 | 1 ⊢ 𝐹:(ℤ × ℕ0)⟶( ≤ ∩ (ℝ × ℝ)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ∀wral 3047 ∩ cin 3901 〈cop 4582 class class class wbr 5091 × cxp 5614 ⟶wf 6477 (class class class)co 7346 ∈ cmpo 7348 ℝcr 11005 0cc0 11006 1c1 11007 + caddc 11009 < clt 11146 ≤ cle 11147 / cdiv 11774 ℕcn 12125 2c2 12180 ℕ0cn0 12381 ℤcz 12468 ↑cexp 13968 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-cnex 11062 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-addrcl 11067 ax-mulcl 11068 ax-mulrcl 11069 ax-mulcom 11070 ax-addass 11071 ax-mulass 11072 ax-distr 11073 ax-i2m1 11074 ax-1ne0 11075 ax-1rid 11076 ax-rnegex 11077 ax-rrecex 11078 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 ax-pre-ltadd 11082 ax-pre-mulgt0 11083 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-iun 4943 df-br 5092 df-opab 5154 df-mpt 5173 df-tr 5199 df-id 5511 df-eprel 5516 df-po 5524 df-so 5525 df-fr 5569 df-we 5571 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-1st 7921 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 df-sub 11346 df-neg 11347 df-div 11775 df-nn 12126 df-2 12188 df-n0 12382 df-z 12469 df-uz 12733 df-seq 13909 df-exp 13969 |
| This theorem is referenced by: dyaddisj 25525 dyadmax 25527 dyadmbllem 25528 dyadmbl 25529 opnmbllem 25530 opnmbllem0 37702 mblfinlem2 37704 |
| Copyright terms: Public domain | W3C validator |