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 20564

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 20547	. . . . . 6 ⊢ (𝑠 ∈ (SubDRing‘𝑅) ↔ (𝑅 ∈ DivRing ∧ 𝑠 ∈ (SubRing‘𝑅) ∧ (𝑅 ↾_s 𝑠) ∈ DivRing))
4	3	simp2bi 1144	. . . . 5 ⊢ (𝑠 ∈ (SubDRing‘𝑅) → 𝑠 ∈ (SubRing‘𝑅))
5	4	ssriv 3985	. . . 4 ⊢ (SubDRing‘𝑅) ⊆ (SubRing‘𝑅)
6	5	a1i 11	. . 3 ⊢ (𝑅 ∈ DivRing → (SubDRing‘𝑅) ⊆ (SubRing‘𝑅))
7		eqid 2730	. . . . 5 ⊢ (Base‘𝑅) = (Base‘𝑅)
8	7	sdrgid 20551	. . . 4 ⊢ (𝑅 ∈ DivRing → (Base‘𝑅) ∈ (SubDRing‘𝑅))
9	8	ne0d 4334	. . 3 ⊢ (𝑅 ∈ DivRing → (SubDRing‘𝑅) ≠ ∅)
10	3	simp3bi 1145	. . . 4 ⊢ (𝑠 ∈ (SubDRing‘𝑅) → (𝑅 ↾_s 𝑠) ∈ DivRing)
11	10	adantl 480	. . 3 ⊢ ((𝑅 ∈ DivRing ∧ 𝑠 ∈ (SubDRing‘𝑅)) → (𝑅 ↾_s 𝑠) ∈ DivRing)
12	1, 2, 6, 9, 11	subdrgint 20562	. 2 ⊢ (𝑅 ∈ DivRing → 𝑃 ∈ DivRing)
13		drngring 20507	. . . 4 ⊢ (𝑃 ∈ DivRing → 𝑃 ∈ Ring)
14	12, 13	syl 17	. . 3 ⊢ (𝑅 ∈ DivRing → 𝑃 ∈ Ring)
15		ssidd 4004	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ DivRing → (Base‘𝑅) ⊆ (Base‘𝑅))
16		eqid 2730	. . . . . . . . . . . . . . 15 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅)
17		eqid 2730	. . . . . . . . . . . . . . 15 ⊢ (Cntz‘(mulGrp‘𝑅)) = (Cntz‘(mulGrp‘𝑅))
18	7, 16, 17	cntzsdrg 20561	. . . . . . . . . . . . . 14 ⊢ ((𝑅 ∈ DivRing ∧ (Base‘𝑅) ⊆ (Base‘𝑅)) → ((Cntz‘(mulGrp‘𝑅))‘(Base‘𝑅)) ∈ (SubDRing‘𝑅))
19	2, 15, 18	syl2anc 582	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ DivRing → ((Cntz‘(mulGrp‘𝑅))‘(Base‘𝑅)) ∈ (SubDRing‘𝑅))
20		intss1 4966	. . . . . . . . . . . . 13 ⊢ (((Cntz‘(mulGrp‘𝑅))‘(Base‘𝑅)) ∈ (SubDRing‘𝑅) → ∩ (SubDRing‘𝑅) ⊆ ((Cntz‘(mulGrp‘𝑅))‘(Base‘𝑅)))
21	19, 20	syl 17	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ DivRing → ∩ (SubDRing‘𝑅) ⊆ ((Cntz‘(mulGrp‘𝑅))‘(Base‘𝑅)))
22	16, 7	mgpbas 20034	. . . . . . . . . . . . 13 ⊢ (Base‘𝑅) = (Base‘(mulGrp‘𝑅))
23	22, 17	cntrval 19224	. . . . . . . . . . . 12 ⊢ ((Cntz‘(mulGrp‘𝑅))‘(Base‘𝑅)) = (Cntr‘(mulGrp‘𝑅))
24	21, 23	sseqtrdi 4031	. . . . . . . . . . 11 ⊢ (𝑅 ∈ DivRing → ∩ (SubDRing‘𝑅) ⊆ (Cntr‘(mulGrp‘𝑅)))
25	22	cntrss 19236	. . . . . . . . . . 11 ⊢ (Cntr‘(mulGrp‘𝑅)) ⊆ (Base‘𝑅)
26	24, 25	sstrdi 3993	. . . . . . . . . 10 ⊢ (𝑅 ∈ DivRing → ∩ (SubDRing‘𝑅) ⊆ (Base‘𝑅))
27	1, 7	ressbas2 17186	. . . . . . . . . 10 ⊢ (∩ (SubDRing‘𝑅) ⊆ (Base‘𝑅) → ∩ (SubDRing‘𝑅) = (Base‘𝑃))
28	26, 27	syl 17	. . . . . . . . 9 ⊢ (𝑅 ∈ DivRing → ∩ (SubDRing‘𝑅) = (Base‘𝑃))
29	28, 24	eqsstrrd 4020	. . . . . . . 8 ⊢ (𝑅 ∈ DivRing → (Base‘𝑃) ⊆ (Cntr‘(mulGrp‘𝑅)))
30	29	adantr 479	. . . . . . 7 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → (Base‘𝑃) ⊆ (Cntr‘(mulGrp‘𝑅)))
31		simprl 767	. . . . . . 7 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → 𝑥 ∈ (Base‘𝑃))
32	30, 31	sseldd 3982	. . . . . 6 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → 𝑥 ∈ (Cntr‘(mulGrp‘𝑅)))
33	28, 26	eqsstrrd 4020	. . . . . . . 8 ⊢ (𝑅 ∈ DivRing → (Base‘𝑃) ⊆ (Base‘𝑅))
34	33	adantr 479	. . . . . . 7 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → (Base‘𝑃) ⊆ (Base‘𝑅))
35		simprr 769	. . . . . . 7 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → 𝑦 ∈ (Base‘𝑃))
36	34, 35	sseldd 3982	. . . . . 6 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → 𝑦 ∈ (Base‘𝑅))
37		eqid 2730	. . . . . . . 8 ⊢ (._r‘𝑅) = (._r‘𝑅)
38	16, 37	mgpplusg 20032	. . . . . . 7 ⊢ (._r‘𝑅) = (+_g‘(mulGrp‘𝑅))
39		eqid 2730	. . . . . . 7 ⊢ (Cntr‘(mulGrp‘𝑅)) = (Cntr‘(mulGrp‘𝑅))
40	22, 38, 39	cntri 19237	. . . . . 6 ⊢ ((𝑥 ∈ (Cntr‘(mulGrp‘𝑅)) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥(._r‘𝑅)𝑦) = (𝑦(._r‘𝑅)𝑥))
41	32, 36, 40	syl2anc 582	. . . . 5 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → (𝑥(._r‘𝑅)𝑦) = (𝑦(._r‘𝑅)𝑥))
42	8, 26	ssexd 5323	. . . . . . 7 ⊢ (𝑅 ∈ DivRing → ∩ (SubDRing‘𝑅) ∈ V)
43	1, 37	ressmulr 17256	. . . . . . 7 ⊢ (∩ (SubDRing‘𝑅) ∈ V → (._r‘𝑅) = (._r‘𝑃))
44	42, 43	syl 17	. . . . . 6 ⊢ (𝑅 ∈ DivRing → (._r‘𝑅) = (._r‘𝑃))
45	44	oveqdr 7439	. . . . 5 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → (𝑥(._r‘𝑅)𝑦) = (𝑥(._r‘𝑃)𝑦))
46	44	oveqdr 7439	. . . . 5 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → (𝑦(._r‘𝑅)𝑥) = (𝑦(._r‘𝑃)𝑥))
47	41, 45, 46	3eqtr3d 2778	. . . 4 ⊢ ((𝑅 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝑃) ∧ 𝑦 ∈ (Base‘𝑃))) → (𝑥(._r‘𝑃)𝑦) = (𝑦(._r‘𝑃)𝑥))
48	47	ralrimivva 3198	. . 3 ⊢ (𝑅 ∈ DivRing → ∀𝑥 ∈ (Base‘𝑃)∀𝑦 ∈ (Base‘𝑃)(𝑥(._r‘𝑃)𝑦) = (𝑦(._r‘𝑃)𝑥))
49		eqid 2730	. . . 4 ⊢ (Base‘𝑃) = (Base‘𝑃)
50		eqid 2730	. . . 4 ⊢ (._r‘𝑃) = (._r‘𝑃)
51	49, 50	iscrng2 20146	. . 3 ⊢ (𝑃 ∈ CRing ↔ (𝑃 ∈ Ring ∧ ∀𝑥 ∈ (Base‘𝑃)∀𝑦 ∈ (Base‘𝑃)(𝑥(._r‘𝑃)𝑦) = (𝑦(._r‘𝑃)𝑥)))
52	14, 48, 51	sylanbrc 581	. 2 ⊢ (𝑅 ∈ DivRing → 𝑃 ∈ CRing)
53		isfld 20511	. 2 ⊢ (𝑃 ∈ Field ↔ (𝑃 ∈ DivRing ∧ 𝑃 ∈ CRing))
54	12, 52, 53	sylanbrc 581	1 ⊢ (𝑅 ∈ DivRing → 𝑃 ∈ Field)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 394 = wceq 1539 ∈ wcel 2104 ∀wral 3059 Vcvv 3472 ⊆ wss 3947 ∩ cint 4949 ‘cfv 6542 (class class class)co 7411 Basecbs 17148 ↾_s cress 17177 ._rcmulr 17202 Cntzccntz 19220 Cntrccntr 19221 mulGrpcmgp 20028 Ringcrg 20127 CRingccrg 20128 SubRingcsubrg 20457 DivRingcdr 20500 Fieldcfield 20501 SubDRingcsdrg 20545

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 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 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-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-iin 4999 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 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-tpos 8213 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-nn 12217 df-2 12279 df-3 12280 df-sets 17101 df-slot 17119 df-ndx 17131 df-base 17149 df-ress 17178 df-plusg 17214 df-mulr 17215 df-0g 17391 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-submnd 18706 df-grp 18858 df-minusg 18859 df-subg 19039 df-cntz 19222 df-cntr 19223 df-cmn 19691 df-abl 19692 df-mgp 20029 df-rng 20047 df-ur 20076 df-ring 20129 df-cring 20130 df-oppr 20225 df-dvdsr 20248 df-unit 20249 df-invr 20279 df-dvr 20292 df-subrng 20434 df-subrg 20459 df-drng 20502 df-field 20503 df-sdrg 20546

This theorem is referenced by: (None)

W3C validator