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

Theorem subrgugrp 14657
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 14653 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ⊆ 𝑈)
5 subrgrcl 14643 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
62a1i 9 . . . . 5 (𝑅 ∈ Ring → 𝑈 = (Unit‘𝑅))
7 subrgugrp.4 . . . . . 6 𝐺 = ((mulGrp‘𝑅) ↾s 𝑈)
87a1i 9 . . . . 5 (𝑅 ∈ Ring → 𝐺 = ((mulGrp‘𝑅) ↾s 𝑈))
9 ringsrg 14459 . . . . 5 (𝑅 ∈ Ring → 𝑅 ∈ SRing)
106, 8, 9unitgrpbasd 14531 . . . 4 (𝑅 ∈ Ring → 𝑈 = (Base‘𝐺))
115, 10syl 14 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝑈 = (Base‘𝐺))
124, 11sseqtrd 3286 . 2 (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ⊆ (Base‘𝐺))
131subrgring 14641 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
14 eqid 2238 . . . 4 (1r‘𝑆) = (1r‘𝑆)
153, 141unit 14523 . . 3 (𝑆 ∈ Ring → (1r‘𝑆) ∈ 𝑉)
16 elex2 2838 . . 3 ((1r‘𝑆) ∈ 𝑉 → ∃𝑤 𝑤 ∈ 𝑉)
1713, 15, 163syl 17 . 2 (𝐴 ∈ (SubRing‘𝑅) → ∃𝑤 𝑤 ∈ 𝑉)
18 eqid 2238 . . . . . . . . . . . 12 (.r‘𝑅) = (.r‘𝑅)
191, 18ressmulrg 13558 . . . . . . . . . . 11 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r‘𝑅) = (.r‘𝑆))
205, 19mpdan 425 . . . . . . . . . 10 (𝐴 ∈ (SubRing‘𝑅) → (.r‘𝑅) = (.r‘𝑆))
21203ad2ant1 1049 . . . . . . . . 9 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (.r‘𝑅) = (.r‘𝑆))
2221oveqd 6105 . . . . . . . 8 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝑥(.r‘𝑅)𝑦) = (𝑥(.r‘𝑆)𝑦))
23 eqid 2238 . . . . . . . . . 10 (.r‘𝑆) = (.r‘𝑆)
243, 23unitmulcl 14529 . . . . . . . . 9 ((𝑆 ∈ Ring ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝑥(.r‘𝑆)𝑦) ∈ 𝑉)
2513, 24syl3an1 1311 . . . . . . . 8 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝑥(.r‘𝑆)𝑦) ∈ 𝑉)
2622, 25eqeltrd 2315 . . . . . . 7 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝑥(.r‘𝑅)𝑦) ∈ 𝑉)
27263expa 1234 . . . . . 6 (((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) ∧ 𝑦 ∈ 𝑉) → (𝑥(.r‘𝑅)𝑦) ∈ 𝑉)
2827ralrimiva 2623 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → ∀𝑦 ∈ 𝑉 (𝑥(.r‘𝑅)𝑦) ∈ 𝑉)
29 eqid 2238 . . . . . . 7 (invr‘𝑅) = (invr‘𝑅)
30 eqid 2238 . . . . . . 7 (invr‘𝑆) = (invr‘𝑆)
311, 29, 3, 30subrginv 14654 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑅)‘𝑥) = ((invr‘𝑆)‘𝑥))
323, 30unitinvcl 14539 . . . . . . 7 ((𝑆 ∈ Ring ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑆)‘𝑥) ∈ 𝑉)
3313, 32sylan 283 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑆)‘𝑥) ∈ 𝑉)
3431, 33eqeltrd 2315 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑅)‘𝑥) ∈ 𝑉)
3528, 34jca 306 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (∀𝑦 ∈ 𝑉 (𝑥(.r‘𝑅)𝑦) ∈ 𝑉 ∧ ((invr‘𝑅)‘𝑥) ∈ 𝑉))
3635ralrimiva 2623 . . 3 (𝐴 ∈ (SubRing‘𝑅) → ∀𝑥 ∈ 𝑉 (∀𝑦 ∈ 𝑉 (𝑥(.r‘𝑅)𝑦) ∈ 𝑉 ∧ ((invr‘𝑅)‘𝑥) ∈ 𝑉))
37 eqid 2238 . . . . . . . . . . 11 (mulGrp‘𝑅) = (mulGrp‘𝑅)
3837, 18mgpplusgg 14328 . . . . . . . . . 10 (𝑅 ∈ Ring → (.r‘𝑅) = (+g‘(mulGrp‘𝑅)))
39 basfn 13469 . . . . . . . . . . . 12 Base Fn V
40 elex 2833 . . . . . . . . . . . 12 (𝑅 ∈ Ring → 𝑅 ∈ V)
41 funfvex 5715 . . . . . . . . . . . . 13 ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
4241funfni 5486 . . . . . . . . . . . 12 ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
4339, 40, 42sylancr 418 . . . . . . . . . . 11 (𝑅 ∈ Ring → (Base‘𝑅) ∈ V)
44 eqidd 2239 . . . . . . . . . . . 12 (𝑅 ∈ Ring → (Base‘𝑅) = (Base‘𝑅))
4544, 6, 9unitssd 14525 . . . . . . . . . . 11 (𝑅 ∈ Ring → 𝑈 ⊆ (Base‘𝑅))
4643, 45ssexd 4275 . . . . . . . . . 10 (𝑅 ∈ Ring → 𝑈 ∈ V)
4737ringmgp 14413 . . . . . . . . . 10 (𝑅 ∈ Ring → (mulGrp‘𝑅) ∈ Mnd)
488, 38, 46, 47ressplusgd 13542 . . . . . . . . 9 (𝑅 ∈ Ring → (.r‘𝑅) = (+g‘𝐺))
495, 48syl 14 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → (.r‘𝑅) = (+g‘𝐺))
5049oveqd 6105 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → (𝑥(.r‘𝑅)𝑦) = (𝑥(+g‘𝐺)𝑦))
5150eleq1d 2307 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → ((𝑥(.r‘𝑅)𝑦) ∈ 𝑉 ↔ (𝑥(+g‘𝐺)𝑦) ∈ 𝑉))
5251ralbidv 2550 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → (∀𝑦 ∈ 𝑉 (𝑥(.r‘𝑅)𝑦) ∈ 𝑉 ↔ ∀𝑦 ∈ 𝑉 (𝑥(+g‘𝐺)𝑦) ∈ 𝑉))
532a1i 9 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → 𝑈 = (Unit‘𝑅))
547a1i 9 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → 𝐺 = ((mulGrp‘𝑅) ↾s 𝑈))
55 eqidd 2239 . . . . . . . 8 (𝐴 ∈ (SubRing‘𝑅) → (invr‘𝑅) = (invr‘𝑅))
5653, 54, 55, 5invrfvald 14538 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → (invr‘𝑅) = (invg‘𝐺))
5756fveq1d 5700 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → ((invr‘𝑅)‘𝑥) = ((invg‘𝐺)‘𝑥))
5857eleq1d 2307 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → (((invr‘𝑅)‘𝑥) ∈ 𝑉 ↔ ((invg‘𝐺)‘𝑥) ∈ 𝑉))
5952, 58anbi12d 477 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → ((∀𝑦 ∈ 𝑉 (𝑥(.r‘𝑅)𝑦) ∈ 𝑉 ∧ ((invr‘𝑅)‘𝑥) ∈ 𝑉) ↔ (∀𝑦 ∈ 𝑉 (𝑥(+g‘𝐺)𝑦) ∈ 𝑉 ∧ ((invg‘𝐺)‘𝑥) ∈ 𝑉)))
6059ralbidv 2550 . . 3 (𝐴 ∈ (SubRing‘𝑅) → (∀𝑥 ∈ 𝑉 (∀𝑦 ∈ 𝑉 (𝑥(.r‘𝑅)𝑦) ∈ 𝑉 ∧ ((invr‘𝑅)‘𝑥) ∈ 𝑉) ↔ ∀𝑥 ∈ 𝑉 (∀𝑦 ∈ 𝑉 (𝑥(+g‘𝐺)𝑦) ∈ 𝑉 ∧ ((invg‘𝐺)‘𝑥) ∈ 𝑉)))
6136, 60mpbid 147 . 2 (𝐴 ∈ (SubRing‘𝑅) → ∀𝑥 ∈ 𝑉 (∀𝑦 ∈ 𝑉 (𝑥(+g‘𝐺)𝑦) ∈ 𝑉 ∧ ((invg‘𝐺)‘𝑥) ∈ 𝑉))
622, 7unitgrp 14532 . . 3 (𝑅 ∈ Ring → 𝐺 ∈ Grp)
63 eqid 2238 . . . 4 (Base‘𝐺) = (Base‘𝐺)
64 eqid 2238 . . . 4 (+g‘𝐺) = (+g‘𝐺)
65 eqid 2238 . . . 4 (invg‘𝐺) = (invg‘𝐺)
6663, 64, 65issubg2m 14051 . . 3 (𝐺 ∈ Grp → (𝑉 ∈ (SubGrp‘𝐺) ↔ (𝑉 ⊆ (Base‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝑉 (∀𝑦 ∈ 𝑉 (𝑥(+g‘𝐺)𝑦) ∈ 𝑉 ∧ ((invg‘𝐺)‘𝑥) ∈ 𝑉))))
675, 62, 663syl 17 . 2 (𝐴 ∈ (SubRing‘𝑅) → (𝑉 ∈ (SubGrp‘𝐺) ↔ (𝑉 ⊆ (Base‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝑉 (∀𝑦 ∈ 𝑉 (𝑥(+g‘𝐺)𝑦) ∈ 𝑉 ∧ ((invg‘𝐺)‘𝑥) ∈ 𝑉))))
6812, 17, 61, 67mpbir3and 1211 1 (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ∈ (SubGrp‘𝐺))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1009   = wceq 1402  ∃wex 1545   ∈ wcel 2209  ∀wral 2528  Vcvv 2821   ⊆ wss 3220   Fn wfn 5375  ‘cfv 5380  (class class class)co 6088  Basecbs 13410   ↾s cress 13411  +gcplusg 13490  .rcmulr 13491  Mndcmnd 13788  Grpcgrp 13864  invgcminusg 13865  SubGrpcsubg 14029  mulGrpcmgp 14324  1rcur 14369  Ringcrg 14407  Unitcui 14502  invrcinvr 14536  SubRingcsubrg 14634
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-pre-ltirr 8297  ax-pre-lttrn 8299  ax-pre-ltadd 8301
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-tpos 6520  df-pnf 8368  df-mnf 8369  df-ltxr 8371  df-inn 9314  df-2 9372  df-3 9373  df-ndx 13413  df-slot 13414  df-base 13416  df-sets 13417  df-iress 13418  df-plusg 13503  df-mulr 13504  df-0g 13671  df-mgm 13735  df-sgrp 13776  df-mnd 13789  df-grp 13867  df-minusg 13868  df-subg 14032  df-cmn 14179  df-abl 14180  df-mgp 14325  df-ur 14370  df-srg 14375  df-ring 14409  df-oppr 14482  df-dvdsr 14504  df-unit 14505  df-invr 14537  df-subrg 14636
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator