cnsubrg - Metamath Proof Explorer

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

Theorem cnsubrg 20997

Description: There are no subrings of the complex numbers strictly between ℝ and ℂ. (Contributed by Mario Carneiro, 15-Oct-2015.)

**Assertion**
Ref	Expression
cnsubrg	⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) → 𝑅 ∈ {ℝ, ℂ})

Proof of Theorem cnsubrg Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssdif0 4362	. . . 4 ⊢ (𝑅 ⊆ ℝ ↔ (𝑅 ∖ ℝ) = ∅)
2		simpr 485	. . . . . 6 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑅 ⊆ ℝ) → 𝑅 ⊆ ℝ)
3		simplr 767	. . . . . 6 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑅 ⊆ ℝ) → ℝ ⊆ 𝑅)
4	2, 3	eqssd 3998	. . . . 5 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑅 ⊆ ℝ) → 𝑅 = ℝ)
5	4	orcd 871	. . . 4 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑅 ⊆ ℝ) → (𝑅 = ℝ ∨ 𝑅 = ℂ))
6	1, 5	sylan2br 595	. . 3 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑅 ∖ ℝ) = ∅) → (𝑅 = ℝ ∨ 𝑅 = ℂ))
7		n0 4345	. . . 4 ⊢ ((𝑅 ∖ ℝ) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝑅 ∖ ℝ))
8		simpll 765	. . . . . . . . . 10 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → 𝑅 ∈ (SubRing‘ℂ_fld))
9		cnfldbas 20940	. . . . . . . . . . 11 ⊢ ℂ = (Base‘ℂ_fld)
10	9	subrgss 20356	. . . . . . . . . 10 ⊢ (𝑅 ∈ (SubRing‘ℂ_fld) → 𝑅 ⊆ ℂ)
11	8, 10	syl 17	. . . . . . . . 9 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → 𝑅 ⊆ ℂ)
12		replim 15059	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℂ → 𝑦 = ((ℜ‘𝑦) + (i · (ℑ‘𝑦))))
13	12	ad2antll 727	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → 𝑦 = ((ℜ‘𝑦) + (i · (ℑ‘𝑦))))
14		simpll 765	. . . . . . . . . . . . 13 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → 𝑅 ∈ (SubRing‘ℂ_fld))
15		simplr 767	. . . . . . . . . . . . . 14 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → ℝ ⊆ 𝑅)
16		recl 15053	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ ℂ → (ℜ‘𝑦) ∈ ℝ)
17	16	ad2antll 727	. . . . . . . . . . . . . 14 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → (ℜ‘𝑦) ∈ ℝ)
18	15, 17	sseldd 3982	. . . . . . . . . . . . 13 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → (ℜ‘𝑦) ∈ 𝑅)
19		ax-icn 11165	. . . . . . . . . . . . . . . . . . 19 ⊢ i ∈ ℂ
20	19	a1i 11	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → i ∈ ℂ)
21		eldifi 4125	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑥 ∈ (𝑅 ∖ ℝ) → 𝑥 ∈ 𝑅)
22	21	adantl 482	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → 𝑥 ∈ 𝑅)
23	11, 22	sseldd 3982	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → 𝑥 ∈ ℂ)
24		imcl 15054	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ ℂ → (ℑ‘𝑥) ∈ ℝ)
25	23, 24	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (ℑ‘𝑥) ∈ ℝ)
26	25	recnd 11238	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (ℑ‘𝑥) ∈ ℂ)
27		eldifn 4126	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ (𝑅 ∖ ℝ) → ¬ 𝑥 ∈ ℝ)
28	27	adantl 482	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → ¬ 𝑥 ∈ ℝ)
29		reim0b 15062	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ ℂ → (𝑥 ∈ ℝ ↔ (ℑ‘𝑥) = 0))
30	29	necon3bbid 2978	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ ℂ → (¬ 𝑥 ∈ ℝ ↔ (ℑ‘𝑥) ≠ 0))
31	23, 30	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (¬ 𝑥 ∈ ℝ ↔ (ℑ‘𝑥) ≠ 0))
32	28, 31	mpbid 231	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (ℑ‘𝑥) ≠ 0)
33	20, 26, 32	divcan4d 11992	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → ((i · (ℑ‘𝑥)) / (ℑ‘𝑥)) = i)
34		mulcl 11190	. . . . . . . . . . . . . . . . . . 19 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝑥) ∈ ℂ) → (i · (ℑ‘𝑥)) ∈ ℂ)
35	19, 26, 34	sylancr 587	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (i · (ℑ‘𝑥)) ∈ ℂ)
36	35, 26, 32	divrecd 11989	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → ((i · (ℑ‘𝑥)) / (ℑ‘𝑥)) = ((i · (ℑ‘𝑥)) · (1 / (ℑ‘𝑥))))
37	33, 36	eqtr3d 2774	. . . . . . . . . . . . . . . 16 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → i = ((i · (ℑ‘𝑥)) · (1 / (ℑ‘𝑥))))
38	23	recld 15137	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (ℜ‘𝑥) ∈ ℝ)
39	38	recnd 11238	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (ℜ‘𝑥) ∈ ℂ)
40	23, 39	negsubd 11573	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (𝑥 + -(ℜ‘𝑥)) = (𝑥 − (ℜ‘𝑥)))
41		replim 15059	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ ℂ → 𝑥 = ((ℜ‘𝑥) + (i · (ℑ‘𝑥))))
42	23, 41	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → 𝑥 = ((ℜ‘𝑥) + (i · (ℑ‘𝑥))))
43	42	oveq1d 7420	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (𝑥 − (ℜ‘𝑥)) = (((ℜ‘𝑥) + (i · (ℑ‘𝑥))) − (ℜ‘𝑥)))
44	39, 35	pncan2d 11569	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (((ℜ‘𝑥) + (i · (ℑ‘𝑥))) − (ℜ‘𝑥)) = (i · (ℑ‘𝑥)))
45	40, 43, 44	3eqtrd 2776	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (𝑥 + -(ℜ‘𝑥)) = (i · (ℑ‘𝑥)))
46		simplr 767	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → ℝ ⊆ 𝑅)
47	38	renegcld 11637	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → -(ℜ‘𝑥) ∈ ℝ)
48	46, 47	sseldd 3982	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → -(ℜ‘𝑥) ∈ 𝑅)
49		cnfldadd 20941	. . . . . . . . . . . . . . . . . . . 20 ⊢ + = (+_g‘ℂ_fld)
50	49	subrgacl 20366	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ 𝑥 ∈ 𝑅 ∧ -(ℜ‘𝑥) ∈ 𝑅) → (𝑥 + -(ℜ‘𝑥)) ∈ 𝑅)
51	8, 22, 48, 50	syl3anc 1371	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (𝑥 + -(ℜ‘𝑥)) ∈ 𝑅)
52	45, 51	eqeltrrd 2834	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (i · (ℑ‘𝑥)) ∈ 𝑅)
53	25, 32	rereccld 12037	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (1 / (ℑ‘𝑥)) ∈ ℝ)
54	46, 53	sseldd 3982	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (1 / (ℑ‘𝑥)) ∈ 𝑅)
55		cnfldmul 20942	. . . . . . . . . . . . . . . . . 18 ⊢ · = (._r‘ℂ_fld)
56	55	subrgmcl 20367	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ (i · (ℑ‘𝑥)) ∈ 𝑅 ∧ (1 / (ℑ‘𝑥)) ∈ 𝑅) → ((i · (ℑ‘𝑥)) · (1 / (ℑ‘𝑥))) ∈ 𝑅)
57	8, 52, 54, 56	syl3anc 1371	. . . . . . . . . . . . . . . 16 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → ((i · (ℑ‘𝑥)) · (1 / (ℑ‘𝑥))) ∈ 𝑅)
58	37, 57	eqeltrd 2833	. . . . . . . . . . . . . . 15 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → i ∈ 𝑅)
59	58	adantrr 715	. . . . . . . . . . . . . 14 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → i ∈ 𝑅)
60		imcl 15054	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ ℂ → (ℑ‘𝑦) ∈ ℝ)
61	60	ad2antll 727	. . . . . . . . . . . . . . 15 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → (ℑ‘𝑦) ∈ ℝ)
62	15, 61	sseldd 3982	. . . . . . . . . . . . . 14 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → (ℑ‘𝑦) ∈ 𝑅)
63	55	subrgmcl 20367	. . . . . . . . . . . . . 14 ⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ i ∈ 𝑅 ∧ (ℑ‘𝑦) ∈ 𝑅) → (i · (ℑ‘𝑦)) ∈ 𝑅)
64	14, 59, 62, 63	syl3anc 1371	. . . . . . . . . . . . 13 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → (i · (ℑ‘𝑦)) ∈ 𝑅)
65	49	subrgacl 20366	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ (ℜ‘𝑦) ∈ 𝑅 ∧ (i · (ℑ‘𝑦)) ∈ 𝑅) → ((ℜ‘𝑦) + (i · (ℑ‘𝑦))) ∈ 𝑅)
66	14, 18, 64, 65	syl3anc 1371	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → ((ℜ‘𝑦) + (i · (ℑ‘𝑦))) ∈ 𝑅)
67	13, 66	eqeltrd 2833	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → 𝑦 ∈ 𝑅)
68	67	expr 457	. . . . . . . . . 10 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (𝑦 ∈ ℂ → 𝑦 ∈ 𝑅))
69	68	ssrdv 3987	. . . . . . . . 9 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → ℂ ⊆ 𝑅)
70	11, 69	eqssd 3998	. . . . . . . 8 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → 𝑅 = ℂ)
71	70	olcd 872	. . . . . . 7 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (𝑅 = ℝ ∨ 𝑅 = ℂ))
72	71	ex 413	. . . . . 6 ⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) → (𝑥 ∈ (𝑅 ∖ ℝ) → (𝑅 = ℝ ∨ 𝑅 = ℂ)))
73	72	exlimdv 1936	. . . . 5 ⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) → (∃𝑥 𝑥 ∈ (𝑅 ∖ ℝ) → (𝑅 = ℝ ∨ 𝑅 = ℂ)))
74	73	imp 407	. . . 4 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ ∃𝑥 𝑥 ∈ (𝑅 ∖ ℝ)) → (𝑅 = ℝ ∨ 𝑅 = ℂ))
75	7, 74	sylan2b 594	. . 3 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑅 ∖ ℝ) ≠ ∅) → (𝑅 = ℝ ∨ 𝑅 = ℂ))
76	6, 75	pm2.61dane 3029	. 2 ⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) → (𝑅 = ℝ ∨ 𝑅 = ℂ))
77		elprg 4648	. . 3 ⊢ (𝑅 ∈ (SubRing‘ℂ_fld) → (𝑅 ∈ {ℝ, ℂ} ↔ (𝑅 = ℝ ∨ 𝑅 = ℂ)))
78	77	adantr 481	. 2 ⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) → (𝑅 ∈ {ℝ, ℂ} ↔ (𝑅 = ℝ ∨ 𝑅 = ℂ)))
79	76, 78	mpbird 256	1 ⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) → 𝑅 ∈ {ℝ, ℂ})

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∨ wo 845 = wceq 1541 ∃wex 1781 ∈ wcel 2106 ≠ wne 2940 ∖ cdif 3944 ⊆ wss 3947 ∅c0 4321 {cpr 4629 ‘cfv 6540 (class class class)co 7405 ℂcc 11104 ℝcr 11105 0cc0 11106 1c1 11107 ici 11108 + caddc 11109 · cmul 11111 − cmin 11440 -cneg 11441 / cdiv 11867 ℜcre 15040 ℑcim 15041 SubRingcsubrg 20351 ℂ_fldccnfld 20936

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-addf 11185 ax-mulf 11186

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-tp 4632 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-div 11868 df-nn 12209 df-2 12271 df-3 12272 df-4 12273 df-5 12274 df-6 12275 df-7 12276 df-8 12277 df-9 12278 df-n0 12469 df-z 12555 df-dec 12674 df-uz 12819 df-fz 13481 df-cj 15042 df-re 15043 df-im 15044 df-struct 17076 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-ress 17170 df-plusg 17206 df-mulr 17207 df-starv 17208 df-tset 17212 df-ple 17213 df-ds 17215 df-unif 17216 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-grp 18818 df-subg 18997 df-mgp 19982 df-ring 20051 df-subrg 20353 df-cnfld 20937

This theorem is referenced by: cncdrg 24867

W3C validator