| 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 10051. (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 10051 | . . . . . 6 ⊢ 𝐹:(ℝ × ℝ)–1-1-onto→ℂ |
| 3 | f1ocnv 5652 | . . . . . 6 ⊢ (𝐹:(ℝ × ℝ)–1-1-onto→ℂ → ◡𝐹:ℂ–1-1-onto→(ℝ × ℝ)) | |
| 4 | f1of 5639 | . . . . . 6 ⊢ (◡𝐹:ℂ–1-1-onto→(ℝ × ℝ) → ◡𝐹:ℂ⟶(ℝ × ℝ)) | |
| 5 | 2, 3, 4 | mp2b 8 | . . . . 5 ⊢ ◡𝐹:ℂ⟶(ℝ × ℝ) |
| 6 | 5 | a1i 9 | . . . 4 ⊢ (⊤ → ◡𝐹:ℂ⟶(ℝ × ℝ)) |
| 7 | 6 | feqmptd 5756 | . . 3 ⊢ (⊤ → ◡𝐹 = (𝑧 ∈ ℂ ↦ (◡𝐹‘𝑧))) |
| 8 | 7 | mptru 1411 | . 2 ⊢ ◡𝐹 = (𝑧 ∈ ℂ ↦ (◡𝐹‘𝑧)) |
| 9 | df-ov 6088 | . . . . . . 7 ⊢ ((ℜ‘𝑧)𝐹(ℑ‘𝑧)) = (𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉) | |
| 10 | recl 11618 | . . . . . . . 8 ⊢ (𝑧 ∈ ℂ → (ℜ‘𝑧) ∈ ℝ) | |
| 11 | imcl 11619 | . . . . . . . 8 ⊢ (𝑧 ∈ ℂ → (ℑ‘𝑧) ∈ ℝ) | |
| 12 | 10 | recnd 8354 | . . . . . . . . 9 ⊢ (𝑧 ∈ ℂ → (ℜ‘𝑧) ∈ ℂ) |
| 13 | ax-icn 8274 | . . . . . . . . . . 11 ⊢ i ∈ ℂ | |
| 14 | 13 | a1i 9 | . . . . . . . . . 10 ⊢ (𝑧 ∈ ℂ → i ∈ ℂ) |
| 15 | 11 | recnd 8354 | . . . . . . . . . 10 ⊢ (𝑧 ∈ ℂ → (ℑ‘𝑧) ∈ ℂ) |
| 16 | 14, 15 | mulcld 8346 | . . . . . . . . 9 ⊢ (𝑧 ∈ ℂ → (i · (ℑ‘𝑧)) ∈ ℂ) |
| 17 | 12, 16 | addcld 8345 | . . . . . . . 8 ⊢ (𝑧 ∈ ℂ → ((ℜ‘𝑧) + (i · (ℑ‘𝑧))) ∈ ℂ) |
| 18 | oveq1 6092 | . . . . . . . . 9 ⊢ (𝑥 = (ℜ‘𝑧) → (𝑥 + (i · 𝑦)) = ((ℜ‘𝑧) + (i · 𝑦))) | |
| 19 | oveq2 6093 | . . . . . . . . . 10 ⊢ (𝑦 = (ℑ‘𝑧) → (i · 𝑦) = (i · (ℑ‘𝑧))) | |
| 20 | 19 | oveq2d 6101 | . . . . . . . . 9 ⊢ (𝑦 = (ℑ‘𝑧) → ((ℜ‘𝑧) + (i · 𝑦)) = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) |
| 21 | 18, 20, 1 | ovmpog 6223 | . . . . . . . 8 ⊢ (((ℜ‘𝑧) ∈ ℝ ∧ (ℑ‘𝑧) ∈ ℝ ∧ ((ℜ‘𝑧) + (i · (ℑ‘𝑧))) ∈ ℂ) → ((ℜ‘𝑧)𝐹(ℑ‘𝑧)) = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) |
| 22 | 10, 11, 17, 21 | syl3anc 1278 | . . . . . . 7 ⊢ (𝑧 ∈ ℂ → ((ℜ‘𝑧)𝐹(ℑ‘𝑧)) = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) |
| 23 | 9, 22 | eqtr3id 2285 | . . . . . 6 ⊢ (𝑧 ∈ ℂ → (𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉) = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) |
| 24 | replim 11624 | . . . . . 6 ⊢ (𝑧 ∈ ℂ → 𝑧 = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) | |
| 25 | 23, 24 | eqtr4d 2274 | . . . . 5 ⊢ (𝑧 ∈ ℂ → (𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉) = 𝑧) |
| 26 | 25 | fveq2d 5699 | . . . 4 ⊢ (𝑧 ∈ ℂ → (◡𝐹‘(𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉)) = (◡𝐹‘𝑧)) |
| 27 | opelxpi 4806 | . . . . . 6 ⊢ (((ℜ‘𝑧) ∈ ℝ ∧ (ℑ‘𝑧) ∈ ℝ) → 〈(ℜ‘𝑧), (ℑ‘𝑧)〉 ∈ (ℝ × ℝ)) | |
| 28 | 10, 11, 27 | syl2anc 415 | . . . . 5 ⊢ (𝑧 ∈ ℂ → 〈(ℜ‘𝑧), (ℑ‘𝑧)〉 ∈ (ℝ × ℝ)) |
| 29 | f1ocnvfv1 5983 | . . . . 5 ⊢ ((𝐹:(ℝ × ℝ)–1-1-onto→ℂ ∧ 〈(ℜ‘𝑧), (ℑ‘𝑧)〉 ∈ (ℝ × ℝ)) → (◡𝐹‘(𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉)) = 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) | |
| 30 | 2, 28, 29 | sylancr 418 | . . . 4 ⊢ (𝑧 ∈ ℂ → (◡𝐹‘(𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉)) = 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| 31 | 26, 30 | eqtr3d 2273 | . . 3 ⊢ (𝑧 ∈ ℂ → (◡𝐹‘𝑧) = 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| 32 | 31 | mpteq2ia 4217 | . 2 ⊢ (𝑧 ∈ ℂ ↦ (◡𝐹‘𝑧)) = (𝑧 ∈ ℂ ↦ 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| 33 | 8, 32 | eqtri 2259 | 1 ⊢ ◡𝐹 = (𝑧 ∈ ℂ ↦ 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: = wceq 1402 ⊤wtru 1403 ∈ wcel 2209 〈cop 3712 ↦ cmpt 4192 × cxp 4772 ◡ccnv 4773 ⟶wf 5373 –1-1-onto→wf1o 5376 ‘cfv 5377 (class class class)co 6085 ∈ cmpo 6087 ℂcc 8177 ℝcr 8178 ici 8181 + caddc 8182 · cmul 8184 ℜcre 11605 ℑcim 11606 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-mulrcl 8278 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-precex 8289 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295 ax-pre-mulgt0 8296 ax-pre-mulext 8297 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-po 4441 df-iso 4442 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-reap 8903 df-ap 8910 df-div 9003 df-2 9363 df-cj 11607 df-re 11608 df-im 11609 |
| This theorem is used by: cnrehmeocntop 15711 |
| Copyright terms: Public domain | W3C validator |