Theorem cnref1o 12944

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 11074), 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-1-onto→ℂ

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝐹(𝑥,𝑦)

Proof of Theorem cnref1o

Dummy variables 𝑢 𝑣 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cnref1o.1	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ (𝑥 + (i · 𝑦)))
2		ovex 7420	. . . . 5 ⊢ (𝑥 + (i · 𝑦)) ∈ V
3	1, 2	fnmpoi 8049	. . . 4 ⊢ 𝐹 Fn (ℝ × ℝ)
4		1st2nd2 8007	. . . . . . . . 9 ⊢ (𝑧 ∈ (ℝ × ℝ) → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
5	4	fveq2d 6862	. . . . . . . 8 ⊢ (𝑧 ∈ (ℝ × ℝ) → (𝐹‘𝑧) = (𝐹‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩))
6		df-ov 7390	. . . . . . . 8 ⊢ ((1st ‘𝑧)𝐹(2nd ‘𝑧)) = (𝐹‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
7	5, 6	eqtr4di 2782	. . . . . . 7 ⊢ (𝑧 ∈ (ℝ × ℝ) → (𝐹‘𝑧) = ((1st ‘𝑧)𝐹(2nd ‘𝑧)))
8		xp1st 8000	. . . . . . . 8 ⊢ (𝑧 ∈ (ℝ × ℝ) → (1st ‘𝑧) ∈ ℝ)
9		xp2nd 8001	. . . . . . . 8 ⊢ (𝑧 ∈ (ℝ × ℝ) → (2nd ‘𝑧) ∈ ℝ)
10		oveq1 7394	. . . . . . . . 9 ⊢ (𝑥 = (1st ‘𝑧) → (𝑥 + (i · 𝑦)) = ((1st ‘𝑧) + (i · 𝑦)))
11		oveq2 7395	. . . . . . . . . 10 ⊢ (𝑦 = (2nd ‘𝑧) → (i · 𝑦) = (i · (2nd ‘𝑧)))
12	11	oveq2d 7403	. . . . . . . . 9 ⊢ (𝑦 = (2nd ‘𝑧) → ((1st ‘𝑧) + (i · 𝑦)) = ((1st ‘𝑧) + (i · (2nd ‘𝑧))))
13		ovex 7420	. . . . . . . . 9 ⊢ ((1st ‘𝑧) + (i · (2nd ‘𝑧))) ∈ V
14	10, 12, 1, 13	ovmpo 7549	. . . . . . . 8 ⊢ (((1st ‘𝑧) ∈ ℝ ∧ (2nd ‘𝑧) ∈ ℝ) → ((1st ‘𝑧)𝐹(2nd ‘𝑧)) = ((1st ‘𝑧) + (i · (2nd ‘𝑧))))
15	8, 9, 14	syl2anc 584	. . . . . . 7 ⊢ (𝑧 ∈ (ℝ × ℝ) → ((1st ‘𝑧)𝐹(2nd ‘𝑧)) = ((1st ‘𝑧) + (i · (2nd ‘𝑧))))
16	7, 15	eqtrd 2764	. . . . . 6 ⊢ (𝑧 ∈ (ℝ × ℝ) → (𝐹‘𝑧) = ((1st ‘𝑧) + (i · (2nd ‘𝑧))))
17	8	recnd 11202	. . . . . . 7 ⊢ (𝑧 ∈ (ℝ × ℝ) → (1st ‘𝑧) ∈ ℂ)
18		ax-icn 11127	. . . . . . . 8 ⊢ i ∈ ℂ
19	9	recnd 11202	. . . . . . . 8 ⊢ (𝑧 ∈ (ℝ × ℝ) → (2nd ‘𝑧) ∈ ℂ)
20		mulcl 11152	. . . . . . . 8 ⊢ ((i ∈ ℂ ∧ (2nd ‘𝑧) ∈ ℂ) → (i · (2nd ‘𝑧)) ∈ ℂ)
21	18, 19, 20	sylancr 587	. . . . . . 7 ⊢ (𝑧 ∈ (ℝ × ℝ) → (i · (2nd ‘𝑧)) ∈ ℂ)
22	17, 21	addcld 11193	. . . . . 6 ⊢ (𝑧 ∈ (ℝ × ℝ) → ((1st ‘𝑧) + (i · (2nd ‘𝑧))) ∈ ℂ)
23	16, 22	eqeltrd 2828	. . . . 5 ⊢ (𝑧 ∈ (ℝ × ℝ) → (𝐹‘𝑧) ∈ ℂ)
24	23	rgen 3046	. . . 4 ⊢ ∀𝑧 ∈ (ℝ × ℝ)(𝐹‘𝑧) ∈ ℂ
25		ffnfv 7091	. . . 4 ⊢ (𝐹:(ℝ × ℝ)⟶ℂ ↔ (𝐹 Fn (ℝ × ℝ) ∧ ∀𝑧 ∈ (ℝ × ℝ)(𝐹‘𝑧) ∈ ℂ))
26	3, 24, 25	mpbir2an 711	. . 3 ⊢ 𝐹:(ℝ × ℝ)⟶ℂ
27	8, 9	jca 511	. . . . . . 7 ⊢ (𝑧 ∈ (ℝ × ℝ) → ((1st ‘𝑧) ∈ ℝ ∧ (2nd ‘𝑧) ∈ ℝ))
28		xp1st 8000	. . . . . . . 8 ⊢ (𝑤 ∈ (ℝ × ℝ) → (1st ‘𝑤) ∈ ℝ)
29		xp2nd 8001	. . . . . . . 8 ⊢ (𝑤 ∈ (ℝ × ℝ) → (2nd ‘𝑤) ∈ ℝ)
30	28, 29	jca 511	. . . . . . 7 ⊢ (𝑤 ∈ (ℝ × ℝ) → ((1st ‘𝑤) ∈ ℝ ∧ (2nd ‘𝑤) ∈ ℝ))
31		cru 12178	. . . . . . 7 ⊢ ((((1st ‘𝑧) ∈ ℝ ∧ (2nd ‘𝑧) ∈ ℝ) ∧ ((1st ‘𝑤) ∈ ℝ ∧ (2nd ‘𝑤) ∈ ℝ)) → (((1st ‘𝑧) + (i · (2nd ‘𝑧))) = ((1st ‘𝑤) + (i · (2nd ‘𝑤))) ↔ ((1st ‘𝑧) = (1st ‘𝑤) ∧ (2nd ‘𝑧) = (2nd ‘𝑤))))
32	27, 30, 31	syl2an 596	. . . . . 6 ⊢ ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → (((1st ‘𝑧) + (i · (2nd ‘𝑧))) = ((1st ‘𝑤) + (i · (2nd ‘𝑤))) ↔ ((1st ‘𝑧) = (1st ‘𝑤) ∧ (2nd ‘𝑧) = (2nd ‘𝑤))))
33		fveq2 6858	. . . . . . . . 9 ⊢ (𝑧 = 𝑤 → (𝐹‘𝑧) = (𝐹‘𝑤))
34		fveq2 6858	. . . . . . . . . 10 ⊢ (𝑧 = 𝑤 → (1st ‘𝑧) = (1st ‘𝑤))
35		fveq2 6858	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑤 → (2nd ‘𝑧) = (2nd ‘𝑤))
36	35	oveq2d 7403	. . . . . . . . . 10 ⊢ (𝑧 = 𝑤 → (i · (2nd ‘𝑧)) = (i · (2nd ‘𝑤)))
37	34, 36	oveq12d 7405	. . . . . . . . 9 ⊢ (𝑧 = 𝑤 → ((1st ‘𝑧) + (i · (2nd ‘𝑧))) = ((1st ‘𝑤) + (i · (2nd ‘𝑤))))
38	33, 37	eqeq12d 2745	. . . . . . . 8 ⊢ (𝑧 = 𝑤 → ((𝐹‘𝑧) = ((1st ‘𝑧) + (i · (2nd ‘𝑧))) ↔ (𝐹‘𝑤) = ((1st ‘𝑤) + (i · (2nd ‘𝑤)))))
39	38, 16	vtoclga 3543	. . . . . . 7 ⊢ (𝑤 ∈ (ℝ × ℝ) → (𝐹‘𝑤) = ((1st ‘𝑤) + (i · (2nd ‘𝑤))))
40	16, 39	eqeqan12d 2743	. . . . . 6 ⊢ ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ ((1st ‘𝑧) + (i · (2nd ‘𝑧))) = ((1st ‘𝑤) + (i · (2nd ‘𝑤)))))
41		1st2nd2 8007	. . . . . . . 8 ⊢ (𝑤 ∈ (ℝ × ℝ) → 𝑤 = ⟨(1st ‘𝑤), (2nd ‘𝑤)⟩)
42	4, 41	eqeqan12d 2743	. . . . . . 7 ⊢ ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → (𝑧 = 𝑤 ↔ ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ = ⟨(1st ‘𝑤), (2nd ‘𝑤)⟩))
43		fvex 6871	. . . . . . . 8 ⊢ (1st ‘𝑧) ∈ V
44		fvex 6871	. . . . . . . 8 ⊢ (2nd ‘𝑧) ∈ V
45	43, 44	opth 5436	. . . . . . 7 ⊢ (⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ = ⟨(1st ‘𝑤), (2nd ‘𝑤)⟩ ↔ ((1st ‘𝑧) = (1st ‘𝑤) ∧ (2nd ‘𝑧) = (2nd ‘𝑤)))
46	42, 45	bitrdi 287	. . . . . 6 ⊢ ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → (𝑧 = 𝑤 ↔ ((1st ‘𝑧) = (1st ‘𝑤) ∧ (2nd ‘𝑧) = (2nd ‘𝑤))))
47	32, 40, 46	3bitr4d 311	. . . . 5 ⊢ ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ 𝑧 = 𝑤))
48	47	biimpd 229	. . . 4 ⊢ ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → ((𝐹‘𝑧) = (𝐹‘𝑤) → 𝑧 = 𝑤))
49	48	rgen2 3177	. . 3 ⊢ ∀𝑧 ∈ (ℝ × ℝ)∀𝑤 ∈ (ℝ × ℝ)((𝐹‘𝑧) = (𝐹‘𝑤) → 𝑧 = 𝑤)
50		dff13 7229	. . 3 ⊢ (𝐹:(ℝ × ℝ)–1-1→ℂ ↔ (𝐹:(ℝ × ℝ)⟶ℂ ∧ ∀𝑧 ∈ (ℝ × ℝ)∀𝑤 ∈ (ℝ × ℝ)((𝐹‘𝑧) = (𝐹‘𝑤) → 𝑧 = 𝑤)))
51	26, 49, 50	mpbir2an 711	. 2 ⊢ 𝐹:(ℝ × ℝ)–1-1→ℂ
52		cnre 11171	. . . . . 6 ⊢ (𝑤 ∈ ℂ → ∃𝑢 ∈ ℝ ∃𝑣 ∈ ℝ 𝑤 = (𝑢 + (i · 𝑣)))
53		oveq1 7394	. . . . . . . . 9 ⊢ (𝑥 = 𝑢 → (𝑥 + (i · 𝑦)) = (𝑢 + (i · 𝑦)))
54		oveq2 7395	. . . . . . . . . 10 ⊢ (𝑦 = 𝑣 → (i · 𝑦) = (i · 𝑣))
55	54	oveq2d 7403	. . . . . . . . 9 ⊢ (𝑦 = 𝑣 → (𝑢 + (i · 𝑦)) = (𝑢 + (i · 𝑣)))
56		ovex 7420	. . . . . . . . 9 ⊢ (𝑢 + (i · 𝑣)) ∈ V
57	53, 55, 1, 56	ovmpo 7549	. . . . . . . 8 ⊢ ((𝑢 ∈ ℝ ∧ 𝑣 ∈ ℝ) → (𝑢𝐹𝑣) = (𝑢 + (i · 𝑣)))
58	57	eqeq2d 2740	. . . . . . 7 ⊢ ((𝑢 ∈ ℝ ∧ 𝑣 ∈ ℝ) → (𝑤 = (𝑢𝐹𝑣) ↔ 𝑤 = (𝑢 + (i · 𝑣))))
59	58	2rexbiia 3198	. . . . . 6 ⊢ (∃𝑢 ∈ ℝ ∃𝑣 ∈ ℝ 𝑤 = (𝑢𝐹𝑣) ↔ ∃𝑢 ∈ ℝ ∃𝑣 ∈ ℝ 𝑤 = (𝑢 + (i · 𝑣)))
60	52, 59	sylibr 234	. . . . 5 ⊢ (𝑤 ∈ ℂ → ∃𝑢 ∈ ℝ ∃𝑣 ∈ ℝ 𝑤 = (𝑢𝐹𝑣))
61		fveq2 6858	. . . . . . . 8 ⊢ (𝑧 = ⟨𝑢, 𝑣⟩ → (𝐹‘𝑧) = (𝐹‘⟨𝑢, 𝑣⟩))
62		df-ov 7390	. . . . . . . 8 ⊢ (𝑢𝐹𝑣) = (𝐹‘⟨𝑢, 𝑣⟩)
63	61, 62	eqtr4di 2782	. . . . . . 7 ⊢ (𝑧 = ⟨𝑢, 𝑣⟩ → (𝐹‘𝑧) = (𝑢𝐹𝑣))
64	63	eqeq2d 2740	. . . . . 6 ⊢ (𝑧 = ⟨𝑢, 𝑣⟩ → (𝑤 = (𝐹‘𝑧) ↔ 𝑤 = (𝑢𝐹𝑣)))
65	64	rexxp 5806	. . . . 5 ⊢ (∃𝑧 ∈ (ℝ × ℝ)𝑤 = (𝐹‘𝑧) ↔ ∃𝑢 ∈ ℝ ∃𝑣 ∈ ℝ 𝑤 = (𝑢𝐹𝑣))
66	60, 65	sylibr 234	. . . 4 ⊢ (𝑤 ∈ ℂ → ∃𝑧 ∈ (ℝ × ℝ)𝑤 = (𝐹‘𝑧))
67	66	rgen 3046	. . 3 ⊢ ∀𝑤 ∈ ℂ ∃𝑧 ∈ (ℝ × ℝ)𝑤 = (𝐹‘𝑧)
68		dffo3 7074	. . 3 ⊢ (𝐹:(ℝ × ℝ)–onto→ℂ ↔ (𝐹:(ℝ × ℝ)⟶ℂ ∧ ∀𝑤 ∈ ℂ ∃𝑧 ∈ (ℝ × ℝ)𝑤 = (𝐹‘𝑧)))
69	26, 67, 68	mpbir2an 711	. 2 ⊢ 𝐹:(ℝ × ℝ)–onto→ℂ
70		df-f1o 6518	. 2 ⊢ (𝐹:(ℝ × ℝ)–1-1-onto→ℂ ↔ (𝐹:(ℝ × ℝ)–1-1→ℂ ∧ 𝐹:(ℝ × ℝ)–onto→ℂ))
71	51, 69, 70	mpbir2an 711	1 ⊢ 𝐹:(ℝ × ℝ)–1-1-onto→ℂ

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ∃wrex 3053  ⟨cop 4595   × cxp 5636   Fn wfn 6506  ⟶wf 6507  –1-1→wf1 6508  –onto→wfo 6509  –1-1-onto→wf1o 6510  ‘cfv 6511  (class class class)co 7387   ∈ cmpo 7389  1^st c1st 7966  2^nd c2nd 7967  ℂcc 11066  ℝcr 11067  ici 11070   + caddc 11071   · cmul 11073

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-resscn 11125  ax-1cn 11126  ax-icn 11127  ax-addcl 11128  ax-addrcl 11129  ax-mulcl 11130  ax-mulrcl 11131  ax-mulcom 11132  ax-addass 11133  ax-mulass 11134  ax-distr 11135  ax-i2m1 11136  ax-1ne0 11137  ax-1rid 11138  ax-rnegex 11139  ax-rrecex 11140  ax-cnre 11141  ax-pre-lttri 11142  ax-pre-lttrn 11143  ax-pre-ltadd 11144  ax-pre-mulgt0 11145

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-po 5546  df-so 5547  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-1st 7968  df-2nd 7969  df-er 8671  df-en 8919  df-dom 8920  df-sdom 8921  df-pnf 11210  df-mnf 11211  df-xr 11212  df-ltxr 11213  df-le 11214  df-sub 11407  df-neg 11408  df-div 11836

This theorem is referenced by:  cnexALT  12945  cnrecnv  15131  cpnnen  16197  cnheiborlem  24853  mbfimaopnlem  25556