| 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 9986. (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 9986 | . . . . . 6 ⊢ 𝐹:(ℝ × ℝ)–1-1-onto→ℂ |
| 3 | f1ocnv 5629 | . . . . . 6 ⊢ (𝐹:(ℝ × ℝ)–1-1-onto→ℂ → ◡𝐹:ℂ–1-1-onto→(ℝ × ℝ)) | |
| 4 | f1of 5616 | . . . . . 6 ⊢ (◡𝐹:ℂ–1-1-onto→(ℝ × ℝ) → ◡𝐹:ℂ⟶(ℝ × ℝ)) | |
| 5 | 2, 3, 4 | mp2b 8 | . . . . 5 ⊢ ◡𝐹:ℂ⟶(ℝ × ℝ) |
| 6 | 5 | a1i 9 | . . . 4 ⊢ (⊤ → ◡𝐹:ℂ⟶(ℝ × ℝ)) |
| 7 | 6 | feqmptd 5732 | . . 3 ⊢ (⊤ → ◡𝐹 = (𝑧 ∈ ℂ ↦ (◡𝐹‘𝑧))) |
| 8 | 7 | mptru 1407 | . 2 ⊢ ◡𝐹 = (𝑧 ∈ ℂ ↦ (◡𝐹‘𝑧)) |
| 9 | df-ov 6055 | . . . . . . 7 ⊢ ((ℜ‘𝑧)𝐹(ℑ‘𝑧)) = (𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉) | |
| 10 | recl 11542 | . . . . . . . 8 ⊢ (𝑧 ∈ ℂ → (ℜ‘𝑧) ∈ ℝ) | |
| 11 | imcl 11543 | . . . . . . . 8 ⊢ (𝑧 ∈ ℂ → (ℑ‘𝑧) ∈ ℝ) | |
| 12 | 10 | recnd 8304 | . . . . . . . . 9 ⊢ (𝑧 ∈ ℂ → (ℜ‘𝑧) ∈ ℂ) |
| 13 | ax-icn 8224 | . . . . . . . . . . 11 ⊢ i ∈ ℂ | |
| 14 | 13 | a1i 9 | . . . . . . . . . 10 ⊢ (𝑧 ∈ ℂ → i ∈ ℂ) |
| 15 | 11 | recnd 8304 | . . . . . . . . . 10 ⊢ (𝑧 ∈ ℂ → (ℑ‘𝑧) ∈ ℂ) |
| 16 | 14, 15 | mulcld 8296 | . . . . . . . . 9 ⊢ (𝑧 ∈ ℂ → (i · (ℑ‘𝑧)) ∈ ℂ) |
| 17 | 12, 16 | addcld 8295 | . . . . . . . 8 ⊢ (𝑧 ∈ ℂ → ((ℜ‘𝑧) + (i · (ℑ‘𝑧))) ∈ ℂ) |
| 18 | oveq1 6059 | . . . . . . . . 9 ⊢ (𝑥 = (ℜ‘𝑧) → (𝑥 + (i · 𝑦)) = ((ℜ‘𝑧) + (i · 𝑦))) | |
| 19 | oveq2 6060 | . . . . . . . . . 10 ⊢ (𝑦 = (ℑ‘𝑧) → (i · 𝑦) = (i · (ℑ‘𝑧))) | |
| 20 | 19 | oveq2d 6068 | . . . . . . . . 9 ⊢ (𝑦 = (ℑ‘𝑧) → ((ℜ‘𝑧) + (i · 𝑦)) = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) |
| 21 | 18, 20, 1 | ovmpog 6190 | . . . . . . . 8 ⊢ (((ℜ‘𝑧) ∈ ℝ ∧ (ℑ‘𝑧) ∈ ℝ ∧ ((ℜ‘𝑧) + (i · (ℑ‘𝑧))) ∈ ℂ) → ((ℜ‘𝑧)𝐹(ℑ‘𝑧)) = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) |
| 22 | 10, 11, 17, 21 | syl3anc 1274 | . . . . . . 7 ⊢ (𝑧 ∈ ℂ → ((ℜ‘𝑧)𝐹(ℑ‘𝑧)) = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) |
| 23 | 9, 22 | eqtr3id 2281 | . . . . . 6 ⊢ (𝑧 ∈ ℂ → (𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉) = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) |
| 24 | replim 11548 | . . . . . 6 ⊢ (𝑧 ∈ ℂ → 𝑧 = ((ℜ‘𝑧) + (i · (ℑ‘𝑧)))) | |
| 25 | 23, 24 | eqtr4d 2270 | . . . . 5 ⊢ (𝑧 ∈ ℂ → (𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉) = 𝑧) |
| 26 | 25 | fveq2d 5676 | . . . 4 ⊢ (𝑧 ∈ ℂ → (◡𝐹‘(𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉)) = (◡𝐹‘𝑧)) |
| 27 | opelxpi 4783 | . . . . . 6 ⊢ (((ℜ‘𝑧) ∈ ℝ ∧ (ℑ‘𝑧) ∈ ℝ) → 〈(ℜ‘𝑧), (ℑ‘𝑧)〉 ∈ (ℝ × ℝ)) | |
| 28 | 10, 11, 27 | syl2anc 411 | . . . . 5 ⊢ (𝑧 ∈ ℂ → 〈(ℜ‘𝑧), (ℑ‘𝑧)〉 ∈ (ℝ × ℝ)) |
| 29 | f1ocnvfv1 5952 | . . . . 5 ⊢ ((𝐹:(ℝ × ℝ)–1-1-onto→ℂ ∧ 〈(ℜ‘𝑧), (ℑ‘𝑧)〉 ∈ (ℝ × ℝ)) → (◡𝐹‘(𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉)) = 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) | |
| 30 | 2, 28, 29 | sylancr 414 | . . . 4 ⊢ (𝑧 ∈ ℂ → (◡𝐹‘(𝐹‘〈(ℜ‘𝑧), (ℑ‘𝑧)〉)) = 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| 31 | 26, 30 | eqtr3d 2269 | . . 3 ⊢ (𝑧 ∈ ℂ → (◡𝐹‘𝑧) = 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| 32 | 31 | mpteq2ia 4198 | . 2 ⊢ (𝑧 ∈ ℂ ↦ (◡𝐹‘𝑧)) = (𝑧 ∈ ℂ ↦ 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| 33 | 8, 32 | eqtri 2255 | 1 ⊢ ◡𝐹 = (𝑧 ∈ ℂ ↦ 〈(ℜ‘𝑧), (ℑ‘𝑧)〉) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1398 ⊤wtru 1399 ∈ wcel 2205 〈cop 3694 ↦ cmpt 4173 × cxp 4749 ◡ccnv 4750 ⟶wf 5350 –1-1-onto→wf1o 5353 ‘cfv 5354 (class class class)co 6052 ∈ cmpo 6054 ℂcc 8127 ℝcr 8128 ici 8131 + caddc 8132 · cmul 8134 ℜcre 11529 ℑcim 11530 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-cnex 8220 ax-resscn 8221 ax-1cn 8222 ax-1re 8223 ax-icn 8224 ax-addcl 8225 ax-addrcl 8226 ax-mulcl 8227 ax-mulrcl 8228 ax-addcom 8229 ax-mulcom 8230 ax-addass 8231 ax-mulass 8232 ax-distr 8233 ax-i2m1 8234 ax-0lt1 8235 ax-1rid 8236 ax-0id 8237 ax-rnegex 8238 ax-precex 8239 ax-cnre 8240 ax-pre-ltirr 8241 ax-pre-ltwlin 8242 ax-pre-lttrn 8243 ax-pre-apti 8244 ax-pre-ltadd 8245 ax-pre-mulgt0 8246 ax-pre-mulext 8247 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-id 4416 df-po 4419 df-iso 4420 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-1st 6336 df-2nd 6337 df-pnf 8312 df-mnf 8313 df-xr 8314 df-ltxr 8315 df-le 8316 df-sub 8448 df-neg 8449 df-reap 8851 df-ap 8858 df-div 8949 df-2 9298 df-cj 11531 df-re 11532 df-im 11533 |
| This theorem is referenced by: cnrehmeocntop 15492 |
| Copyright terms: Public domain | W3C validator |