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

Theorem subrgugrp 14244
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 14240 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝑉𝑈)
5 subrgrcl 14230 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
62a1i 9 . . . . 5 (𝑅 ∈ Ring → 𝑈 = (Unit‘𝑅))
7 subrgugrp.4 . . . . . 6 𝐺 = ((mulGrp‘𝑅) ↾s 𝑈)
87a1i 9 . . . . 5 (𝑅 ∈ Ring → 𝐺 = ((mulGrp‘𝑅) ↾s 𝑈))
9 ringsrg 14050 . . . . 5 (𝑅 ∈ Ring → 𝑅 ∈ SRing)
106, 8, 9unitgrpbasd 14119 . . . 4 (𝑅 ∈ Ring → 𝑈 = (Base‘𝐺))
115, 10syl 14 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝑈 = (Base‘𝐺))
124, 11sseqtrd 3263 . 2 (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ⊆ (Base‘𝐺))
131subrgring 14228 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
14 eqid 2229 . . . 4 (1r𝑆) = (1r𝑆)
153, 141unit 14111 . . 3 (𝑆 ∈ Ring → (1r𝑆) ∈ 𝑉)
16 elex2 2817 . . 3 ((1r𝑆) ∈ 𝑉 → ∃𝑤 𝑤𝑉)
1713, 15, 163syl 17 . 2 (𝐴 ∈ (SubRing‘𝑅) → ∃𝑤 𝑤𝑉)
18 eqid 2229 . . . . . . . . . . . 12 (.r𝑅) = (.r𝑅)
191, 18ressmulrg 13218 . . . . . . . . . . 11 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r𝑅) = (.r𝑆))
205, 19mpdan 421 . . . . . . . . . 10 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (.r𝑆))
21203ad2ant1 1042 . . . . . . . . 9 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉𝑦𝑉) → (.r𝑅) = (.r𝑆))
2221oveqd 6030 . . . . . . . 8 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉𝑦𝑉) → (𝑥(.r𝑅)𝑦) = (𝑥(.r𝑆)𝑦))
23 eqid 2229 . . . . . . . . . 10 (.r𝑆) = (.r𝑆)
243, 23unitmulcl 14117 . . . . . . . . 9 ((𝑆 ∈ Ring ∧ 𝑥𝑉𝑦𝑉) → (𝑥(.r𝑆)𝑦) ∈ 𝑉)
2513, 24syl3an1 1304 . . . . . . . 8 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉𝑦𝑉) → (𝑥(.r𝑆)𝑦) ∈ 𝑉)
2622, 25eqeltrd 2306 . . . . . . 7 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉𝑦𝑉) → (𝑥(.r𝑅)𝑦) ∈ 𝑉)
27263expa 1227 . . . . . 6 (((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) ∧ 𝑦𝑉) → (𝑥(.r𝑅)𝑦) ∈ 𝑉)
2827ralrimiva 2603 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) → ∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉)
29 eqid 2229 . . . . . . 7 (invr𝑅) = (invr𝑅)
30 eqid 2229 . . . . . . 7 (invr𝑆) = (invr𝑆)
311, 29, 3, 30subrginv 14241 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) → ((invr𝑅)‘𝑥) = ((invr𝑆)‘𝑥))
323, 30unitinvcl 14127 . . . . . . 7 ((𝑆 ∈ Ring ∧ 𝑥𝑉) → ((invr𝑆)‘𝑥) ∈ 𝑉)
3313, 32sylan 283 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) → ((invr𝑆)‘𝑥) ∈ 𝑉)
3431, 33eqeltrd 2306 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) → ((invr𝑅)‘𝑥) ∈ 𝑉)
3528, 34jca 306 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) → (∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉 ∧ ((invr𝑅)‘𝑥) ∈ 𝑉))
3635ralrimiva 2603 . . 3 (𝐴 ∈ (SubRing‘𝑅) → ∀𝑥𝑉 (∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉 ∧ ((invr𝑅)‘𝑥) ∈ 𝑉))
37 eqid 2229 . . . . . . . . . . 11 (mulGrp‘𝑅) = (mulGrp‘𝑅)
3837, 18mgpplusgg 13927 . . . . . . . . . 10 (𝑅 ∈ Ring → (.r𝑅) = (+g‘(mulGrp‘𝑅)))
39 basfn 13131 . . . . . . . . . . . 12 Base Fn V
40 elex 2812 . . . . . . . . . . . 12 (𝑅 ∈ Ring → 𝑅 ∈ V)
41 funfvex 5652 . . . . . . . . . . . . 13 ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
4241funfni 5429 . . . . . . . . . . . 12 ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
4339, 40, 42sylancr 414 . . . . . . . . . . 11 (𝑅 ∈ Ring → (Base‘𝑅) ∈ V)
44 eqidd 2230 . . . . . . . . . . . 12 (𝑅 ∈ Ring → (Base‘𝑅) = (Base‘𝑅))
4544, 6, 9unitssd 14113 . . . . . . . . . . 11 (𝑅 ∈ Ring → 𝑈 ⊆ (Base‘𝑅))
4643, 45ssexd 4227 . . . . . . . . . 10 (𝑅 ∈ Ring → 𝑈 ∈ V)
4737ringmgp 14005 . . . . . . . . . 10 (𝑅 ∈ Ring → (mulGrp‘𝑅) ∈ Mnd)
488, 38, 46, 47ressplusgd 13202 . . . . . . . . 9 (𝑅 ∈ Ring → (.r𝑅) = (+g𝐺))
495, 48syl 14 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (+g𝐺))
5049oveqd 6030 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → (𝑥(.r𝑅)𝑦) = (𝑥(+g𝐺)𝑦))
5150eleq1d 2298 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → ((𝑥(.r𝑅)𝑦) ∈ 𝑉 ↔ (𝑥(+g𝐺)𝑦) ∈ 𝑉))
5251ralbidv 2530 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → (∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉 ↔ ∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉))
532a1i 9 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → 𝑈 = (Unit‘𝑅))
547a1i 9 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → 𝐺 = ((mulGrp‘𝑅) ↾s 𝑈))
55 eqidd 2230 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → (invr𝑅) = (invr𝑅))
5653, 54, 55, 5invrfvald 14126 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → (invr𝑅) = (invg𝐺))
5756fveq1d 5637 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → ((invr𝑅)‘𝑥) = ((invg𝐺)‘𝑥))
5857eleq1d 2298 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → (((invr𝑅)‘𝑥) ∈ 𝑉 ↔ ((invg𝐺)‘𝑥) ∈ 𝑉))
5952, 58anbi12d 473 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → ((∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉 ∧ ((invr𝑅)‘𝑥) ∈ 𝑉) ↔ (∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉 ∧ ((invg𝐺)‘𝑥) ∈ 𝑉)))
6059ralbidv 2530 . . 3 (𝐴 ∈ (SubRing‘𝑅) → (∀𝑥𝑉 (∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉 ∧ ((invr𝑅)‘𝑥) ∈ 𝑉) ↔ ∀𝑥𝑉 (∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉 ∧ ((invg𝐺)‘𝑥) ∈ 𝑉)))
6136, 60mpbid 147 . 2 (𝐴 ∈ (SubRing‘𝑅) → ∀𝑥𝑉 (∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉 ∧ ((invg𝐺)‘𝑥) ∈ 𝑉))
622, 7unitgrp 14120 . . 3 (𝑅 ∈ Ring → 𝐺 ∈ Grp)
63 eqid 2229 . . . 4 (Base‘𝐺) = (Base‘𝐺)
64 eqid 2229 . . . 4 (+g𝐺) = (+g𝐺)
65 eqid 2229 . . . 4 (invg𝐺) = (invg𝐺)
6663, 64, 65issubg2m 13766 . . 3 (𝐺 ∈ Grp → (𝑉 ∈ (SubGrp‘𝐺) ↔ (𝑉 ⊆ (Base‘𝐺) ∧ ∃𝑤 𝑤𝑉 ∧ ∀𝑥𝑉 (∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉 ∧ ((invg𝐺)‘𝑥) ∈ 𝑉))))
675, 62, 663syl 17 . 2 (𝐴 ∈ (SubRing‘𝑅) → (𝑉 ∈ (SubGrp‘𝐺) ↔ (𝑉 ⊆ (Base‘𝐺) ∧ ∃𝑤 𝑤𝑉 ∧ ∀𝑥𝑉 (∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉 ∧ ((invg𝐺)‘𝑥) ∈ 𝑉))))
6812, 17, 61, 67mpbir3and 1204 1 (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ∈ (SubGrp‘𝐺))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1002   = wceq 1395  wex 1538  wcel 2200  wral 2508  Vcvv 2800  wss 3198   Fn wfn 5319  cfv 5324  (class class class)co 6013  Basecbs 13072  s cress 13073  +gcplusg 13150  .rcmulr 13151  Mndcmnd 13489  Grpcgrp 13573  invgcminusg 13574  SubGrpcsubg 13744  mulGrpcmgp 13923  1rcur 13962  Ringcrg 13999  Unitcui 14090  invrcinvr 14124  SubRingcsubrg 14221
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-addcom 8122  ax-addass 8124  ax-i2m1 8127  ax-0lt1 8128  ax-0id 8130  ax-rnegex 8131  ax-pre-ltirr 8134  ax-pre-lttrn 8136  ax-pre-ltadd 8138
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-tpos 6406  df-pnf 8206  df-mnf 8207  df-ltxr 8209  df-inn 9134  df-2 9192  df-3 9193  df-ndx 13075  df-slot 13076  df-base 13078  df-sets 13079  df-iress 13080  df-plusg 13163  df-mulr 13164  df-0g 13331  df-mgm 13429  df-sgrp 13475  df-mnd 13490  df-grp 13576  df-minusg 13577  df-subg 13747  df-cmn 13863  df-abl 13864  df-mgp 13924  df-ur 13963  df-srg 13967  df-ring 14001  df-oppr 14071  df-dvdsr 14092  df-unit 14093  df-invr 14125  df-subrg 14223
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator