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

Theorem subrgugrp 14253
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 14249 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝑉𝑈)
5 subrgrcl 14239 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
62a1i 9 . . . . 5 (𝑅 ∈ Ring → 𝑈 = (Unit‘𝑅))
7 subrgugrp.4 . . . . . 6 𝐺 = ((mulGrp‘𝑅) ↾s 𝑈)
87a1i 9 . . . . 5 (𝑅 ∈ Ring → 𝐺 = ((mulGrp‘𝑅) ↾s 𝑈))
9 ringsrg 14059 . . . . 5 (𝑅 ∈ Ring → 𝑅 ∈ SRing)
106, 8, 9unitgrpbasd 14128 . . . 4 (𝑅 ∈ Ring → 𝑈 = (Base‘𝐺))
115, 10syl 14 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝑈 = (Base‘𝐺))
124, 11sseqtrd 3265 . 2 (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ⊆ (Base‘𝐺))
131subrgring 14237 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
14 eqid 2231 . . . 4 (1r𝑆) = (1r𝑆)
153, 141unit 14120 . . 3 (𝑆 ∈ Ring → (1r𝑆) ∈ 𝑉)
16 elex2 2819 . . 3 ((1r𝑆) ∈ 𝑉 → ∃𝑤 𝑤𝑉)
1713, 15, 163syl 17 . 2 (𝐴 ∈ (SubRing‘𝑅) → ∃𝑤 𝑤𝑉)
18 eqid 2231 . . . . . . . . . . . 12 (.r𝑅) = (.r𝑅)
191, 18ressmulrg 13227 . . . . . . . . . . 11 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r𝑅) = (.r𝑆))
205, 19mpdan 421 . . . . . . . . . 10 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (.r𝑆))
21203ad2ant1 1044 . . . . . . . . 9 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉𝑦𝑉) → (.r𝑅) = (.r𝑆))
2221oveqd 6034 . . . . . . . 8 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉𝑦𝑉) → (𝑥(.r𝑅)𝑦) = (𝑥(.r𝑆)𝑦))
23 eqid 2231 . . . . . . . . . 10 (.r𝑆) = (.r𝑆)
243, 23unitmulcl 14126 . . . . . . . . 9 ((𝑆 ∈ Ring ∧ 𝑥𝑉𝑦𝑉) → (𝑥(.r𝑆)𝑦) ∈ 𝑉)
2513, 24syl3an1 1306 . . . . . . . 8 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉𝑦𝑉) → (𝑥(.r𝑆)𝑦) ∈ 𝑉)
2622, 25eqeltrd 2308 . . . . . . 7 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉𝑦𝑉) → (𝑥(.r𝑅)𝑦) ∈ 𝑉)
27263expa 1229 . . . . . 6 (((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) ∧ 𝑦𝑉) → (𝑥(.r𝑅)𝑦) ∈ 𝑉)
2827ralrimiva 2605 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) → ∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉)
29 eqid 2231 . . . . . . 7 (invr𝑅) = (invr𝑅)
30 eqid 2231 . . . . . . 7 (invr𝑆) = (invr𝑆)
311, 29, 3, 30subrginv 14250 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) → ((invr𝑅)‘𝑥) = ((invr𝑆)‘𝑥))
323, 30unitinvcl 14136 . . . . . . 7 ((𝑆 ∈ Ring ∧ 𝑥𝑉) → ((invr𝑆)‘𝑥) ∈ 𝑉)
3313, 32sylan 283 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) → ((invr𝑆)‘𝑥) ∈ 𝑉)
3431, 33eqeltrd 2308 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) → ((invr𝑅)‘𝑥) ∈ 𝑉)
3528, 34jca 306 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝑉) → (∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉 ∧ ((invr𝑅)‘𝑥) ∈ 𝑉))
3635ralrimiva 2605 . . 3 (𝐴 ∈ (SubRing‘𝑅) → ∀𝑥𝑉 (∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉 ∧ ((invr𝑅)‘𝑥) ∈ 𝑉))
37 eqid 2231 . . . . . . . . . . 11 (mulGrp‘𝑅) = (mulGrp‘𝑅)
3837, 18mgpplusgg 13936 . . . . . . . . . 10 (𝑅 ∈ Ring → (.r𝑅) = (+g‘(mulGrp‘𝑅)))
39 basfn 13140 . . . . . . . . . . . 12 Base Fn V
40 elex 2814 . . . . . . . . . . . 12 (𝑅 ∈ Ring → 𝑅 ∈ V)
41 funfvex 5656 . . . . . . . . . . . . 13 ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
4241funfni 5432 . . . . . . . . . . . 12 ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
4339, 40, 42sylancr 414 . . . . . . . . . . 11 (𝑅 ∈ Ring → (Base‘𝑅) ∈ V)
44 eqidd 2232 . . . . . . . . . . . 12 (𝑅 ∈ Ring → (Base‘𝑅) = (Base‘𝑅))
4544, 6, 9unitssd 14122 . . . . . . . . . . 11 (𝑅 ∈ Ring → 𝑈 ⊆ (Base‘𝑅))
4643, 45ssexd 4229 . . . . . . . . . 10 (𝑅 ∈ Ring → 𝑈 ∈ V)
4737ringmgp 14014 . . . . . . . . . 10 (𝑅 ∈ Ring → (mulGrp‘𝑅) ∈ Mnd)
488, 38, 46, 47ressplusgd 13211 . . . . . . . . 9 (𝑅 ∈ Ring → (.r𝑅) = (+g𝐺))
495, 48syl 14 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (+g𝐺))
5049oveqd 6034 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → (𝑥(.r𝑅)𝑦) = (𝑥(+g𝐺)𝑦))
5150eleq1d 2300 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → ((𝑥(.r𝑅)𝑦) ∈ 𝑉 ↔ (𝑥(+g𝐺)𝑦) ∈ 𝑉))
5251ralbidv 2532 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → (∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉 ↔ ∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉))
532a1i 9 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → 𝑈 = (Unit‘𝑅))
547a1i 9 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → 𝐺 = ((mulGrp‘𝑅) ↾s 𝑈))
55 eqidd 2232 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → (invr𝑅) = (invr𝑅))
5653, 54, 55, 5invrfvald 14135 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → (invr𝑅) = (invg𝐺))
5756fveq1d 5641 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → ((invr𝑅)‘𝑥) = ((invg𝐺)‘𝑥))
5857eleq1d 2300 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → (((invr𝑅)‘𝑥) ∈ 𝑉 ↔ ((invg𝐺)‘𝑥) ∈ 𝑉))
5952, 58anbi12d 473 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → ((∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉 ∧ ((invr𝑅)‘𝑥) ∈ 𝑉) ↔ (∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉 ∧ ((invg𝐺)‘𝑥) ∈ 𝑉)))
6059ralbidv 2532 . . 3 (𝐴 ∈ (SubRing‘𝑅) → (∀𝑥𝑉 (∀𝑦𝑉 (𝑥(.r𝑅)𝑦) ∈ 𝑉 ∧ ((invr𝑅)‘𝑥) ∈ 𝑉) ↔ ∀𝑥𝑉 (∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉 ∧ ((invg𝐺)‘𝑥) ∈ 𝑉)))
6136, 60mpbid 147 . 2 (𝐴 ∈ (SubRing‘𝑅) → ∀𝑥𝑉 (∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉 ∧ ((invg𝐺)‘𝑥) ∈ 𝑉))
622, 7unitgrp 14129 . . 3 (𝑅 ∈ Ring → 𝐺 ∈ Grp)
63 eqid 2231 . . . 4 (Base‘𝐺) = (Base‘𝐺)
64 eqid 2231 . . . 4 (+g𝐺) = (+g𝐺)
65 eqid 2231 . . . 4 (invg𝐺) = (invg𝐺)
6663, 64, 65issubg2m 13775 . . 3 (𝐺 ∈ Grp → (𝑉 ∈ (SubGrp‘𝐺) ↔ (𝑉 ⊆ (Base‘𝐺) ∧ ∃𝑤 𝑤𝑉 ∧ ∀𝑥𝑉 (∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉 ∧ ((invg𝐺)‘𝑥) ∈ 𝑉))))
675, 62, 663syl 17 . 2 (𝐴 ∈ (SubRing‘𝑅) → (𝑉 ∈ (SubGrp‘𝐺) ↔ (𝑉 ⊆ (Base‘𝐺) ∧ ∃𝑤 𝑤𝑉 ∧ ∀𝑥𝑉 (∀𝑦𝑉 (𝑥(+g𝐺)𝑦) ∈ 𝑉 ∧ ((invg𝐺)‘𝑥) ∈ 𝑉))))
6812, 17, 61, 67mpbir3and 1206 1 (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ∈ (SubGrp‘𝐺))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1004   = wceq 1397  wex 1540  wcel 2202  wral 2510  Vcvv 2802  wss 3200   Fn wfn 5321  cfv 5326  (class class class)co 6017  Basecbs 13081  s cress 13082  +gcplusg 13159  .rcmulr 13160  Mndcmnd 13498  Grpcgrp 13582  invgcminusg 13583  SubGrpcsubg 13753  mulGrpcmgp 13932  1rcur 13971  Ringcrg 14008  Unitcui 14099  invrcinvr 14133  SubRingcsubrg 14230
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-pre-ltirr 8143  ax-pre-lttrn 8145  ax-pre-ltadd 8147
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-tpos 6410  df-pnf 8215  df-mnf 8216  df-ltxr 8218  df-inn 9143  df-2 9201  df-3 9202  df-ndx 13084  df-slot 13085  df-base 13087  df-sets 13088  df-iress 13089  df-plusg 13172  df-mulr 13173  df-0g 13340  df-mgm 13438  df-sgrp 13484  df-mnd 13499  df-grp 13585  df-minusg 13586  df-subg 13756  df-cmn 13872  df-abl 13873  df-mgp 13933  df-ur 13972  df-srg 13976  df-ring 14010  df-oppr 14080  df-dvdsr 14101  df-unit 14102  df-invr 14134  df-subrg 14232
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator