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

Theorem subrgunit 14657
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 14654 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ⊆ 𝑈)
54sselda 3248 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ 𝑈)
61subrgbas 14648 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
76adantr 276 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝐴 = (Base‘𝑆))
83a1i 9 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝑉 = (Unit‘𝑆))
91subrgring 14642 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
10 ringsrg 14460 . . . . . 6 (𝑆 ∈ Ring → 𝑆 ∈ SRing)
119, 10syl 14 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ SRing)
1211adantr 276 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝑆 ∈ SRing)
13 simpr 110 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ 𝑉)
147, 8, 12, 13unitcld 14525 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ 𝐴)
15 eqid 2238 . . . . . 6 (invr‘𝑆) = (invr‘𝑆)
16 eqid 2238 . . . . . 6 (Base‘𝑆) = (Base‘𝑆)
173, 15, 16ringinvcl 14542 . . . . 5 ((𝑆 ∈ Ring ∧ 𝑋 ∈ 𝑉) → ((invr‘𝑆)‘𝑋) ∈ (Base‘𝑆))
189, 17sylan 283 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → ((invr‘𝑆)‘𝑋) ∈ (Base‘𝑆))
19 subrgunit.4 . . . . 5 𝐼 = (invr‘𝑅)
201, 19, 3, 15subrginv 14655 . . . 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 14513 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋(∥r‘𝑆)((𝐼‘𝑋)(.r‘𝑆)𝑋))
33 subrgrcl 14644 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
34 simpr1 1034 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋 ∈ 𝑈)
35 eqid 2238 . . . . . . 7 (.r‘𝑅) = (.r‘𝑅)
36 eqid 2238 . . . . . . 7 (1r‘𝑅) = (1r‘𝑅)
372, 19, 35, 36unitlinv 14543 . . . . . 6 ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → ((𝐼‘𝑋)(.r‘𝑅)𝑋) = (1r‘𝑅))
3833, 34, 37syl2an2r 603 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘𝑅)𝑋) = (1r‘𝑅))
391, 35ressmulrg 13559 . . . . . . . 8 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r‘𝑅) = (.r‘𝑆))
4033, 39mpdan 425 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → (.r‘𝑅) = (.r‘𝑆))
4140adantr 276 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (.r‘𝑅) = (.r‘𝑆))
4241oveqd 6105 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘𝑅)𝑋) = ((𝐼‘𝑋)(.r‘𝑆)𝑋))
431, 36subrg1 14649 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) = (1r‘𝑆))
4443adantr 276 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (1r‘𝑅) = (1r‘𝑆))
4538, 42, 443eqtr3d 2279 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘𝑆)𝑋) = (1r‘𝑆))
4632, 45breqtrd 4157 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋(∥r‘𝑆)(1r‘𝑆))
479adantr 276 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑆 ∈ Ring)
48 eqid 2238 . . . . . . 7 (oppr‘𝑆) = (oppr‘𝑆)
4948, 16opprbasg 14490 . . . . . 6 (𝑆 ∈ Ring → (Base‘𝑆) = (Base‘(oppr‘𝑆)))
5047, 49syl 14 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (Base‘𝑆) = (Base‘(oppr‘𝑆)))
51 eqidd 2239 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (∥r‘(oppr‘𝑆)) = (∥r‘(oppr‘𝑆)))
5248opprring 14494 . . . . . 6 (𝑆 ∈ Ring → (oppr‘𝑆) ∈ Ring)
53 ringsrg 14460 . . . . . 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 14513 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋(∥r‘(oppr‘𝑆))((𝐼‘𝑋)(.r‘(oppr‘𝑆))𝑋))
57 eqid 2238 . . . . . . 7 (.r‘𝑆) = (.r‘𝑆)
58 eqid 2238 . . . . . . 7 (.r‘(oppr‘𝑆)) = (.r‘(oppr‘𝑆))
5916, 57, 48, 58opprmulg 14486 . . . . . 6 ((𝑆 ∈ Ring ∧ (𝐼‘𝑋) ∈ (Base‘𝑆) ∧ 𝑋 ∈ (Base‘𝑆)) → ((𝐼‘𝑋)(.r‘(oppr‘𝑆))𝑋) = (𝑋(.r‘𝑆)(𝐼‘𝑋)))
6047, 31, 29, 59syl3anc 1278 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘(oppr‘𝑆))𝑋) = (𝑋(.r‘𝑆)(𝐼‘𝑋)))
612, 19, 35, 36unitrinv 14544 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅))
6233, 34, 61syl2an2r 603 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅))
6341oveqd 6105 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (𝑋(.r‘𝑆)(𝐼‘𝑋)))
6462, 63, 443eqtr3d 2279 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝑋(.r‘𝑆)(𝐼‘𝑋)) = (1r‘𝑆))
6560, 64eqtrd 2271 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘(oppr‘𝑆))𝑋) = (1r‘𝑆))
6656, 65breqtrd 4157 . . 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 14523 . . . 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 4131  ‘cfv 5380  (class class class)co 6088  Basecbs 13411   ↾s cress 13412  .rcmulr 13492  1rcur 14370  SRingcsrg 14375  Ringcrg 14408  opprcoppr 14482  ∥rcdsr 14502  Unitcui 14503  invrcinvr 14537  SubRingcsubrg 14635
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 8277  ax-resscn 8278  ax-1cn 8279  ax-1re 8280  ax-icn 8281  ax-addcl 8282  ax-addrcl 8283  ax-mulcl 8284  ax-addcom 8286  ax-addass 8288  ax-i2m1 8291  ax-0lt1 8292  ax-0id 8294  ax-rnegex 8295  ax-pre-ltirr 8298  ax-pre-lttrn 8300  ax-pre-ltadd 8302
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 8369  df-mnf 8370  df-ltxr 8372  df-inn 9315  df-2 9373  df-3 9374  df-ndx 13414  df-slot 13415  df-base 13417  df-sets 13418  df-iress 13419  df-plusg 13504  df-mulr 13505  df-0g 13672  df-mgm 13736  df-sgrp 13777  df-mnd 13790  df-grp 13868  df-minusg 13869  df-subg 14033  df-cmn 14180  df-abl 14181  df-mgp 14326  df-ur 14371  df-srg 14376  df-ring 14410  df-oppr 14483  df-dvdsr 14505  df-unit 14506  df-invr 14538  df-subrg 14637
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator