| 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 9884. (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 9884 | . . . . . 6 ⊢ 𝐹:(ℝ × ℝ)–1-1-onto→ℂ |
| 3 | f1ocnv 5596 | . . . . . 6 ⊢ (𝐹:(ℝ × ℝ)–1-1-onto→ℂ → ◡𝐹:ℂ–1-1-onto→(ℝ × ℝ)) | |
| 4 | f1of 5583 | . . . . . 6 ⊢ (◡𝐹:ℂ–1-1-onto→(ℝ × ℝ) → ◡𝐹:ℂ⟶(ℝ × ℝ)) | |
| 5 | 2, 3, 4 | mp2b 8 | . . . . 5 ⊢ ◡𝐹:ℂ⟶(ℝ × ℝ) |
| 6 | 5 | a1i 9 | . . . 4 ⊢ (⊤ → ◡𝐹:ℂ⟶(ℝ × ℝ)) |
| 7 | 6 | feqmptd 5699 | . . 3 ⊢ (⊤ → ◡𝐹 = (𝑧 ∈ ℂ ↦ (◡𝐹‘𝑧))) |
| 8 | 7 | mptru 1406 | . 2 ⊢ ◡𝐹 = (𝑧 ∈ ℂ ↦ (◡𝐹‘𝑧)) |
| 9 | df-ov 6020 | . . . . . . 7 ⊢ ((ℜ‘𝑧)𝐹(ℑ‘𝑧)) = (𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉) | |
| 10 | recl 11413 | . . . . . . . 8 ⊢ (𝑧 ∈ ℂ → (ℜ‘𝑧) ∈ ℝ) | |
| 11 | imcl 11414 | . . . . . . . 8 ⊢ (𝑧 ∈ ℂ → (ℑ‘𝑧) ∈ ℝ) | |
| 12 | 10 | recnd 8207 | . . . . . . . . 9 ⊢ (𝑧 ∈ ℂ → (ℜ‘𝑧) ∈ ℂ) |
| 13 | ax-icn 8126 | . . . . . . . . . . 11 ⊢ i ∈ ℂ | |
| 14 | 13 | a1i 9 | . . . . . . . . . 10 ⊢ (𝑧 ∈ ℂ → i ∈ ℂ) |
| 15 | 11 | recnd 8207 | . . . . . . . . . 10 ⊢ (𝑧 ∈ ℂ → (ℑ‘𝑧) ∈ ℂ) |
| 16 | 14, 15 | mulcld 8199 | . . . . . . . . 9 ⊢ (𝑧 ∈ ℂ → (i · (ℑ‘𝑧)) ∈ ℂ) |
| 17 | 12, 16 | addcld 8198 | . . . . . . . 8 ⊢ (𝑧 ∈ ℂ → ((ℜ‘𝑧) + (i · (ℑ‘𝑧))) ∈ ℂ) |
| 18 | oveq1 6024 | . . . . . . . . 9 ⊢ (𝑥 = (ℜ‘𝑧) → (𝑥 + (i · 𝑦)) = ((ℜ‘𝑧) + (i · 𝑦))) | |
| 19 | oveq2 6025 | . . . . . . . . . 10 ⊢ (𝑦 = (ℑ‘𝑧) → (i · 𝑦) = (i · (ℑ‘𝑧))) | |
| 20 | 19 | oveq2d 6033 | . . . . . . . . 9 ⊢ (𝑦 = (ℑ‘𝑧) → ((ℜ‘𝑧) + (i · 𝑦)) = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) |
| 21 | 18, 20, 1 | ovmpog 6155 | . . . . . . . 8 ⊢ (((ℜ‘𝑧) ∈ ℝ ∧ (ℑ‘𝑧) ∈ ℝ ∧ ((ℜ‘𝑧) + (i · (ℑ‘𝑧))) ∈ ℂ) → ((ℜ‘𝑧)𝐹(ℑ‘𝑧)) = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) |
| 22 | 10, 11, 17, 21 | syl3anc 1273 | . . . . . . 7 ⊢ (𝑧 ∈ ℂ → ((ℜ‘𝑧)𝐹(ℑ‘𝑧)) = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) |
| 23 | 9, 22 | eqtr3id 2278 | . . . . . 6 ⊢ (𝑧 ∈ ℂ → (𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉) = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) |
| 24 | replim 11419 | . . . . . 6 ⊢ (𝑧 ∈ ℂ → 𝑧 = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) | |
| 25 | 23, 24 | eqtr4d 2267 | . . . . 5 ⊢ (𝑧 ∈ ℂ → (𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉) = 𝑧) |
| 26 | 25 | fveq2d 5643 | . . . 4 ⊢ (𝑧 ∈ ℂ → (◡𝐹‘(𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉)) = (◡𝐹‘𝑧)) |
| 27 | opelxpi 4757 | . . . . . 6 ⊢ (((ℜ‘𝑧) ∈ ℝ ∧ (ℑ‘𝑧) ∈ ℝ) → 〈(ℜ‘𝑧), (ℑ‘𝑧)〉 ∈ (ℝ × ℝ)) | |
| 28 | 10, 11, 27 | syl2anc 411 | . . . . 5 ⊢ (𝑧 ∈ ℂ → 〈(ℜ‘𝑧), (ℑ‘𝑧)〉 ∈ (ℝ × ℝ)) |
| 29 | f1ocnvfv1 5917 | . . . . 5 ⊢ ((𝐹:(ℝ × ℝ)–1-1-onto→ℂ ∧ 〈(ℜ‘𝑧), (ℑ‘𝑧)〉 ∈ (ℝ × ℝ)) → (◡𝐹‘(𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉)) = 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) | |
| 30 | 2, 28, 29 | sylancr 414 | . . . 4 ⊢ (𝑧 ∈ ℂ → (◡𝐹‘(𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉)) = 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| 31 | 26, 30 | eqtr3d 2266 | . . 3 ⊢ (𝑧 ∈ ℂ → (◡𝐹‘𝑧) = 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| 32 | 31 | mpteq2ia 4175 | . 2 ⊢ (𝑧 ∈ ℂ ↦ (◡𝐹‘𝑧)) = (𝑧 ∈ ℂ ↦ 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| 33 | 8, 32 | eqtri 2252 | 1 ⊢ ◡𝐹 = (𝑧 ∈ ℂ ↦ 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1397 ⊤wtru 1398 ∈ wcel 2202 〈cop 3672 ↦ cmpt 4150 × cxp 4723 ◡ccnv 4724 ⟶wf 5322 –1-1-onto→wf1o 5325 ‘cfv 5326 (class class class)co 6017 ∈ cmpo 6019 ℂcc 8029 ℝcr 8030 ici 8033 + caddc 8034 · cmul 8036 ℜcre 11400 ℑcim 11401 |
| 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-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-mulrcl 8130 ax-addcom 8131 ax-mulcom 8132 ax-addass 8133 ax-mulass 8134 ax-distr 8135 ax-i2m1 8136 ax-0lt1 8137 ax-1rid 8138 ax-0id 8139 ax-rnegex 8140 ax-precex 8141 ax-cnre 8142 ax-pre-ltirr 8143 ax-pre-ltwlin 8144 ax-pre-lttrn 8145 ax-pre-apti 8146 ax-pre-ltadd 8147 ax-pre-mulgt0 8148 ax-pre-mulext 8149 |
| This theorem depends on definitions: df-bi 117 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-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-po 4393 df-iso 4394 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 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218 df-le 8219 df-sub 8351 df-neg 8352 df-reap 8754 df-ap 8761 df-div 8852 df-2 9201 df-cj 11402 df-re 11403 df-im 11404 |
| This theorem is referenced by: cnrehmeocntop 15333 |
| Copyright terms: Public domain | W3C validator |