Theorem cnref1o 9652

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 7819), 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		simpl 109	. . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑥 ∈ ℝ)
2	1	recnd 7988	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑥 ∈ ℂ)
3		ax-icn 7908	. . . . . . . . 9 ⊢ i ∈ ℂ
4	3	a1i 9	. . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → i ∈ ℂ)
5		simpr 110	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℝ)
6	5	recnd 7988	. . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℂ)
7	4, 6	mulcld 7980	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (i · 𝑦) ∈ ℂ)
8	2, 7	addcld 7979	. . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥 + (i · 𝑦)) ∈ ℂ)
9	8	rgen2a 2531	. . . . 5 ⊢ ∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 + (i · 𝑦)) ∈ ℂ
10		cnref1o.1	. . . . . 6 ⊢ 𝐹 = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ (𝑥 + (i · 𝑦)))
11	10	fnmpo 6205	. . . . 5 ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 + (i · 𝑦)) ∈ ℂ → 𝐹 Fn (ℝ × ℝ))
12	9, 11	ax-mp 5	. . . 4 ⊢ 𝐹 Fn (ℝ × ℝ)
13		1st2nd2 6178	. . . . . . . . 9 ⊢ (𝑧 ∈ (ℝ × ℝ) → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
14	13	fveq2d 5521	. . . . . . . 8 ⊢ (𝑧 ∈ (ℝ × ℝ) → (𝐹‘𝑧) = (𝐹‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩))
15		df-ov 5880	. . . . . . . 8 ⊢ ((1st ‘𝑧)𝐹(2nd ‘𝑧)) = (𝐹‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
16	14, 15	eqtr4di 2228	. . . . . . 7 ⊢ (𝑧 ∈ (ℝ × ℝ) → (𝐹‘𝑧) = ((1st ‘𝑧)𝐹(2nd ‘𝑧)))
17		xp1st 6168	. . . . . . . 8 ⊢ (𝑧 ∈ (ℝ × ℝ) → (1st ‘𝑧) ∈ ℝ)
18		xp2nd 6169	. . . . . . . 8 ⊢ (𝑧 ∈ (ℝ × ℝ) → (2nd ‘𝑧) ∈ ℝ)
19	17	recnd 7988	. . . . . . . . 9 ⊢ (𝑧 ∈ (ℝ × ℝ) → (1st ‘𝑧) ∈ ℂ)
20	3	a1i 9	. . . . . . . . . 10 ⊢ (𝑧 ∈ (ℝ × ℝ) → i ∈ ℂ)
21	18	recnd 7988	. . . . . . . . . 10 ⊢ (𝑧 ∈ (ℝ × ℝ) → (2nd ‘𝑧) ∈ ℂ)
22	20, 21	mulcld 7980	. . . . . . . . 9 ⊢ (𝑧 ∈ (ℝ × ℝ) → (i · (2nd ‘𝑧)) ∈ ℂ)
23	19, 22	addcld 7979	. . . . . . . 8 ⊢ (𝑧 ∈ (ℝ × ℝ) → ((1st ‘𝑧) + (i · (2nd ‘𝑧))) ∈ ℂ)
24		oveq1 5884	. . . . . . . . 9 ⊢ (𝑥 = (1st ‘𝑧) → (𝑥 + (i · 𝑦)) = ((1st ‘𝑧) + (i · 𝑦)))
25		oveq2 5885	. . . . . . . . . 10 ⊢ (𝑦 = (2nd ‘𝑧) → (i · 𝑦) = (i · (2nd ‘𝑧)))
26	25	oveq2d 5893	. . . . . . . . 9 ⊢ (𝑦 = (2nd ‘𝑧) → ((1st ‘𝑧) + (i · 𝑦)) = ((1st ‘𝑧) + (i · (2nd ‘𝑧))))
27	24, 26, 10	ovmpog 6011	. . . . . . . 8 ⊢ (((1st ‘𝑧) ∈ ℝ ∧ (2nd ‘𝑧) ∈ ℝ ∧ ((1st ‘𝑧) + (i · (2nd ‘𝑧))) ∈ ℂ) → ((1st ‘𝑧)𝐹(2nd ‘𝑧)) = ((1st ‘𝑧) + (i · (2nd ‘𝑧))))
28	17, 18, 23, 27	syl3anc 1238	. . . . . . 7 ⊢ (𝑧 ∈ (ℝ × ℝ) → ((1st ‘𝑧)𝐹(2nd ‘𝑧)) = ((1st ‘𝑧) + (i · (2nd ‘𝑧))))
29	16, 28	eqtrd 2210	. . . . . 6 ⊢ (𝑧 ∈ (ℝ × ℝ) → (𝐹‘𝑧) = ((1st ‘𝑧) + (i · (2nd ‘𝑧))))
30	29, 23	eqeltrd 2254	. . . . 5 ⊢ (𝑧 ∈ (ℝ × ℝ) → (𝐹‘𝑧) ∈ ℂ)
31	30	rgen 2530	. . . 4 ⊢ ∀𝑧 ∈ (ℝ × ℝ)(𝐹‘𝑧) ∈ ℂ
32		ffnfv 5676	. . . 4 ⊢ (𝐹:(ℝ × ℝ)⟶ℂ ↔ (𝐹 Fn (ℝ × ℝ) ∧ ∀𝑧 ∈ (ℝ × ℝ)(𝐹‘𝑧) ∈ ℂ))
33	12, 31, 32	mpbir2an 942	. . 3 ⊢ 𝐹:(ℝ × ℝ)⟶ℂ
34	17, 18	jca 306	. . . . . . 7 ⊢ (𝑧 ∈ (ℝ × ℝ) → ((1st ‘𝑧) ∈ ℝ ∧ (2nd ‘𝑧) ∈ ℝ))
35		xp1st 6168	. . . . . . . 8 ⊢ (𝑤 ∈ (ℝ × ℝ) → (1st ‘𝑤) ∈ ℝ)
36		xp2nd 6169	. . . . . . . 8 ⊢ (𝑤 ∈ (ℝ × ℝ) → (2nd ‘𝑤) ∈ ℝ)
37	35, 36	jca 306	. . . . . . 7 ⊢ (𝑤 ∈ (ℝ × ℝ) → ((1st ‘𝑤) ∈ ℝ ∧ (2nd ‘𝑤) ∈ ℝ))
38		cru 8561	. . . . . . 7 ⊢ ((((1st ‘𝑧) ∈ ℝ ∧ (2nd ‘𝑧) ∈ ℝ) ∧ ((1st ‘𝑤) ∈ ℝ ∧ (2nd ‘𝑤) ∈ ℝ)) → (((1st ‘𝑧) + (i · (2nd ‘𝑧))) = ((1st ‘𝑤) + (i · (2nd ‘𝑤))) ↔ ((1st ‘𝑧) = (1st ‘𝑤) ∧ (2nd ‘𝑧) = (2nd ‘𝑤))))
39	34, 37, 38	syl2an 289	. . . . . 6 ⊢ ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → (((1st ‘𝑧) + (i · (2nd ‘𝑧))) = ((1st ‘𝑤) + (i · (2nd ‘𝑤))) ↔ ((1st ‘𝑧) = (1st ‘𝑤) ∧ (2nd ‘𝑧) = (2nd ‘𝑤))))
40		fveq2 5517	. . . . . . . . 9 ⊢ (𝑧 = 𝑤 → (𝐹‘𝑧) = (𝐹‘𝑤))
41		fveq2 5517	. . . . . . . . . 10 ⊢ (𝑧 = 𝑤 → (1st ‘𝑧) = (1st ‘𝑤))
42		fveq2 5517	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑤 → (2nd ‘𝑧) = (2nd ‘𝑤))
43	42	oveq2d 5893	. . . . . . . . . 10 ⊢ (𝑧 = 𝑤 → (i · (2nd ‘𝑧)) = (i · (2nd ‘𝑤)))
44	41, 43	oveq12d 5895	. . . . . . . . 9 ⊢ (𝑧 = 𝑤 → ((1st ‘𝑧) + (i · (2nd ‘𝑧))) = ((1st ‘𝑤) + (i · (2nd ‘𝑤))))
45	40, 44	eqeq12d 2192	. . . . . . . 8 ⊢ (𝑧 = 𝑤 → ((𝐹‘𝑧) = ((1st ‘𝑧) + (i · (2nd ‘𝑧))) ↔ (𝐹‘𝑤) = ((1st ‘𝑤) + (i · (2nd ‘𝑤)))))
46	45, 29	vtoclga 2805	. . . . . . 7 ⊢ (𝑤 ∈ (ℝ × ℝ) → (𝐹‘𝑤) = ((1st ‘𝑤) + (i · (2nd ‘𝑤))))
47	29, 46	eqeqan12d 2193	. . . . . 6 ⊢ ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ ((1st ‘𝑧) + (i · (2nd ‘𝑧))) = ((1st ‘𝑤) + (i · (2nd ‘𝑤)))))
48		1st2nd2 6178	. . . . . . . 8 ⊢ (𝑤 ∈ (ℝ × ℝ) → 𝑤 = ⟨(1st ‘𝑤), (2nd ‘𝑤)⟩)
49	13, 48	eqeqan12d 2193	. . . . . . 7 ⊢ ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → (𝑧 = 𝑤 ↔ ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ = ⟨(1st ‘𝑤), (2nd ‘𝑤)⟩))
50		vex 2742	. . . . . . . . 9 ⊢ 𝑧 ∈ V
51		1stexg 6170	. . . . . . . . 9 ⊢ (𝑧 ∈ V → (1st ‘𝑧) ∈ V)
52	50, 51	ax-mp 5	. . . . . . . 8 ⊢ (1st ‘𝑧) ∈ V
53		2ndexg 6171	. . . . . . . . 9 ⊢ (𝑧 ∈ V → (2nd ‘𝑧) ∈ V)
54	50, 53	ax-mp 5	. . . . . . . 8 ⊢ (2nd ‘𝑧) ∈ V
55	52, 54	opth 4239	. . . . . . 7 ⊢ (⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ = ⟨(1st ‘𝑤), (2nd ‘𝑤)⟩ ↔ ((1st ‘𝑧) = (1st ‘𝑤) ∧ (2nd ‘𝑧) = (2nd ‘𝑤)))
56	49, 55	bitrdi 196	. . . . . 6 ⊢ ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → (𝑧 = 𝑤 ↔ ((1st ‘𝑧) = (1st ‘𝑤) ∧ (2nd ‘𝑧) = (2nd ‘𝑤))))
57	39, 47, 56	3bitr4d 220	. . . . 5 ⊢ ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ 𝑧 = 𝑤))
58	57	biimpd 144	. . . 4 ⊢ ((𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ (ℝ × ℝ)) → ((𝐹‘𝑧) = (𝐹‘𝑤) → 𝑧 = 𝑤))
59	58	rgen2a 2531	. . 3 ⊢ ∀𝑧 ∈ (ℝ × ℝ)∀𝑤 ∈ (ℝ × ℝ)((𝐹‘𝑧) = (𝐹‘𝑤) → 𝑧 = 𝑤)
60		dff13 5771	. . 3 ⊢ (𝐹:(ℝ × ℝ)–1-1→ℂ ↔ (𝐹:(ℝ × ℝ)⟶ℂ ∧ ∀𝑧 ∈ (ℝ × ℝ)∀𝑤 ∈ (ℝ × ℝ)((𝐹‘𝑧) = (𝐹‘𝑤) → 𝑧 = 𝑤)))
61	33, 59, 60	mpbir2an 942	. 2 ⊢ 𝐹:(ℝ × ℝ)–1-1→ℂ
62		cnre 7955	. . . . . 6 ⊢ (𝑤 ∈ ℂ → ∃𝑢 ∈ ℝ ∃𝑣 ∈ ℝ 𝑤 = (𝑢 + (i · 𝑣)))
63		simpl 109	. . . . . . . . 9 ⊢ ((𝑢 ∈ ℝ ∧ 𝑣 ∈ ℝ) → 𝑢 ∈ ℝ)
64		simpr 110	. . . . . . . . 9 ⊢ ((𝑢 ∈ ℝ ∧ 𝑣 ∈ ℝ) → 𝑣 ∈ ℝ)
65	63	recnd 7988	. . . . . . . . . 10 ⊢ ((𝑢 ∈ ℝ ∧ 𝑣 ∈ ℝ) → 𝑢 ∈ ℂ)
66	3	a1i 9	. . . . . . . . . . 11 ⊢ ((𝑢 ∈ ℝ ∧ 𝑣 ∈ ℝ) → i ∈ ℂ)
67	64	recnd 7988	. . . . . . . . . . 11 ⊢ ((𝑢 ∈ ℝ ∧ 𝑣 ∈ ℝ) → 𝑣 ∈ ℂ)
68	66, 67	mulcld 7980	. . . . . . . . . 10 ⊢ ((𝑢 ∈ ℝ ∧ 𝑣 ∈ ℝ) → (i · 𝑣) ∈ ℂ)
69	65, 68	addcld 7979	. . . . . . . . 9 ⊢ ((𝑢 ∈ ℝ ∧ 𝑣 ∈ ℝ) → (𝑢 + (i · 𝑣)) ∈ ℂ)
70		oveq1 5884	. . . . . . . . . 10 ⊢ (𝑥 = 𝑢 → (𝑥 + (i · 𝑦)) = (𝑢 + (i · 𝑦)))
71		oveq2 5885	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑣 → (i · 𝑦) = (i · 𝑣))
72	71	oveq2d 5893	. . . . . . . . . 10 ⊢ (𝑦 = 𝑣 → (𝑢 + (i · 𝑦)) = (𝑢 + (i · 𝑣)))
73	70, 72, 10	ovmpog 6011	. . . . . . . . 9 ⊢ ((𝑢 ∈ ℝ ∧ 𝑣 ∈ ℝ ∧ (𝑢 + (i · 𝑣)) ∈ ℂ) → (𝑢𝐹𝑣) = (𝑢 + (i · 𝑣)))
74	63, 64, 69, 73	syl3anc 1238	. . . . . . . 8 ⊢ ((𝑢 ∈ ℝ ∧ 𝑣 ∈ ℝ) → (𝑢𝐹𝑣) = (𝑢 + (i · 𝑣)))
75	74	eqeq2d 2189	. . . . . . 7 ⊢ ((𝑢 ∈ ℝ ∧ 𝑣 ∈ ℝ) → (𝑤 = (𝑢𝐹𝑣) ↔ 𝑤 = (𝑢 + (i · 𝑣))))
76	75	2rexbiia 2493	. . . . . 6 ⊢ (∃𝑢 ∈ ℝ ∃𝑣 ∈ ℝ 𝑤 = (𝑢𝐹𝑣) ↔ ∃𝑢 ∈ ℝ ∃𝑣 ∈ ℝ 𝑤 = (𝑢 + (i · 𝑣)))
77	62, 76	sylibr 134	. . . . 5 ⊢ (𝑤 ∈ ℂ → ∃𝑢 ∈ ℝ ∃𝑣 ∈ ℝ 𝑤 = (𝑢𝐹𝑣))
78		fveq2 5517	. . . . . . . 8 ⊢ (𝑧 = ⟨𝑢, 𝑣⟩ → (𝐹‘𝑧) = (𝐹‘⟨𝑢, 𝑣⟩))
79		df-ov 5880	. . . . . . . 8 ⊢ (𝑢𝐹𝑣) = (𝐹‘⟨𝑢, 𝑣⟩)
80	78, 79	eqtr4di 2228	. . . . . . 7 ⊢ (𝑧 = ⟨𝑢, 𝑣⟩ → (𝐹‘𝑧) = (𝑢𝐹𝑣))
81	80	eqeq2d 2189	. . . . . 6 ⊢ (𝑧 = ⟨𝑢, 𝑣⟩ → (𝑤 = (𝐹‘𝑧) ↔ 𝑤 = (𝑢𝐹𝑣)))
82	81	rexxp 4773	. . . . 5 ⊢ (∃𝑧 ∈ (ℝ × ℝ)𝑤 = (𝐹‘𝑧) ↔ ∃𝑢 ∈ ℝ ∃𝑣 ∈ ℝ 𝑤 = (𝑢𝐹𝑣))
83	77, 82	sylibr 134	. . . 4 ⊢ (𝑤 ∈ ℂ → ∃𝑧 ∈ (ℝ × ℝ)𝑤 = (𝐹‘𝑧))
84	83	rgen 2530	. . 3 ⊢ ∀𝑤 ∈ ℂ ∃𝑧 ∈ (ℝ × ℝ)𝑤 = (𝐹‘𝑧)
85		dffo3 5665	. . 3 ⊢ (𝐹:(ℝ × ℝ)–onto→ℂ ↔ (𝐹:(ℝ × ℝ)⟶ℂ ∧ ∀𝑤 ∈ ℂ ∃𝑧 ∈ (ℝ × ℝ)𝑤 = (𝐹‘𝑧)))
86	33, 84, 85	mpbir2an 942	. 2 ⊢ 𝐹:(ℝ × ℝ)–onto→ℂ
87		df-f1o 5225	. 2 ⊢ (𝐹:(ℝ × ℝ)–1-1-onto→ℂ ↔ (𝐹:(ℝ × ℝ)–1-1→ℂ ∧ 𝐹:(ℝ × ℝ)–onto→ℂ))
88	61, 86, 87	mpbir2an 942	1 ⊢ 𝐹:(ℝ × ℝ)–1-1-onto→ℂ

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1353   ∈ wcel 2148  ∀wral 2455  ∃wrex 2456  Vcvv 2739  ⟨cop 3597   × cxp 4626   Fn wfn 5213  ⟶wf 5214  –1-1→wf1 5215  –onto→wfo 5216  –1-1-onto→wf1o 5217  ‘cfv 5218  (class class class)co 5877   ∈ cmpo 5879  1^st c1st 6141  2^nd c2nd 6142  ℂcc 7811  ℝcr 7812  ici 7815   + caddc 7816   · cmul 7818

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-mulrcl 7912  ax-addcom 7913  ax-mulcom 7914  ax-addass 7915  ax-mulass 7916  ax-distr 7917  ax-i2m1 7918  ax-0lt1 7919  ax-1rid 7920  ax-0id 7921  ax-rnegex 7922  ax-precex 7923  ax-cnre 7924  ax-pre-ltirr 7925  ax-pre-lttrn 7927  ax-pre-apti 7928  ax-pre-ltadd 7929  ax-pre-mulgt0 7930

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-1st 6143  df-2nd 6144  df-pnf 7996  df-mnf 7997  df-ltxr 7999  df-sub 8132  df-neg 8133  df-reap 8534

This theorem is referenced by:  cnrecnv  10921