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

Theorem subrgugrp 14486
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 14482 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝑉𝑈)
5 subrgrcl 14472 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
62a1i 9 . . . . 5 (𝑅 ∈ Ring → 𝑈 = (Unit‘𝑅))
7 subrgugrp.4 . . . . . 6 𝐺 = ((mulGrp‘𝑅) ↾s 𝑈)
87a1i 9 . . . . 5 (𝑅 ∈ Ring → 𝐺 = ((mulGrp‘𝑅) ↾s 𝑈))
9 ringsrg 14290 . . . . 5 (𝑅 ∈ Ring → 𝑅 ∈ SRing)
106, 8, 9unitgrpbasd 14360 . . . 4 (𝑅 ∈ Ring → 𝑈 = (Base‘𝐺))
115, 10syl 14 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝑈 = (Base‘𝐺))
124, 11sseqtrd 3280 . 2 (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ⊆ (Base‘𝐺))
131subrgring 14470 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
14 eqid 2234 . . . 4 (1r𝑆) = (1r𝑆)
153, 141unit 14352 . . 3 (𝑆 ∈ Ring → (1r𝑆) ∈ 𝑉)
16 elex2 2832 . . 3 ((1r𝑆) ∈ 𝑉 → ∃𝑤 𝑤𝑉)
1713, 15, 163syl 17 . 2 (𝐴 ∈ (SubRing‘𝑅) → ∃𝑤 𝑤𝑉)
18 eqid 2234 . . . . . . . . . . . 12 (.r𝑅) = (.r𝑅)
191, 18ressmulrg 13442 . . . . . . . . . . 11 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r𝑅) = (.r𝑆))
205, 19mpdan 421 . . . . . . . . . 10 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (.r𝑆))
21203ad2ant1 1045 . . . . . . . . 9 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉𝑦𝑉) → (.r𝑅) = (.r𝑆))
2221oveqd 6075 . . . . . . . 8 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉𝑦𝑉) → (𝑥(.r𝑅)𝑦) = (𝑥(.r𝑆)𝑦))
23 eqid 2234 . . . . . . . . . 10 (.r𝑆) = (.r𝑆)
243, 23unitmulcl 14358 . . . . . . . . 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 14483 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) → ((invr𝑅)‘𝑥) = ((invr𝑆)‘𝑥))
323, 30unitinvcl 14368 . . . . . . 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 14163 . . . . . . . . . 10 (𝑅 ∈ Ring → (.r𝑅) = (+g‘(mulGrp‘𝑅)))
39 basfn 13355 . . . . . . . . . . . 12 Base Fn V
40 elex 2827 . . . . . . . . . . . 12 (𝑅 ∈ Ring → 𝑅 ∈ V)
41 funfvex 5692 . . . . . . . . . . . . 13 ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
4241funfni 5463 . . . . . . . . . . . 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 14354 . . . . . . . . . . 11 (𝑅 ∈ Ring → 𝑈 ⊆ (Base‘𝑅))
4643, 45ssexd 4255 . . . . . . . . . 10 (𝑅 ∈ Ring → 𝑈 ∈ V)
4737ringmgp 14245 . . . . . . . . . 10 (𝑅 ∈ Ring → (mulGrp‘𝑅) ∈ Mnd)
488, 38, 46, 47ressplusgd 13426 . . . . . . . . 9 (𝑅 ∈ Ring → (.r𝑅) = (+g𝐺))
495, 48syl 14 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (+g𝐺))
5049oveqd 6075 . . . . . . 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 14367 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → (invr𝑅) = (invg𝐺))
5756fveq1d 5677 . . . . . 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 14361 . . 3 (𝑅 ∈ Ring → 𝐺 ∈ Grp)
63 eqid 2234 . . . 4 (Base‘𝐺) = (Base‘𝐺)
64 eqid 2234 . . . 4 (+g𝐺) = (+g𝐺)
65 eqid 2234 . . . 4 (invg𝐺) = (invg𝐺)
6663, 64, 65issubg2m 13942 . . 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 3214   Fn wfn 5352  cfv 5357  (class class class)co 6058  Basecbs 13296  s cress 13297  +gcplusg 13374  .rcmulr 13375  Mndcmnd 13677  Grpcgrp 13755  invgcminusg 13756  SubGrpcsubg 13920  mulGrpcmgp 14159  1rcur 14202  Ringcrg 14239  Unitcui 14331  invrcinvr 14365  SubRingcsubrg 14463
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 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-pre-ltirr 8255  ax-pre-lttrn 8257  ax-pre-ltadd 8259
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 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-tpos 6489  df-pnf 8326  df-mnf 8327  df-ltxr 8329  df-inn 9255  df-2 9313  df-3 9314  df-ndx 13299  df-slot 13300  df-base 13302  df-sets 13303  df-iress 13304  df-plusg 13387  df-mulr 13388  df-0g 13555  df-mgm 13619  df-sgrp 13665  df-mnd 13678  df-grp 13758  df-minusg 13759  df-subg 13923  df-cmn 14039  df-abl 14040  df-mgp 14160  df-ur 14203  df-srg 14207  df-ring 14241  df-oppr 14311  df-dvdsr 14333  df-unit 14334  df-invr 14366  df-subrg 14465
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator