primefld - Metamath Proof Explorer

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

Theorem primefld 20421

Description: The smallest sub division ring of a division ring, here named 𝑃, is a field, called the Prime Field of 𝑅. (Suggested by GL, 4-Aug-2023.) (Contributed by Thierry Arnoux, 21-Aug-2023.)

**Hypothesis**
Ref	Expression
primefld.1	⊢ 𝑃 = (𝑅 ↾_s ∩ (SubDRing‘𝑅))

**Assertion**
Ref	Expression
primefld	⊢ (𝑅 ∈ DivRing → 𝑃 ∈ Field)

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

Step	Hyp	Ref	Expression
1		primefld.1	. . 3 ⊢ 𝑃 = (𝑅 ↾_s ∩ (SubDRing‘𝑅))
2		id 22	. . 3 ⊢ (𝑅 ∈ DivRing → 𝑅 ∈ DivRing)
3		issdrg 20404	. . . . . 6 ⊢ (𝑠 ∈ (SubDRing‘𝑅) ↔ (𝑅 ∈ DivRing ∧ 𝑠 ∈ (SubRing‘𝑅) ∧ (𝑅 ↾_s 𝑠) ∈ DivRing))
4	3	simp2bi 1147	. . . . 5 ⊢ (𝑠 ∈ (SubDRing‘𝑅) → 𝑠 ∈ (SubRing‘𝑅))
5	4	ssriv 3987	. . . 4 ⊢ (SubDRing‘𝑅) ⊆ (SubRing‘𝑅)
6	5	a1i 11	. . 3 ⊢ (𝑅 ∈ DivRing → (SubDRing‘𝑅) ⊆ (SubRing‘𝑅))
7		eqid 2733	. . . . 5 ⊢ (Base‘𝑅) = (Base‘𝑅)
8	7	sdrgid 20408	. . . 4 ⊢ (𝑅 ∈ DivRing → (Base‘𝑅) ∈ (SubDRing‘𝑅))
9	8	ne0d 4336	. . 3 ⊢ (𝑅 ∈ DivRing → (SubDRing‘𝑅) ≠ ∅)
10	3	simp3bi 1148	. . . 4 ⊢ (𝑠 ∈ (SubDRing‘𝑅) → (𝑅 ↾_s 𝑠) ∈ DivRing)
11	10	adantl 483	. . 3 ⊢ ((𝑅 ∈ DivRing ∧ 𝑠 ∈ (SubDRing‘𝑅)) → (𝑅 ↾_s 𝑠) ∈ DivRing)
12	1, 2, 6, 9, 11	subdrgint 20419	. 2 ⊢ (𝑅 ∈ DivRing → 𝑃 ∈ DivRing)
13		drngring 20364	. . . 4 ⊢ (𝑃 ∈ DivRing → 𝑃 ∈ Ring)
14	12, 13	syl 17	. . 3 ⊢ (𝑅 ∈ DivRing → 𝑃 ∈ Ring)
15		ssidd 4006	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ DivRing → (Base‘𝑅) ⊆ (Base‘𝑅))
16		eqid 2733	. . . . . . . . . . . . . . 15 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅)
17		eqid 2733	. . . . . . . . . . . . . . 15 ⊢ (Cntz‘(mulGrp‘𝑅)) = (Cntz‘(mulGrp‘𝑅))
18	7, 16, 17	cntzsdrg 20418	. . . . . . . . . . . . . 14 ⊢ ((𝑅 ∈ DivRing ∧ (Base‘𝑅) ⊆ (Base‘𝑅)) → ((Cntz‘(mulGrp‘𝑅))‘(Base‘𝑅)) ∈ (SubDRing‘𝑅))
19	2, 15, 18	syl2anc 585	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ DivRing → ((Cntz‘(mulGrp‘𝑅))‘(Base‘𝑅)) ∈ (SubDRing‘𝑅))
20		intss1 4968	. . . . . . . . . . . . 13 ⊢ (((Cntz‘(mulGrp‘𝑅))‘(Base‘𝑅)) ∈ (SubDRing‘𝑅) → ∩ (SubDRing‘𝑅) ⊆ ((Cntz‘(mulGrp‘𝑅))‘(Base‘𝑅)))
21	19, 20	syl 17	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ DivRing → ∩ (SubDRing‘𝑅) ⊆ ((Cntz‘(mulGrp‘𝑅))‘(Base‘𝑅)))
22	16, 7	mgpbas 19993	. . . . . . . . . . . . 13 ⊢ (Base‘𝑅) = (Base‘(mulGrp‘𝑅))
23	22, 17	cntrval 19183	. . . . . . . . . . . 12 ⊢ ((Cntz‘(mulGrp‘𝑅))‘(Base‘𝑅)) = (Cntr‘(mulGrp‘𝑅))
24	21, 23	sseqtrdi 4033	. . . . . . . . . . 11 ⊢ (𝑅 ∈ DivRing → ∩ (SubDRing‘𝑅) ⊆ (Cntr‘(mulGrp‘𝑅)))
25	22	cntrss 19195	. . . . . . . . . . 11 ⊢ (Cntr‘(mulGrp‘𝑅)) ⊆ (Base‘𝑅)
26	24, 25	sstrdi 3995	. . . . . . . . . 10 ⊢ (𝑅 ∈ DivRing → ∩ (SubDRing‘𝑅) ⊆ (Base‘𝑅))
27	1, 7	ressbas2 17182	. . . . . . . . . 10 ⊢ (∩ (SubDRing‘𝑅) ⊆ (Base‘𝑅) → ∩ (SubDRing‘𝑅) = (Base‘𝑃))
28	26, 27	syl 17	. . . . . . . . 9 ⊢ (𝑅 ∈ DivRing → ∩ (SubDRing‘𝑅) = (Base‘𝑃))
29	28, 24	eqsstrrd 4022	. . . . . . . 8 ⊢ (𝑅 ∈ DivRing → (Base‘𝑃) ⊆ (Cntr‘(mulGrp‘𝑅)))
30	29	adantr 482	. . . . . . 7 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → (Base‘𝑃) ⊆ (Cntr‘(mulGrp‘𝑅)))
31		simprl 770	. . . . . . 7 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → 𝑥 ∈ (Base‘𝑃))
32	30, 31	sseldd 3984	. . . . . 6 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → 𝑥 ∈ (Cntr‘(mulGrp‘𝑅)))
33	28, 26	eqsstrrd 4022	. . . . . . . 8 ⊢ (𝑅 ∈ DivRing → (Base‘𝑃) ⊆ (Base‘𝑅))
34	33	adantr 482	. . . . . . 7 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → (Base‘𝑃) ⊆ (Base‘𝑅))
35		simprr 772	. . . . . . 7 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → 𝑦 ∈ (Base‘𝑃))
36	34, 35	sseldd 3984	. . . . . 6 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → 𝑦 ∈ (Base‘𝑅))
37		eqid 2733	. . . . . . . 8 ⊢ (._r‘𝑅) = (._r‘𝑅)
38	16, 37	mgpplusg 19991	. . . . . . 7 ⊢ (._r‘𝑅) = (+_g‘(mulGrp‘𝑅))
39		eqid 2733	. . . . . . 7 ⊢ (Cntr‘(mulGrp‘𝑅)) = (Cntr‘(mulGrp‘𝑅))
40	22, 38, 39	cntri 19196	. . . . . 6 ⊢ ((𝑥 ∈ (Cntr‘(mulGrp‘𝑅)) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥(._r‘𝑅)𝑦) = (𝑦(._r‘𝑅)𝑥))
41	32, 36, 40	syl2anc 585	. . . . 5 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → (𝑥(._r‘𝑅)𝑦) = (𝑦(._r‘𝑅)𝑥))
42	8, 26	ssexd 5325	. . . . . . 7 ⊢ (𝑅 ∈ DivRing → ∩ (SubDRing‘𝑅) ∈ V)
43	1, 37	ressmulr 17252	. . . . . . 7 ⊢ (∩ (SubDRing‘𝑅) ∈ V → (._r‘𝑅) = (._r‘𝑃))
44	42, 43	syl 17	. . . . . 6 ⊢ (𝑅 ∈ DivRing → (._r‘𝑅) = (._r‘𝑃))
45	44	oveqdr 7437	. . . . 5 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → (𝑥(._r‘𝑅)𝑦) = (𝑥(._r‘𝑃)𝑦))
46	44	oveqdr 7437	. . . . 5 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → (𝑦(._r‘𝑅)𝑥) = (𝑦(._r‘𝑃)𝑥))
47	41, 45, 46	3eqtr3d 2781	. . . 4 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → (𝑥(._r‘𝑃)𝑦) = (𝑦(._r‘𝑃)𝑥))
48	47	ralrimivva 3201	. . 3 ⊢ (𝑅 ∈ DivRing → ∀𝑥 ∈ (Base‘𝑃)∀𝑦 ∈ (Base‘𝑃)(𝑥(._r‘𝑃)𝑦) = (𝑦(._r‘𝑃)𝑥))
49		eqid 2733	. . . 4 ⊢ (Base‘𝑃) = (Base‘𝑃)
50		eqid 2733	. . . 4 ⊢ (._r‘𝑃) = (._r‘𝑃)
51	49, 50	iscrng2 20075	. . 3 ⊢ (𝑃 ∈ CRing ↔ (𝑃 ∈ Ring ∧ ∀𝑥 ∈ (Base‘𝑃)∀𝑦 ∈ (Base‘𝑃)(𝑥(._r‘𝑃)𝑦) = (𝑦(._r‘𝑃)𝑥)))
52	14, 48, 51	sylanbrc 584	. 2 ⊢ (𝑅 ∈ DivRing → 𝑃 ∈ CRing)
53		isfld 20368	. 2 ⊢ (𝑃 ∈ Field ↔ (𝑃 ∈ DivRing ∧ 𝑃 ∈ CRing))
54	12, 52, 53	sylanbrc 584	1 ⊢ (𝑅 ∈ DivRing → 𝑃 ∈ Field)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∀wral 3062 Vcvv 3475 ⊆ wss 3949 ∩ cint 4951 ‘cfv 6544 (class class class)co 7409 Basecbs 17144 ↾_s cress 17173 ._rcmulr 17198 Cntzccntz 19179 Cntrccntr 19180 mulGrpcmgp 19987 Ringcrg 20056 CRingccrg 20057 SubRingcsubrg 20315 DivRingcdr 20357 Fieldcfield 20358 SubDRingcsdrg 20402

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-iin 5001 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-tpos 8211 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-nn 12213 df-2 12275 df-3 12276 df-sets 17097 df-slot 17115 df-ndx 17127 df-base 17145 df-ress 17174 df-plusg 17210 df-mulr 17211 df-0g 17387 df-mgm 18561 df-sgrp 18610 df-mnd 18626 df-submnd 18672 df-grp 18822 df-minusg 18823 df-subg 19003 df-cntz 19181 df-cntr 19182 df-cmn 19650 df-mgp 19988 df-ur 20005 df-ring 20058 df-cring 20059 df-oppr 20150 df-dvdsr 20171 df-unit 20172 df-invr 20202 df-dvr 20215 df-subrg 20317 df-drng 20359 df-field 20360 df-sdrg 20403

This theorem is referenced by: (None)

W3C validator