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

Theorem subrgunit 14631
Description: An element of a ring is a unit of a subring iff it is a unit of the parent ring and both it and its inverse are in the subring. (Contributed by Mario Carneiro, 4-Dec-2014.)
Hypotheses
Ref Expression
subrgugrp.1 𝑆 = (𝑅 ↾s 𝐴)
subrgugrp.2 𝑈 = (Unit‘𝑅)
subrgugrp.3 𝑉 = (Unit‘𝑆)
subrgunit.4 𝐼 = (invr‘𝑅)
Assertion
Ref Expression
subrgunit (𝐴 ∈ (SubRing‘𝑅) → (𝑋 ∈ 𝑉 ↔ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)))

Proof of Theorem subrgunit
StepHypRef Expression
1 subrgugrp.1 . . . . 5 𝑆 = (𝑅 ↾s 𝐴)
2 subrgugrp.2 . . . . 5 𝑈 = (Unit‘𝑅)
3 subrgugrp.3 . . . . 5 𝑉 = (Unit‘𝑆)
41, 2, 3subrguss 14628 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ⊆ 𝑈)
54sselda 3248 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ 𝑈)
61subrgbas 14622 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
76adantr 276 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝐴 = (Base‘𝑆))
83a1i 9 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝑉 = (Unit‘𝑆))
91subrgring 14616 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
10 ringsrg 14436 . . . . . 6 (𝑆 ∈ Ring → 𝑆 ∈ SRing)
119, 10syl 14 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ SRing)
1211adantr 276 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝑆 ∈ SRing)
13 simpr 110 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ 𝑉)
147, 8, 12, 13unitcld 14499 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ 𝐴)
15 eqid 2238 . . . . . 6 (invr‘𝑆) = (invr‘𝑆)
16 eqid 2238 . . . . . 6 (Base‘𝑆) = (Base‘𝑆)
173, 15, 16ringinvcl 14516 . . . . 5 ((𝑆 ∈ Ring ∧ 𝑋 ∈ 𝑉) → ((invr‘𝑆)‘𝑋) ∈ (Base‘𝑆))
189, 17sylan 283 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → ((invr‘𝑆)‘𝑋) ∈ (Base‘𝑆))
19 subrgunit.4 . . . . 5 𝐼 = (invr‘𝑅)
201, 19, 3, 15subrginv 14629 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → (𝐼‘𝑋) = ((invr‘𝑆)‘𝑋))
2118, 20, 73eltr4d 2322 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → (𝐼‘𝑋) ∈ 𝐴)
225, 14, 213jca 1208 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴))
23 eqidd 2239 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (Base‘𝑆) = (Base‘𝑆))
24 eqidd 2239 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (∥r‘𝑆) = (∥r‘𝑆))
2511adantr 276 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑆 ∈ SRing)
26 eqidd 2239 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (.r‘𝑆) = (.r‘𝑆))
27 simpr2 1035 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋 ∈ 𝐴)
286adantr 276 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝐴 = (Base‘𝑆))
2927, 28eleqtrd 2317 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋 ∈ (Base‘𝑆))
30 simpr3 1036 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝐼‘𝑋) ∈ 𝐴)
3130, 28eleqtrd 2317 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝐼‘𝑋) ∈ (Base‘𝑆))
3223, 24, 25, 26, 29, 31dvdsrmuld 14487 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋(∥r‘𝑆)((𝐼‘𝑋)(.r‘𝑆)𝑋))
33 subrgrcl 14618 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
34 simpr1 1034 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋 ∈ 𝑈)
35 eqid 2238 . . . . . . 7 (.r‘𝑅) = (.r‘𝑅)
36 eqid 2238 . . . . . . 7 (1r‘𝑅) = (1r‘𝑅)
372, 19, 35, 36unitlinv 14517 . . . . . 6 ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → ((𝐼‘𝑋)(.r‘𝑅)𝑋) = (1r‘𝑅))
3833, 34, 37syl2an2r 603 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘𝑅)𝑋) = (1r‘𝑅))
391, 35ressmulrg 13552 . . . . . . . 8 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r‘𝑅) = (.r‘𝑆))
4033, 39mpdan 425 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → (.r‘𝑅) = (.r‘𝑆))
4140adantr 276 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (.r‘𝑅) = (.r‘𝑆))
4241oveqd 6102 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘𝑅)𝑋) = ((𝐼‘𝑋)(.r‘𝑆)𝑋))
431, 36subrg1 14623 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) = (1r‘𝑆))
4443adantr 276 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (1r‘𝑅) = (1r‘𝑆))
4538, 42, 443eqtr3d 2279 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘𝑆)𝑋) = (1r‘𝑆))
4632, 45breqtrd 4156 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋(∥r‘𝑆)(1r‘𝑆))
479adantr 276 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑆 ∈ Ring)
48 eqid 2238 . . . . . . 7 (oppr‘𝑆) = (oppr‘𝑆)
4948, 16opprbasg 14464 . . . . . 6 (𝑆 ∈ Ring → (Base‘𝑆) = (Base‘(oppr‘𝑆)))
5047, 49syl 14 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (Base‘𝑆) = (Base‘(oppr‘𝑆)))
51 eqidd 2239 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (∥r‘(oppr‘𝑆)) = (∥r‘(oppr‘𝑆)))
5248opprring 14468 . . . . . 6 (𝑆 ∈ Ring → (oppr‘𝑆) ∈ Ring)
53 ringsrg 14436 . . . . . 6 ((oppr‘𝑆) ∈ Ring → (oppr‘𝑆) ∈ SRing)
5447, 52, 533syl 17 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (oppr‘𝑆) ∈ SRing)
55 eqidd 2239 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (.r‘(oppr‘𝑆)) = (.r‘(oppr‘𝑆)))
5650, 51, 54, 55, 29, 31dvdsrmuld 14487 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋(∥r‘(oppr‘𝑆))((𝐼‘𝑋)(.r‘(oppr‘𝑆))𝑋))
57 eqid 2238 . . . . . . 7 (.r‘𝑆) = (.r‘𝑆)
58 eqid 2238 . . . . . . 7 (.r‘(oppr‘𝑆)) = (.r‘(oppr‘𝑆))
5916, 57, 48, 58opprmulg 14460 . . . . . 6 ((𝑆 ∈ Ring ∧ (𝐼‘𝑋) ∈ (Base‘𝑆) ∧ 𝑋 ∈ (Base‘𝑆)) → ((𝐼‘𝑋)(.r‘(oppr‘𝑆))𝑋) = (𝑋(.r‘𝑆)(𝐼‘𝑋)))
6047, 31, 29, 59syl3anc 1278 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘(oppr‘𝑆))𝑋) = (𝑋(.r‘𝑆)(𝐼‘𝑋)))
612, 19, 35, 36unitrinv 14518 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅))
6233, 34, 61syl2an2r 603 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅))
6341oveqd 6102 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (𝑋(.r‘𝑆)(𝐼‘𝑋)))
6462, 63, 443eqtr3d 2279 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝑋(.r‘𝑆)(𝐼‘𝑋)) = (1r‘𝑆))
6560, 64eqtrd 2271 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘(oppr‘𝑆))𝑋) = (1r‘𝑆))
6656, 65breqtrd 4156 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋(∥r‘(oppr‘𝑆))(1r‘𝑆))
673a1i 9 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝑉 = (Unit‘𝑆))
68 eqidd 2239 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑆) = (1r‘𝑆))
69 eqidd 2239 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → (∥r‘𝑆) = (∥r‘𝑆))
70 eqidd 2239 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → (oppr‘𝑆) = (oppr‘𝑆))
71 eqidd 2239 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → (∥r‘(oppr‘𝑆)) = (∥r‘(oppr‘𝑆)))
7267, 68, 69, 70, 71, 11isunitd 14497 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → (𝑋 ∈ 𝑉 ↔ (𝑋(∥r‘𝑆)(1r‘𝑆) ∧ 𝑋(∥r‘(oppr‘𝑆))(1r‘𝑆))))
7372adantr 276 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝑋 ∈ 𝑉 ↔ (𝑋(∥r‘𝑆)(1r‘𝑆) ∧ 𝑋(∥r‘(oppr‘𝑆))(1r‘𝑆))))
7446, 66, 73mpbir2and 957 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋 ∈ 𝑉)
7522, 74impbida 604 1 (𝐴 ∈ (SubRing‘𝑅) → (𝑋 ∈ 𝑉 ↔ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209   class class class wbr 4130  ‘cfv 5377  (class class class)co 6085  Basecbs 13404   ↾s cress 13405  .rcmulr 13485  1rcur 14346  SRingcsrg 14351  Ringcrg 14384  opprcoppr 14456  ∥rcdsr 14476  Unitcui 14477  invrcinvr 14511  SubRingcsubrg 14609
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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-i2m1 8285  ax-0lt1 8286  ax-0id 8288  ax-rnegex 8289  ax-pre-ltirr 8292  ax-pre-lttrn 8294  ax-pre-ltadd 8296
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 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-tpos 6516  df-pnf 8363  df-mnf 8364  df-ltxr 8366  df-inn 9308  df-2 9366  df-3 9367  df-ndx 13407  df-slot 13408  df-base 13410  df-sets 13411  df-iress 13412  df-plusg 13497  df-mulr 13498  df-0g 13665  df-mgm 13729  df-sgrp 13770  df-mnd 13783  df-grp 13861  df-minusg 13862  df-subg 14026  df-cmn 14173  df-abl 14174  df-mgp 14302  df-ur 14347  df-srg 14352  df-ring 14386  df-oppr 14457  df-dvdsr 14479  df-unit 14480  df-invr 14512  df-subrg 14611
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator