| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cnrecnv | GIF version | ||
| Description: The inverse to the canonical bijection from (ℝ × ℝ) to ℂ from cnref1o 9846. (Contributed by Mario Carneiro, 25-Aug-2014.) |
| Ref | Expression |
|---|---|
| cnrecnv.1 | ⊢ 𝐹 = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ (𝑥 + (i · 𝑦))) |
| Ref | Expression |
|---|---|
| cnrecnv | ⊢ ◡𝐹 = (𝑧 ∈ ℂ ↦ 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnrecnv.1 | . . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ (𝑥 + (i · 𝑦))) | |
| 2 | 1 | cnref1o 9846 | . . . . . 6 ⊢ 𝐹:(ℝ × ℝ)–1-1-onto→ℂ |
| 3 | f1ocnv 5585 | . . . . . 6 ⊢ (𝐹:(ℝ × ℝ)–1-1-onto→ℂ → ◡𝐹:ℂ–1-1-onto→(ℝ × ℝ)) | |
| 4 | f1of 5572 | . . . . . 6 ⊢ (◡𝐹:ℂ–1-1-onto→(ℝ × ℝ) → ◡𝐹:ℂ⟶(ℝ × ℝ)) | |
| 5 | 2, 3, 4 | mp2b 8 | . . . . 5 ⊢ ◡𝐹:ℂ⟶(ℝ × ℝ) |
| 6 | 5 | a1i 9 | . . . 4 ⊢ (⊤ → ◡𝐹:ℂ⟶(ℝ × ℝ)) |
| 7 | 6 | feqmptd 5687 | . . 3 ⊢ (⊤ → ◡𝐹 = (𝑧 ∈ ℂ ↦ (◡𝐹‘𝑧))) |
| 8 | 7 | mptru 1404 | . 2 ⊢ ◡𝐹 = (𝑧 ∈ ℂ ↦ (◡𝐹‘𝑧)) |
| 9 | df-ov 6004 | . . . . . . 7 ⊢ ((ℜ‘𝑧)𝐹(ℑ‘𝑧)) = (𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉) | |
| 10 | recl 11364 | . . . . . . . 8 ⊢ (𝑧 ∈ ℂ → (ℜ‘𝑧) ∈ ℝ) | |
| 11 | imcl 11365 | . . . . . . . 8 ⊢ (𝑧 ∈ ℂ → (ℑ‘𝑧) ∈ ℝ) | |
| 12 | 10 | recnd 8175 | . . . . . . . . 9 ⊢ (𝑧 ∈ ℂ → (ℜ‘𝑧) ∈ ℂ) |
| 13 | ax-icn 8094 | . . . . . . . . . . 11 ⊢ i ∈ ℂ | |
| 14 | 13 | a1i 9 | . . . . . . . . . 10 ⊢ (𝑧 ∈ ℂ → i ∈ ℂ) |
| 15 | 11 | recnd 8175 | . . . . . . . . . 10 ⊢ (𝑧 ∈ ℂ → (ℑ‘𝑧) ∈ ℂ) |
| 16 | 14, 15 | mulcld 8167 | . . . . . . . . 9 ⊢ (𝑧 ∈ ℂ → (i · (ℑ‘𝑧)) ∈ ℂ) |
| 17 | 12, 16 | addcld 8166 | . . . . . . . 8 ⊢ (𝑧 ∈ ℂ → ((ℜ‘𝑧) + (i · (ℑ‘𝑧))) ∈ ℂ) |
| 18 | oveq1 6008 | . . . . . . . . 9 ⊢ (𝑥 = (ℜ‘𝑧) → (𝑥 + (i · 𝑦)) = ((ℜ‘𝑧) + (i · 𝑦))) | |
| 19 | oveq2 6009 | . . . . . . . . . 10 ⊢ (𝑦 = (ℑ‘𝑧) → (i · 𝑦) = (i · (ℑ‘𝑧))) | |
| 20 | 19 | oveq2d 6017 | . . . . . . . . 9 ⊢ (𝑦 = (ℑ‘𝑧) → ((ℜ‘𝑧) + (i · 𝑦)) = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) |
| 21 | 18, 20, 1 | ovmpog 6139 | . . . . . . . 8 ⊢ (((ℜ‘𝑧) ∈ ℝ ∧ (ℑ‘𝑧) ∈ ℝ ∧ ((ℜ‘𝑧) + (i · (ℑ‘𝑧))) ∈ ℂ) → ((ℜ‘𝑧)𝐹(ℑ‘𝑧)) = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) |
| 22 | 10, 11, 17, 21 | syl3anc 1271 | . . . . . . 7 ⊢ (𝑧 ∈ ℂ → ((ℜ‘𝑧)𝐹(ℑ‘𝑧)) = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) |
| 23 | 9, 22 | eqtr3id 2276 | . . . . . 6 ⊢ (𝑧 ∈ ℂ → (𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉) = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) |
| 24 | replim 11370 | . . . . . 6 ⊢ (𝑧 ∈ ℂ → 𝑧 = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) | |
| 25 | 23, 24 | eqtr4d 2265 | . . . . 5 ⊢ (𝑧 ∈ ℂ → (𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉) = 𝑧) |
| 26 | 25 | fveq2d 5631 | . . . 4 ⊢ (𝑧 ∈ ℂ → (◡𝐹‘(𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉)) = (◡𝐹‘𝑧)) |
| 27 | opelxpi 4751 | . . . . . 6 ⊢ (((ℜ‘𝑧) ∈ ℝ ∧ (ℑ‘𝑧) ∈ ℝ) → 〈(ℜ‘𝑧), (ℑ‘𝑧)〉 ∈ (ℝ × ℝ)) | |
| 28 | 10, 11, 27 | syl2anc 411 | . . . . 5 ⊢ (𝑧 ∈ ℂ → 〈(ℜ‘𝑧), (ℑ‘𝑧)〉 ∈ (ℝ × ℝ)) |
| 29 | f1ocnvfv1 5901 | . . . . 5 ⊢ ((𝐹:(ℝ × ℝ)–1-1-onto→ℂ ∧ 〈(ℜ‘𝑧), (ℑ‘𝑧)〉 ∈ (ℝ × ℝ)) → (◡𝐹‘(𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉)) = 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) | |
| 30 | 2, 28, 29 | sylancr 414 | . . . 4 ⊢ (𝑧 ∈ ℂ → (◡𝐹‘(𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉)) = 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| 31 | 26, 30 | eqtr3d 2264 | . . 3 ⊢ (𝑧 ∈ ℂ → (◡𝐹‘𝑧) = 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| 32 | 31 | mpteq2ia 4170 | . 2 ⊢ (𝑧 ∈ ℂ ↦ (◡𝐹‘𝑧)) = (𝑧 ∈ ℂ ↦ 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| 33 | 8, 32 | eqtri 2250 | 1 ⊢ ◡𝐹 = (𝑧 ∈ ℂ ↦ 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1395 ⊤wtru 1396 ∈ wcel 2200 〈cop 3669 ↦ cmpt 4145 × cxp 4717 ◡ccnv 4718 ⟶wf 5314 –1-1-onto→wf1o 5317 ‘cfv 5318 (class class class)co 6001 ∈ cmpo 6003 ℂcc 7997 ℝcr 7998 ici 8001 + caddc 8002 · cmul 8004 ℜcre 11351 ℑcim 11352 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8090 ax-resscn 8091 ax-1cn 8092 ax-1re 8093 ax-icn 8094 ax-addcl 8095 ax-addrcl 8096 ax-mulcl 8097 ax-mulrcl 8098 ax-addcom 8099 ax-mulcom 8100 ax-addass 8101 ax-mulass 8102 ax-distr 8103 ax-i2m1 8104 ax-0lt1 8105 ax-1rid 8106 ax-0id 8107 ax-rnegex 8108 ax-precex 8109 ax-cnre 8110 ax-pre-ltirr 8111 ax-pre-ltwlin 8112 ax-pre-lttrn 8113 ax-pre-apti 8114 ax-pre-ltadd 8115 ax-pre-mulgt0 8116 ax-pre-mulext 8117 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-po 4387 df-iso 4388 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5954 df-ov 6004 df-oprab 6005 df-mpo 6006 df-1st 6286 df-2nd 6287 df-pnf 8183 df-mnf 8184 df-xr 8185 df-ltxr 8186 df-le 8187 df-sub 8319 df-neg 8320 df-reap 8722 df-ap 8729 df-div 8820 df-2 9169 df-cj 11353 df-re 11354 df-im 11355 |
| This theorem is referenced by: cnrehmeocntop 15284 |
| Copyright terms: Public domain | W3C validator |