MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cnref1o Structured version   Visualization version   GIF version

Theorem cnref1o 13153
Description: There is a natural one-to-one mapping from (ℝ × ℝ) to ℂ, where we map ⟨𝑥, 𝑦⟩ to (𝑥 + (i · 𝑦)). In our construction of the complex numbers, this is in fact our definition of ℂ (see df-c 11245), but in the axiomatic treatment we can only show that there is the expected mapping between these two sets. (Contributed by Mario Carneiro, 16-Jun-2013.) (Revised by Mario Carneiro, 17-Feb-2014.)
Hypothesis
Ref Expression
cnref1o.1 𝐹 = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ (𝑥 + (i · 𝑦)))
Assertion
Ref Expression
cnref1o 𝐹:(ℝ × ℝ)⟶1-1ontoℂ
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝐹(𝑥, 𝑦)

Proof of Theorem cnref1o
Dummy variables 𝑢 𝑣 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnref1o.1 . . . . 5 𝐹 = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ (𝑥 + (i · 𝑦)))
2 ovex 7484 . . . . 5 (𝑥 + (i · 𝑦)) ∈ V
31, 2fnmpoi 8116 . . . 4 𝐹 Fn (ℝ × ℝ)
4 1st2nd2 8074 . . . . . . . . 9 (𝑧 ∈ (ℝ × ℝ) → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
54fveq2d 6920 . . . . . . . 8 (𝑧 ∈ (ℝ × ℝ) → (𝐹‘𝑧) = (𝐹‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩))
6 df-ov 7454 . . . . . . . 8 ((1st ‘𝑧)𝐹(2nd ‘𝑧)) = (𝐹‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
75, 6eqtr4di 2816 . . . . . . 7 (𝑧 ∈ (ℝ × ℝ) → (𝐹‘𝑧) = ((1st ‘𝑧)𝐹(2nd ‘𝑧)))
8 xp1st 8067 . . . . . . . 8 (𝑧 ∈ (ℝ × ℝ) → (1st ‘𝑧) ∈ ℝ)
9 xp2nd 8068 . . . . . . . 8 (𝑧 ∈ (ℝ × ℝ) → (2nd ‘𝑧) ∈ ℝ)
10 oveq1 7458 . . . . . . . . 9 (𝑥 = (1st ‘𝑧) → (𝑥 + (i · 𝑦)) = ((1st ‘𝑧) + (i · 𝑦)))
11 oveq2 7459 . . . . . . . . . 10 (𝑦 = (2nd ‘𝑧) → (i · 𝑦) = (i · (2nd ‘𝑧)))
1211oveq2d 7467 . . . . . . . . 9 (𝑦 = (2nd ‘𝑧) → ((1st ‘𝑧) + (i · 𝑦)) = ((1st ‘𝑧) + (i · (2nd ‘𝑧))))
13 ovex 7484 . . . . . . . . 9 ((1st ‘𝑧) + (i · (2nd ‘𝑧))) ∈ V
1410, 12, 1, 13ovmpo 7612 . . . . . . . 8 (((1st ‘𝑧) ∈ ℝ ∧ (2nd ‘𝑧) ∈ ℝ) → ((1st ‘𝑧)𝐹(2nd ‘𝑧)) = ((1st ‘𝑧) + (i · (2nd ‘𝑧))))
158, 9, 14syl2anc 596 . . . . . . 7 (𝑧 ∈ (ℝ × ℝ) → ((1st ‘𝑧)𝐹(2nd ‘𝑧)) = ((1st ‘𝑧) + (i · (2nd ‘𝑧))))
167, 15eqtrd 2798 . . . . . 6 (𝑧 ∈ (ℝ × ℝ) → (𝐹‘𝑧) = ((1st ‘𝑧) + (i · (2nd ‘𝑧))))
178recnd 11376 . . . . . . 7 (𝑧 ∈ (ℝ × ℝ) → (1st ‘𝑧) ∈ ℂ)
18 ax-icn 11298 . . . . . . . 8 i ∈ ℂ
199recnd 11376 . . . . . . . 8 (𝑧 ∈ (ℝ × ℝ) → (2nd ‘𝑧) ∈ ℂ)
20 mulcl 11323 . . . . . . . 8 ((i ∈ ℂ ∧ (2nd ‘𝑧) ∈ ℂ) → (i · (2nd ‘𝑧)) ∈ ℂ)
2118, 19, 20sylancr 599 . . . . . . 7 (𝑧 ∈ (ℝ × ℝ) → (i · (2nd ‘𝑧)) ∈ ℂ)
2217, 21addcld 11367 . . . . . 6 (𝑧 ∈ (ℝ × ℝ) → ((1st ‘𝑧) + (i · (2nd ‘𝑧))) ∈ ℂ)
2316, 22eqeltrd 2864 . . . . 5 (𝑧 ∈ (ℝ × ℝ) → (𝐹‘𝑧) ∈ ℂ)
2423rgen 3082 . . . 4 ∀𝑧 ∈ (ℝ × ℝ)(𝐹‘𝑧) ∈ ℂ
25 ffnfv 7151 . . . 4 (𝐹:(ℝ × ℝ)⟶ℂ ↔ (𝐹 Fn (ℝ × ℝ) ∧ ∀𝑧 ∈ (ℝ × ℝ)(𝐹‘𝑧) ∈ ℂ))
263, 24, 25mpbir2an 724 . . 3 𝐹:(ℝ × ℝ)⟶ℂ
278, 9jca 521 . . . . . . 7 (𝑧 ∈ (ℝ × ℝ) → ((1st ‘𝑧) ∈ ℝ ∧ (2nd ‘𝑧) ∈ ℝ))
28 xp1st 8067 . . . . . . . 8 (𝑤 ∈ (ℝ × ℝ) → (1st ‘𝑤) ∈ ℝ)
29 xp2nd 8068 . . . . . . . 8 (𝑤 ∈ (ℝ × ℝ) → (2nd ‘𝑤) ∈ ℝ)
3028, 29jca 521 . . . . . . 7 (𝑤 ∈ (ℝ × ℝ) → ((1st ‘𝑤) ∈ ℝ ∧ (2nd ‘𝑤) ∈ ℝ))
31 cru 12352 . . . . . . 7 ((((1st ‘𝑧) ∈ ℝ ∧ (2nd ‘𝑧) ∈ ℝ) ∧ ((1st ‘𝑤) ∈ ℝ ∧ (2nd ‘𝑤) ∈ ℝ)) → (((1st ‘𝑧) + (i · (2nd ‘𝑧))) = ((1st ‘𝑤) + (i · (2nd ‘𝑤))) ↔ ((1st ‘𝑧) = (1st ‘𝑤) ∧ (2nd ‘𝑧) = (2nd ‘𝑤))))
3227, 30, 31syl2an 608 . . . . . 6 ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → (((1st ‘𝑧) + (i · (2nd ‘𝑧))) = ((1st ‘𝑤) + (i · (2nd ‘𝑤))) ↔ ((1st ‘𝑧) = (1st ‘𝑤) ∧ (2nd ‘𝑧) = (2nd ‘𝑤))))
33 fveq2 6916 . . . . . . . . 9 (𝑧 = 𝑤 → (𝐹‘𝑧) = (𝐹‘𝑤))
34 fveq2 6916 . . . . . . . . . 10 (𝑧 = 𝑤 → (1st ‘𝑧) = (1st ‘𝑤))
35 fveq2 6916 . . . . . . . . . . 11 (𝑧 = 𝑤 → (2nd ‘𝑧) = (2nd ‘𝑤))
3635oveq2d 7467 . . . . . . . . . 10 (𝑧 = 𝑤 → (i · (2nd ‘𝑧)) = (i · (2nd ‘𝑤)))
3734, 36oveq12d 7469 . . . . . . . . 9 (𝑧 = 𝑤 → ((1st ‘𝑧) + (i · (2nd ‘𝑧))) = ((1st ‘𝑤) + (i · (2nd ‘𝑤))))
3833, 37eqeq12d 2779 . . . . . . . 8 (𝑧 = 𝑤 → ((𝐹‘𝑧) = ((1st ‘𝑧) + (i · (2nd ‘𝑧))) ↔ (𝐹‘𝑤) = ((1st ‘𝑤) + (i · (2nd ‘𝑤)))))
3938, 16vtoclga 3540 . . . . . . 7 (𝑤 ∈ (ℝ × ℝ) → (𝐹‘𝑤) = ((1st ‘𝑤) + (i · (2nd ‘𝑤))))
4016, 39eqeqan12d 2777 . . . . . 6 ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ ((1st ‘𝑧) + (i · (2nd ‘𝑧))) = ((1st ‘𝑤) + (i · (2nd ‘𝑤)))))
41 1st2nd2 8074 . . . . . . . 8 (𝑤 ∈ (ℝ × ℝ) → 𝑤 = ⟨(1st ‘𝑤), (2nd ‘𝑤)⟩)
424, 41eqeqan12d 2777 . . . . . . 7 ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → (𝑧 = 𝑤 ↔ ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ = ⟨(1st ‘𝑤), (2nd ‘𝑤)⟩))
43 fvex 6929 . . . . . . . 8 (1st ‘𝑧) ∈ V
44 fvex 6929 . . . . . . . 8 (2nd ‘𝑧) ∈ V
4543, 44opth 5452 . . . . . . 7 (⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ = ⟨(1st ‘𝑤), (2nd ‘𝑤)⟩ ↔ ((1st ‘𝑧) = (1st ‘𝑤) ∧ (2nd ‘𝑧) = (2nd ‘𝑤)))
4642, 45bitrdi 290 . . . . . 6 ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → (𝑧 = 𝑤 ↔ ((1st ‘𝑧) = (1st ‘𝑤) ∧ (2nd ‘𝑧) = (2nd ‘𝑤))))
4732, 40, 463bitr4d 314 . . . . 5 ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ 𝑧 = 𝑤))
4847biimpd 232 . . . 4 ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → ((𝐹‘𝑧) = (𝐹‘𝑤) → 𝑧 = 𝑤))
4948rgen2 3206 . . 3 ∀𝑧 ∈ (ℝ × ℝ)∀𝑤 ∈ (ℝ × ℝ)((𝐹‘𝑧) = (𝐹‘𝑤) → 𝑧 = 𝑤)
50 dff13 7289 . . 3 (𝐹:(ℝ × ℝ)⟶1-1ℂ ↔ (𝐹:(ℝ × ℝ)⟶ℂ ∧ ∀𝑧 ∈ (ℝ × ℝ)∀𝑤 ∈ (ℝ × ℝ)((𝐹‘𝑧) = (𝐹‘𝑤) → 𝑧 = 𝑤)))
5126, 49, 50mpbir2an 724 . 2 𝐹:(ℝ × ℝ)⟶1-1ℂ
52 cnre 11344 . . . . . 6 (𝑤 ∈ ℂ → ∃𝑢 ∈ ℝ ∃𝑣 ∈ ℝ 𝑤 = (𝑢 + (i · 𝑣)))
53 oveq1 7458 . . . . . . . . 9 (𝑥 = 𝑢 → (𝑥 + (i · 𝑦)) = (𝑢 + (i · 𝑦)))
54 oveq2 7459 . . . . . . . . . 10 (𝑦 = 𝑣 → (i · 𝑦) = (i · 𝑣))
5554oveq2d 7467 . . . . . . . . 9 (𝑦 = 𝑣 → (𝑢 + (i · 𝑦)) = (𝑢 + (i · 𝑣)))
56 ovex 7484 . . . . . . . . 9 (𝑢 + (i · 𝑣)) ∈ V
5753, 55, 1, 56ovmpo 7612 . . . . . . . 8 ((𝑢 ∈ ℝ ∧ 𝑣 ∈ ℝ) → (𝑢𝐹𝑣) = (𝑢 + (i · 𝑣)))
5857eqeq2d 2774 . . . . . . 7 ((𝑢 ∈ ℝ ∧ 𝑣 ∈ ℝ) → (𝑤 = (𝑢𝐹𝑣) ↔ 𝑤 = (𝑢 + (i · 𝑣))))
59582rexbiia 3227 . . . . . 6 (∃𝑢 ∈ ℝ ∃𝑣 ∈ ℝ 𝑤 = (𝑢𝐹𝑣) ↔ ∃𝑢 ∈ ℝ ∃𝑣 ∈ ℝ 𝑤 = (𝑢 + (i · 𝑣)))
6052, 59sylibr 237 . . . . 5 (𝑤 ∈ ℂ → ∃𝑢 ∈ ℝ ∃𝑣 ∈ ℝ 𝑤 = (𝑢𝐹𝑣))
61 fveq2 6916 . . . . . . . 8 (𝑧 = ⟨𝑢, 𝑣⟩ → (𝐹‘𝑧) = (𝐹‘⟨𝑢, 𝑣⟩))
62 df-ov 7454 . . . . . . . 8 (𝑢𝐹𝑣) = (𝐹‘⟨𝑢, 𝑣⟩)
6361, 62eqtr4di 2816 . . . . . . 7 (𝑧 = ⟨𝑢, 𝑣⟩ → (𝐹‘𝑧) = (𝑢𝐹𝑣))
6463eqeq2d 2774 . . . . . 6 (𝑧 = ⟨𝑢, 𝑣⟩ → (𝑤 = (𝐹‘𝑧) ↔ 𝑤 = (𝑢𝐹𝑣)))
6564rexxp 5829 . . . . 5 (∃𝑧 ∈ (ℝ × ℝ)𝑤 = (𝐹‘𝑧) ↔ ∃𝑢 ∈ ℝ ∃𝑣 ∈ ℝ 𝑤 = (𝑢𝐹𝑣))
6660, 65sylibr 237 . . . 4 (𝑤 ∈ ℂ → ∃𝑧 ∈ (ℝ × ℝ)𝑤 = (𝐹‘𝑧))
6766rgen 3082 . . 3 ∀𝑤 ∈ ℂ ∃𝑧 ∈ (ℝ × ℝ)𝑤 = (𝐹‘𝑧)
68 dffo3 7134 . . 3 (𝐹:(ℝ × ℝ)⟶ontoℂ ↔ (𝐹:(ℝ × ℝ)⟶ℂ ∧ ∀𝑤 ∈ ℂ ∃𝑧 ∈ (ℝ × ℝ)𝑤 = (𝐹‘𝑧)))
6926, 67, 68mpbir2an 724 . 2 𝐹:(ℝ × ℝ)⟶ontoℂ
70 df-f1o 6573 . 2 (𝐹:(ℝ × ℝ)⟶1-1ontoℂ ↔ (𝐹:(ℝ × ℝ)⟶1-1ℂ ∧ 𝐹:(ℝ × ℝ)⟶ontoℂ))
7151, 69, 70mpbir2an 724 1 𝐹:(ℝ × ℝ)⟶1-1ontoℂ
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  ⟨cop 4840   × cxp 5656   Fn wfn 6561  ⟶wf 6562  ⟶1-1wf1 6563  ⟶ontowfo 6564  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  1st c1st 8033  2nd c2nd 8034  ℂcc 11237  ℝcr 11238  ici 11241   + caddc 11242   · cmul 11244
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-po 5566  df-so 5567  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-div 12014
This theorem is used by:  cnexALT  13154  cnrecnv  15375  cpnnen  16441  cnheiborlem  25330  mbfimaopnlem  26031
  Copyright terms: Public domain W3C validator