ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  subrgugrp GIF version

Theorem subrgugrp 14402
Description: The units of a subring form a subgroup of the unit group of the original ring. (Contributed by Mario Carneiro, 4-Dec-2014.)
Hypotheses
Ref Expression
subrgugrp.1 𝑆 = (𝑅s 𝐴)
subrgugrp.2 𝑈 = (Unit‘𝑅)
subrgugrp.3 𝑉 = (Unit‘𝑆)
subrgugrp.4 𝐺 = ((mulGrp‘𝑅) ↾s 𝑈)
Assertion
Ref Expression
subrgugrp (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ∈ (SubGrp‘𝐺))

Proof of Theorem subrgugrp
Dummy variables 𝑥 𝑦 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 subrgugrp.1 . . . 4 𝑆 = (𝑅s 𝐴)
2 subrgugrp.2 . . . 4 𝑈 = (Unit‘𝑅)
3 subrgugrp.3 . . . 4 𝑉 = (Unit‘𝑆)
41, 2, 3subrguss 14398 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝑉𝑈)
5 subrgrcl 14388 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
62a1i 9 . . . . 5 (𝑅 ∈ Ring → 𝑈 = (Unit‘𝑅))
7 subrgugrp.4 . . . . . 6 𝐺 = ((mulGrp‘𝑅) ↾s 𝑈)
87a1i 9 . . . . 5 (𝑅 ∈ Ring → 𝐺 = ((mulGrp‘𝑅) ↾s 𝑈))
9 ringsrg 14208 . . . . 5 (𝑅 ∈ Ring → 𝑅 ∈ SRing)
106, 8, 9unitgrpbasd 14277 . . . 4 (𝑅 ∈ Ring → 𝑈 = (Base‘𝐺))
115, 10syl 14 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝑈 = (Base‘𝐺))
124, 11sseqtrd 3278 . 2 (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ⊆ (Base‘𝐺))
131subrgring 14386 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
14 eqid 2234 . . . 4 (1r𝑆) = (1r𝑆)
153, 141unit 14269 . . 3 (𝑆 ∈ Ring → (1r𝑆) ∈ 𝑉)
16 elex2 2832 . . 3 ((1r𝑆) ∈ 𝑉 → ∃𝑤 𝑤𝑉)
1713, 15, 163syl 17 . 2 (𝐴 ∈ (SubRing‘𝑅) → ∃𝑤 𝑤𝑉)
18 eqid 2234 . . . . . . . . . . . 12 (.r𝑅) = (.r𝑅)
191, 18ressmulrg 13375 . . . . . . . . . . 11 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r𝑅) = (.r𝑆))
205, 19mpdan 421 . . . . . . . . . 10 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (.r𝑆))
21203ad2ant1 1045 . . . . . . . . 9 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉𝑦𝑉) → (.r𝑅) = (.r𝑆))
2221oveqd 6069 . . . . . . . 8 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉𝑦𝑉) → (𝑥(.r𝑅)𝑦) = (𝑥(.r𝑆)𝑦))
23 eqid 2234 . . . . . . . . . 10 (.r𝑆) = (.r𝑆)
243, 23unitmulcl 14275 . . . . . . . . 9 ((𝑆 ∈ Ring ∧ 𝑥𝑉𝑦𝑉) → (𝑥(.r𝑆)𝑦) ∈ 𝑉)
2513, 24syl3an1 1307 . . . . . . . 8 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉𝑦𝑉) → (𝑥(.r𝑆)𝑦) ∈ 𝑉)
2622, 25eqeltrd 2311 . . . . . . 7 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉𝑦𝑉) → (𝑥(.r𝑅)𝑦) ∈ 𝑉)
27263expa 1230 . . . . . 6 (((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) ∧ 𝑦𝑉) → (𝑥(.r𝑅)𝑦) ∈ 𝑉)
2827ralrimiva 2617 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) → ∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉)
29 eqid 2234 . . . . . . 7 (invr𝑅) = (invr𝑅)
30 eqid 2234 . . . . . . 7 (invr𝑆) = (invr𝑆)
311, 29, 3, 30subrginv 14399 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) → ((invr𝑅)‘𝑥) = ((invr𝑆)‘𝑥))
323, 30unitinvcl 14285 . . . . . . 7 ((𝑆 ∈ Ring ∧ 𝑥𝑉) → ((invr𝑆)‘𝑥) ∈ 𝑉)
3313, 32sylan 283 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) → ((invr𝑆)‘𝑥) ∈ 𝑉)
3431, 33eqeltrd 2311 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) → ((invr𝑅)‘𝑥) ∈ 𝑉)
3528, 34jca 306 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) → (∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉 ∧ ((invr𝑅)‘𝑥) ∈ 𝑉))
3635ralrimiva 2617 . . 3 (𝐴 ∈ (SubRing‘𝑅) → ∀𝑥𝑉 (∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉 ∧ ((invr𝑅)‘𝑥) ∈ 𝑉))
37 eqid 2234 . . . . . . . . . . 11 (mulGrp‘𝑅) = (mulGrp‘𝑅)
3837, 18mgpplusgg 14085 . . . . . . . . . 10 (𝑅 ∈ Ring → (.r𝑅) = (+g‘(mulGrp‘𝑅)))
39 basfn 13288 . . . . . . . . . . . 12 Base Fn V
40 elex 2827 . . . . . . . . . . . 12 (𝑅 ∈ Ring → 𝑅 ∈ V)
41 funfvex 5689 . . . . . . . . . . . . 13 ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
4241funfni 5460 . . . . . . . . . . . 12 ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
4339, 40, 42sylancr 414 . . . . . . . . . . 11 (𝑅 ∈ Ring → (Base‘𝑅) ∈ V)
44 eqidd 2235 . . . . . . . . . . . 12 (𝑅 ∈ Ring → (Base‘𝑅) = (Base‘𝑅))
4544, 6, 9unitssd 14271 . . . . . . . . . . 11 (𝑅 ∈ Ring → 𝑈 ⊆ (Base‘𝑅))
4643, 45ssexd 4252 . . . . . . . . . 10 (𝑅 ∈ Ring → 𝑈 ∈ V)
4737ringmgp 14163 . . . . . . . . . 10 (𝑅 ∈ Ring → (mulGrp‘𝑅) ∈ Mnd)
488, 38, 46, 47ressplusgd 13359 . . . . . . . . 9 (𝑅 ∈ Ring → (.r𝑅) = (+g𝐺))
495, 48syl 14 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (+g𝐺))
5049oveqd 6069 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → (𝑥(.r𝑅)𝑦) = (𝑥(+g𝐺)𝑦))
5150eleq1d 2303 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → ((𝑥(.r𝑅)𝑦) ∈ 𝑉 ↔ (𝑥(+g𝐺)𝑦) ∈ 𝑉))
5251ralbidv 2544 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → (∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉 ↔ ∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉))
532a1i 9 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → 𝑈 = (Unit‘𝑅))
547a1i 9 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → 𝐺 = ((mulGrp‘𝑅) ↾s 𝑈))
55 eqidd 2235 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → (invr𝑅) = (invr𝑅))
5653, 54, 55, 5invrfvald 14284 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → (invr𝑅) = (invg𝐺))
5756fveq1d 5674 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → ((invr𝑅)‘𝑥) = ((invg𝐺)‘𝑥))
5857eleq1d 2303 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → (((invr𝑅)‘𝑥) ∈ 𝑉 ↔ ((invg𝐺)‘𝑥) ∈ 𝑉))
5952, 58anbi12d 473 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → ((∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉 ∧ ((invr𝑅)‘𝑥) ∈ 𝑉) ↔ (∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉 ∧ ((invg𝐺)‘𝑥) ∈ 𝑉)))
6059ralbidv 2544 . . 3 (𝐴 ∈ (SubRing‘𝑅) → (∀𝑥𝑉 (∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉 ∧ ((invr𝑅)‘𝑥) ∈ 𝑉) ↔ ∀𝑥𝑉 (∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉 ∧ ((invg𝐺)‘𝑥) ∈ 𝑉)))
6136, 60mpbid 147 . 2 (𝐴 ∈ (SubRing‘𝑅) → ∀𝑥𝑉 (∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉 ∧ ((invg𝐺)‘𝑥) ∈ 𝑉))
622, 7unitgrp 14278 . . 3 (𝑅 ∈ Ring → 𝐺 ∈ Grp)
63 eqid 2234 . . . 4 (Base‘𝐺) = (Base‘𝐺)
64 eqid 2234 . . . 4 (+g𝐺) = (+g𝐺)
65 eqid 2234 . . . 4 (invg𝐺) = (invg𝐺)
6663, 64, 65issubg2m 13923 . . 3 (𝐺 ∈ Grp → (𝑉 ∈ (SubGrp‘𝐺) ↔ (𝑉 ⊆ (Base‘𝐺) ∧ ∃𝑤 𝑤𝑉 ∧ ∀𝑥𝑉 (∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉 ∧ ((invg𝐺)‘𝑥) ∈ 𝑉))))
675, 62, 663syl 17 . 2 (𝐴 ∈ (SubRing‘𝑅) → (𝑉 ∈ (SubGrp‘𝐺) ↔ (𝑉 ⊆ (Base‘𝐺) ∧ ∃𝑤 𝑤𝑉 ∧ ∀𝑥𝑉 (∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉 ∧ ((invg𝐺)‘𝑥) ∈ 𝑉))))
6812, 17, 61, 67mpbir3and 1207 1 (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ∈ (SubGrp‘𝐺))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1005   = wceq 1398  wex 1541  wcel 2205  wral 2522  Vcvv 2815  wss 3213   Fn wfn 5349  cfv 5354  (class class class)co 6052  Basecbs 13229  s cress 13230  +gcplusg 13307  .rcmulr 13308  Mndcmnd 13646  Grpcgrp 13730  invgcminusg 13731  SubGrpcsubg 13901  mulGrpcmgp 14081  1rcur 14120  Ringcrg 14157  Unitcui 14248  invrcinvr 14282  SubRingcsubrg 14379
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-addass 8231  ax-i2m1 8234  ax-0lt1 8235  ax-0id 8237  ax-rnegex 8238  ax-pre-ltirr 8241  ax-pre-lttrn 8243  ax-pre-ltadd 8245
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-tpos 6478  df-pnf 8312  df-mnf 8313  df-ltxr 8315  df-inn 9240  df-2 9298  df-3 9299  df-ndx 13232  df-slot 13233  df-base 13235  df-sets 13236  df-iress 13237  df-plusg 13320  df-mulr 13321  df-0g 13488  df-mgm 13586  df-sgrp 13632  df-mnd 13647  df-grp 13733  df-minusg 13734  df-subg 13904  df-cmn 14020  df-abl 14021  df-mgp 14082  df-ur 14121  df-srg 14125  df-ring 14159  df-oppr 14229  df-dvdsr 14250  df-unit 14251  df-invr 14283  df-subrg 14381
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator