| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > oddpwdc | GIF version | ||
| Description: The function 𝐹 that decomposes a number into its "odd" and "even" parts, which is to say the largest power of two and largest odd divisor of a number, is a bijection from pairs of a nonnegative integer and an odd number to positive integers. (Contributed by Thierry Arnoux, 15-Aug-2017.) |
| Ref | Expression |
|---|---|
| oddpwdc.j | ⊢ 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧} |
| oddpwdc.f | ⊢ 𝐹 = (𝑥 ∈ 𝐽, 𝑦 ∈ ℕ0 ↦ ((2↑𝑦) · 𝑥)) |
| Ref | Expression |
|---|---|
| oddpwdc | ⊢ 𝐹:(𝐽 × ℕ0)–1-1-onto→ℕ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oddpwdc.f | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐽, 𝑦 ∈ ℕ0 ↦ ((2↑𝑦) · 𝑥)) | |
| 2 | 2cnd 9216 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ ℕ0) → 2 ∈ ℂ) | |
| 3 | simpr 110 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ ℕ0) → 𝑦 ∈ ℕ0) | |
| 4 | 2, 3 | expcld 10936 | . . . . 5 ⊢ ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ ℕ0) → (2↑𝑦) ∈ ℂ) |
| 5 | breq2 4092 | . . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → (2 ∥ 𝑧 ↔ 2 ∥ 𝑥)) | |
| 6 | 5 | notbid 673 | . . . . . . . . 9 ⊢ (𝑧 = 𝑥 → (¬ 2 ∥ 𝑧 ↔ ¬ 2 ∥ 𝑥)) |
| 7 | oddpwdc.j | . . . . . . . . 9 ⊢ 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧} | |
| 8 | 6, 7 | elrab2 2965 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝐽 ↔ (𝑥 ∈ ℕ ∧ ¬ 2 ∥ 𝑥)) |
| 9 | 8 | simplbi 274 | . . . . . . 7 ⊢ (𝑥 ∈ 𝐽 → 𝑥 ∈ ℕ) |
| 10 | 9 | adantr 276 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ ℕ0) → 𝑥 ∈ ℕ) |
| 11 | 10 | nncnd 9157 | . . . . 5 ⊢ ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ ℕ0) → 𝑥 ∈ ℂ) |
| 12 | 4, 11 | mulcld 8200 | . . . 4 ⊢ ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ ℕ0) → ((2↑𝑦) · 𝑥) ∈ ℂ) |
| 13 | 12 | adantl 277 | . . 3 ⊢ ((⊤ ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ ℕ0)) → ((2↑𝑦) · 𝑥) ∈ ℂ) |
| 14 | nnnn0 9409 | . . . . . 6 ⊢ (𝑎 ∈ ℕ → 𝑎 ∈ ℕ0) | |
| 15 | 2nn 9305 | . . . . . . 7 ⊢ 2 ∈ ℕ | |
| 16 | pw2dvdseu 12745 | . . . . . . . 8 ⊢ (𝑎 ∈ ℕ → ∃!𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎)) | |
| 17 | riotacl 5987 | . . . . . . . 8 ⊢ (∃!𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎) → (℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎)) ∈ ℕ0) | |
| 18 | 16, 17 | syl 14 | . . . . . . 7 ⊢ (𝑎 ∈ ℕ → (℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎)) ∈ ℕ0) |
| 19 | nnexpcl 10815 | . . . . . . 7 ⊢ ((2 ∈ ℕ ∧ (℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎)) ∈ ℕ0) → (2↑(℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎))) ∈ ℕ) | |
| 20 | 15, 18, 19 | sylancr 414 | . . . . . 6 ⊢ (𝑎 ∈ ℕ → (2↑(℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎))) ∈ ℕ) |
| 21 | nn0nndivcl 9464 | . . . . . 6 ⊢ ((𝑎 ∈ ℕ0 ∧ (2↑(℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎))) ∈ ℕ) → (𝑎 / (2↑(℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎)))) ∈ ℝ) | |
| 22 | 14, 20, 21 | syl2anc 411 | . . . . 5 ⊢ (𝑎 ∈ ℕ → (𝑎 / (2↑(℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎)))) ∈ ℝ) |
| 23 | 22, 18 | jca 306 | . . . 4 ⊢ (𝑎 ∈ ℕ → ((𝑎 / (2↑(℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎)))) ∈ ℝ ∧ (℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎)) ∈ ℕ0)) |
| 24 | 23 | adantl 277 | . . 3 ⊢ ((⊤ ∧ 𝑎 ∈ ℕ) → ((𝑎 / (2↑(℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎)))) ∈ ℝ ∧ (℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎)) ∈ ℕ0)) |
| 25 | 8 | anbi1i 458 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ ℕ0) ↔ ((𝑥 ∈ ℕ ∧ ¬ 2 ∥ 𝑥) ∧ 𝑦 ∈ ℕ0)) |
| 26 | 25 | anbi1i 458 | . . . . 5 ⊢ (((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ ℕ0) ∧ 𝑎 = ((2↑𝑦) · 𝑥)) ↔ (((𝑥 ∈ ℕ ∧ ¬ 2 ∥ 𝑥) ∧ 𝑦 ∈ ℕ0) ∧ 𝑎 = ((2↑𝑦) · 𝑥))) |
| 27 | oddpwdclemdc 12750 | . . . . 5 ⊢ ((((𝑥 ∈ ℕ ∧ ¬ 2 ∥ 𝑥) ∧ 𝑦 ∈ ℕ0) ∧ 𝑎 = ((2↑𝑦) · 𝑥)) ↔ (𝑎 ∈ ℕ ∧ (𝑥 = (𝑎 / (2↑(℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎)))) ∧ 𝑦 = (℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎))))) | |
| 28 | 26, 27 | bitri 184 | . . . 4 ⊢ (((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ ℕ0) ∧ 𝑎 = ((2↑𝑦) · 𝑥)) ↔ (𝑎 ∈ ℕ ∧ (𝑥 = (𝑎 / (2↑(℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎)))) ∧ 𝑦 = (℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎))))) |
| 29 | 28 | a1i 9 | . . 3 ⊢ (⊤ → (((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ ℕ0) ∧ 𝑎 = ((2↑𝑦) · 𝑥)) ↔ (𝑎 ∈ ℕ ∧ (𝑥 = (𝑎 / (2↑(℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎)))) ∧ 𝑦 = (℩𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝑎 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝑎)))))) |
| 30 | 1, 13, 24, 29 | f1od2 6400 | . 2 ⊢ (⊤ → 𝐹:(𝐽 × ℕ0)–1-1-onto→ℕ) |
| 31 | 30 | mptru 1406 | 1 ⊢ 𝐹:(𝐽 × ℕ0)–1-1-onto→ℕ |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 ∧ wa 104 ↔ wb 105 = wceq 1397 ⊤wtru 1398 ∈ wcel 2202 ∃!wreu 2512 {crab 2514 class class class wbr 4088 × cxp 4723 –1-1-onto→wf1o 5325 ℩crio 5970 (class class class)co 6018 ∈ cmpo 6020 ℂcc 8030 ℝcr 8031 1c1 8033 + caddc 8035 · cmul 8037 / cdiv 8852 ℕcn 9143 2c2 9194 ℕ0cn0 9402 ↑cexp 10801 ∥ cdvds 12353 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-mulrcl 8131 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-precex 8142 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 ax-pre-mulgt0 8149 ax-pre-mulext 8150 ax-arch 8151 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-po 4393 df-iso 4394 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-recs 6471 df-frec 6557 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-reap 8755 df-ap 8762 df-div 8853 df-inn 9144 df-2 9202 df-n0 9403 df-z 9480 df-uz 9756 df-q 9854 df-rp 9889 df-fz 10244 df-fl 10531 df-mod 10586 df-seqfrec 10711 df-exp 10802 df-dvds 12354 |
| This theorem is referenced by: sqpweven 12752 2sqpwodd 12753 xpnnen 13020 |
| Copyright terms: Public domain | W3C validator |