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 21367

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 4367	. . . 4 ⊢ (𝑅 ⊆ ℝ ↔ (𝑅 ∖ ℝ) = ∅)
2		simpr 483	. . . . . 6 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑅 ⊆ ℝ) → 𝑅 ⊆ ℝ)
3		simplr 767	. . . . . 6 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑅 ⊆ ℝ) → ℝ ⊆ 𝑅)
4	2, 3	eqssd 3999	. . . . 5 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑅 ⊆ ℝ) → 𝑅 = ℝ)
5	4	orcd 871	. . . 4 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑅 ⊆ ℝ) → (𝑅 = ℝ ∨ 𝑅 = ℂ))
6	1, 5	sylan2br 593	. . 3 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑅 ∖ ℝ) = ∅) → (𝑅 = ℝ ∨ 𝑅 = ℂ))
7		n0 4350	. . . 4 ⊢ ((𝑅 ∖ ℝ) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝑅 ∖ ℝ))
8		simpll 765	. . . . . . . . . 10 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → 𝑅 ∈ (SubRing‘ℂ_fld))
9		cnfldbas 21290	. . . . . . . . . . 11 ⊢ ℂ = (Base‘ℂ_fld)
10	9	subrgss 20518	. . . . . . . . . 10 ⊢ (𝑅 ∈ (SubRing‘ℂ_fld) → 𝑅 ⊆ ℂ)
11	8, 10	syl 17	. . . . . . . . 9 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → 𝑅 ⊆ ℂ)
12		replim 15103	. . . . . . . . . . . . 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 15097	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ ℂ → (ℜ‘𝑦) ∈ ℝ)
17	16	ad2antll 727	. . . . . . . . . . . . . 14 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → (ℜ‘𝑦) ∈ ℝ)
18	15, 17	sseldd 3983	. . . . . . . . . . . . 13 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → (ℜ‘𝑦) ∈ 𝑅)
19		ax-icn 11205	. . . . . . . . . . . . . . . . . . 19 ⊢ i ∈ ℂ
20	19	a1i 11	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → i ∈ ℂ)
21		eldifi 4127	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑥 ∈ (𝑅 ∖ ℝ) → 𝑥 ∈ 𝑅)
22	21	adantl 480	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → 𝑥 ∈ 𝑅)
23	11, 22	sseldd 3983	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → 𝑥 ∈ ℂ)
24		imcl 15098	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ ℂ → (ℑ‘𝑥) ∈ ℝ)
25	23, 24	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (ℑ‘𝑥) ∈ ℝ)
26	25	recnd 11280	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (ℑ‘𝑥) ∈ ℂ)
27		eldifn 4128	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ (𝑅 ∖ ℝ) → ¬ 𝑥 ∈ ℝ)
28	27	adantl 480	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → ¬ 𝑥 ∈ ℝ)
29		reim0b 15106	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ ℂ → (𝑥 ∈ ℝ ↔ (ℑ‘𝑥) = 0))
30	29	necon3bbid 2975	. . . . . . . . . . . . . . . . . . . 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 12034	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → ((i · (ℑ‘𝑥)) / (ℑ‘𝑥)) = i)
34		mulcl 11230	. . . . . . . . . . . . . . . . . . 19 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝑥) ∈ ℂ) → (i · (ℑ‘𝑥)) ∈ ℂ)
35	19, 26, 34	sylancr 585	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (i · (ℑ‘𝑥)) ∈ ℂ)
36	35, 26, 32	divrecd 12031	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → ((i · (ℑ‘𝑥)) / (ℑ‘𝑥)) = ((i · (ℑ‘𝑥)) · (1 / (ℑ‘𝑥))))
37	33, 36	eqtr3d 2770	. . . . . . . . . . . . . . . 16 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → i = ((i · (ℑ‘𝑥)) · (1 / (ℑ‘𝑥))))
38	23	recld 15181	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (ℜ‘𝑥) ∈ ℝ)
39	38	recnd 11280	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (ℜ‘𝑥) ∈ ℂ)
40	23, 39	negsubd 11615	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (𝑥 + -(ℜ‘𝑥)) = (𝑥 − (ℜ‘𝑥)))
41		replim 15103	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ ℂ → 𝑥 = ((ℜ‘𝑥) + (i · (ℑ‘𝑥))))
42	23, 41	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → 𝑥 = ((ℜ‘𝑥) + (i · (ℑ‘𝑥))))
43	42	oveq1d 7441	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (𝑥 − (ℜ‘𝑥)) = (((ℜ‘𝑥) + (i · (ℑ‘𝑥))) − (ℜ‘𝑥)))
44	39, 35	pncan2d 11611	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (((ℜ‘𝑥) + (i · (ℑ‘𝑥))) − (ℜ‘𝑥)) = (i · (ℑ‘𝑥)))
45	40, 43, 44	3eqtrd 2772	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (𝑥 + -(ℜ‘𝑥)) = (i · (ℑ‘𝑥)))
46		simplr 767	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → ℝ ⊆ 𝑅)
47	38	renegcld 11679	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → -(ℜ‘𝑥) ∈ ℝ)
48	46, 47	sseldd 3983	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → -(ℜ‘𝑥) ∈ 𝑅)
49		cnfldadd 21292	. . . . . . . . . . . . . . . . . . . 20 ⊢ + = (+_g‘ℂ_fld)
50	49	subrgacl 20529	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ 𝑥 ∈ 𝑅 ∧ -(ℜ‘𝑥) ∈ 𝑅) → (𝑥 + -(ℜ‘𝑥)) ∈ 𝑅)
51	8, 22, 48, 50	syl3anc 1368	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (𝑥 + -(ℜ‘𝑥)) ∈ 𝑅)
52	45, 51	eqeltrrd 2830	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (i · (ℑ‘𝑥)) ∈ 𝑅)
53	25, 32	rereccld 12079	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (1 / (ℑ‘𝑥)) ∈ ℝ)
54	46, 53	sseldd 3983	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (1 / (ℑ‘𝑥)) ∈ 𝑅)
55		cnfldmul 21294	. . . . . . . . . . . . . . . . . 18 ⊢ · = (._r‘ℂ_fld)
56	55	subrgmcl 20530	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ (i · (ℑ‘𝑥)) ∈ 𝑅 ∧ (1 / (ℑ‘𝑥)) ∈ 𝑅) → ((i · (ℑ‘𝑥)) · (1 / (ℑ‘𝑥))) ∈ 𝑅)
57	8, 52, 54, 56	syl3anc 1368	. . . . . . . . . . . . . . . 16 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → ((i · (ℑ‘𝑥)) · (1 / (ℑ‘𝑥))) ∈ 𝑅)
58	37, 57	eqeltrd 2829	. . . . . . . . . . . . . . 15 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → i ∈ 𝑅)
59	58	adantrr 715	. . . . . . . . . . . . . 14 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → i ∈ 𝑅)
60		imcl 15098	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ ℂ → (ℑ‘𝑦) ∈ ℝ)
61	60	ad2antll 727	. . . . . . . . . . . . . . 15 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → (ℑ‘𝑦) ∈ ℝ)
62	15, 61	sseldd 3983	. . . . . . . . . . . . . 14 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → (ℑ‘𝑦) ∈ 𝑅)
63	55	subrgmcl 20530	. . . . . . . . . . . . . 14 ⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ i ∈ 𝑅 ∧ (ℑ‘𝑦) ∈ 𝑅) → (i · (ℑ‘𝑦)) ∈ 𝑅)
64	14, 59, 62, 63	syl3anc 1368	. . . . . . . . . . . . 13 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → (i · (ℑ‘𝑦)) ∈ 𝑅)
65	49	subrgacl 20529	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ (ℜ‘𝑦) ∈ 𝑅 ∧ (i · (ℑ‘𝑦)) ∈ 𝑅) → ((ℜ‘𝑦) + (i · (ℑ‘𝑦))) ∈ 𝑅)
66	14, 18, 64, 65	syl3anc 1368	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → ((ℜ‘𝑦) + (i · (ℑ‘𝑦))) ∈ 𝑅)
67	13, 66	eqeltrd 2829	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑥 ∈ (𝑅 ∖ ℝ) ∧ 𝑦 ∈ ℂ)) → 𝑦 ∈ 𝑅)
68	67	expr 455	. . . . . . . . . 10 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (𝑦 ∈ ℂ → 𝑦 ∈ 𝑅))
69	68	ssrdv 3988	. . . . . . . . 9 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → ℂ ⊆ 𝑅)
70	11, 69	eqssd 3999	. . . . . . . 8 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → 𝑅 = ℂ)
71	70	olcd 872	. . . . . . 7 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ 𝑥 ∈ (𝑅 ∖ ℝ)) → (𝑅 = ℝ ∨ 𝑅 = ℂ))
72	71	ex 411	. . . . . 6 ⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) → (𝑥 ∈ (𝑅 ∖ ℝ) → (𝑅 = ℝ ∨ 𝑅 = ℂ)))
73	72	exlimdv 1928	. . . . 5 ⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) → (∃𝑥 𝑥 ∈ (𝑅 ∖ ℝ) → (𝑅 = ℝ ∨ 𝑅 = ℂ)))
74	73	imp 405	. . . 4 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ ∃𝑥 𝑥 ∈ (𝑅 ∖ ℝ)) → (𝑅 = ℝ ∨ 𝑅 = ℂ))
75	7, 74	sylan2b 592	. . 3 ⊢ (((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) ∧ (𝑅 ∖ ℝ) ≠ ∅) → (𝑅 = ℝ ∨ 𝑅 = ℂ))
76	6, 75	pm2.61dane 3026	. 2 ⊢ ((𝑅 ∈ (SubRing‘ℂ_fld) ∧ ℝ ⊆ 𝑅) → (𝑅 = ℝ ∨ 𝑅 = ℂ))
77		elprg 4654	. . 3 ⊢ (𝑅 ∈ (SubRing‘ℂ_fld) → (𝑅 ∈ {ℝ, ℂ} ↔ (𝑅 = ℝ ∨ 𝑅 = ℂ)))
78	77	adantr 479	. 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 394 ∨ wo 845 = wceq 1533 ∃wex 1773 ∈ wcel 2098 ≠ wne 2937 ∖ cdif 3946 ⊆ wss 3949 ∅c0 4326 {cpr 4634 ‘cfv 6553 (class class class)co 7426 ℂcc 11144 ℝcr 11145 0cc0 11146 1c1 11147 ici 11148 + caddc 11149 · cmul 11151 − cmin 11482 -cneg 11483 / cdiv 11909 ℜcre 15084 ℑcim 15085 SubRingcsubrg 20513 ℂ_fldccnfld 21286

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-cnex 11202 ax-resscn 11203 ax-1cn 11204 ax-icn 11205 ax-addcl 11206 ax-addrcl 11207 ax-mulcl 11208 ax-mulrcl 11209 ax-mulcom 11210 ax-addass 11211 ax-mulass 11212 ax-distr 11213 ax-i2m1 11214 ax-1ne0 11215 ax-1rid 11216 ax-rnegex 11217 ax-rrecex 11218 ax-cnre 11219 ax-pre-lttri 11220 ax-pre-lttrn 11221 ax-pre-ltadd 11222 ax-pre-mulgt0 11223 ax-addf 11225 ax-mulf 11226

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-tp 4637 df-op 4639 df-uni 4913 df-iun 5002 df-br 5153 df-opab 5215 df-mpt 5236 df-tr 5270 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6310 df-ord 6377 df-on 6378 df-lim 6379 df-suc 6380 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-riota 7382 df-ov 7429 df-oprab 7430 df-mpo 7431 df-om 7877 df-1st 7999 df-2nd 8000 df-frecs 8293 df-wrecs 8324 df-recs 8398 df-rdg 8437 df-1o 8493 df-er 8731 df-en 8971 df-dom 8972 df-sdom 8973 df-fin 8974 df-pnf 11288 df-mnf 11289 df-xr 11290 df-ltxr 11291 df-le 11292 df-sub 11484 df-neg 11485 df-div 11910 df-nn 12251 df-2 12313 df-3 12314 df-4 12315 df-5 12316 df-6 12317 df-7 12318 df-8 12319 df-9 12320 df-n0 12511 df-z 12597 df-dec 12716 df-uz 12861 df-fz 13525 df-cj 15086 df-re 15087 df-im 15088 df-struct 17123 df-sets 17140 df-slot 17158 df-ndx 17170 df-base 17188 df-ress 17217 df-plusg 17253 df-mulr 17254 df-starv 17255 df-tset 17259 df-ple 17260 df-ds 17262 df-unif 17263 df-0g 17430 df-mgm 18607 df-sgrp 18686 df-mnd 18702 df-grp 18900 df-minusg 18901 df-subg 19085 df-cmn 19744 df-abl 19745 df-mgp 20082 df-rng 20100 df-ur 20129 df-ring 20182 df-subrng 20490 df-subrg 20515 df-cnfld 21287

This theorem is referenced by: cncdrg 25307

W3C validator