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

Theorem subrgdv 13737
Description: A subring always has the same division function, for elements that are invertible. (Contributed by Mario Carneiro, 4-Dec-2014.)
Hypotheses
Ref Expression
subrgdv.1 𝑆 = (𝑅s 𝐴)
subrgdv.2 / = (/r𝑅)
subrgdv.3 𝑈 = (Unit‘𝑆)
subrgdv.4 𝐸 = (/r𝑆)
Assertion
Ref Expression
subrgdv ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋 / 𝑌) = (𝑋𝐸𝑌))

Proof of Theorem subrgdv
StepHypRef Expression
1 subrgdv.1 . . . . . 6 𝑆 = (𝑅s 𝐴)
2 eqid 2193 . . . . . 6 (invr𝑅) = (invr𝑅)
3 subrgdv.3 . . . . . 6 𝑈 = (Unit‘𝑆)
4 eqid 2193 . . . . . 6 (invr𝑆) = (invr𝑆)
51, 2, 3, 4subrginv 13736 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑌𝑈) → ((invr𝑅)‘𝑌) = ((invr𝑆)‘𝑌))
653adant2 1018 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → ((invr𝑅)‘𝑌) = ((invr𝑆)‘𝑌))
76oveq2d 5935 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋(.r𝑅)((invr𝑅)‘𝑌)) = (𝑋(.r𝑅)((invr𝑆)‘𝑌)))
8 subrgrcl 13725 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
9 eqid 2193 . . . . . . 7 (.r𝑅) = (.r𝑅)
101, 9ressmulrg 12765 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r𝑅) = (.r𝑆))
118, 10mpdan 421 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (.r𝑆))
12113ad2ant1 1020 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (.r𝑅) = (.r𝑆))
1312oveqd 5936 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋(.r𝑅)((invr𝑆)‘𝑌)) = (𝑋(.r𝑆)((invr𝑆)‘𝑌)))
147, 13eqtrd 2226 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋(.r𝑅)((invr𝑅)‘𝑌)) = (𝑋(.r𝑆)((invr𝑆)‘𝑌)))
15 eqidd 2194 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (Base‘𝑅) = (Base‘𝑅))
16 eqidd 2194 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (.r𝑅) = (.r𝑅))
17 eqidd 2194 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (Unit‘𝑅) = (Unit‘𝑅))
18 eqidd 2194 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (invr𝑅) = (invr𝑅))
19 subrgdv.2 . . . 4 / = (/r𝑅)
2019a1i 9 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → / = (/r𝑅))
2183ad2ant1 1020 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑅 ∈ Ring)
22 eqid 2193 . . . . . 6 (Base‘𝑅) = (Base‘𝑅)
2322subrgss 13721 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
24233ad2ant1 1020 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝐴 ⊆ (Base‘𝑅))
25 simp2 1000 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑋𝐴)
2624, 25sseldd 3181 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑋 ∈ (Base‘𝑅))
27 eqid 2193 . . . . . 6 (Unit‘𝑅) = (Unit‘𝑅)
281, 27, 3subrguss 13735 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝑈 ⊆ (Unit‘𝑅))
29283ad2ant1 1020 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑈 ⊆ (Unit‘𝑅))
30 simp3 1001 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑌𝑈)
3129, 30sseldd 3181 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑌 ∈ (Unit‘𝑅))
3215, 16, 17, 18, 20, 21, 26, 31dvrvald 13633 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋 / 𝑌) = (𝑋(.r𝑅)((invr𝑅)‘𝑌)))
33 eqidd 2194 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (Base‘𝑆) = (Base‘𝑆))
34 eqidd 2194 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (.r𝑆) = (.r𝑆))
353a1i 9 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑈 = (Unit‘𝑆))
36 eqidd 2194 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (invr𝑆) = (invr𝑆))
37 subrgdv.4 . . . 4 𝐸 = (/r𝑆)
3837a1i 9 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝐸 = (/r𝑆))
391subrgring 13723 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
40393ad2ant1 1020 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑆 ∈ Ring)
411subrgbas 13729 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
42413ad2ant1 1020 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝐴 = (Base‘𝑆))
4325, 42eleqtrd 2272 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑋 ∈ (Base‘𝑆))
4433, 34, 35, 36, 38, 40, 43, 30dvrvald 13633 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋𝐸𝑌) = (𝑋(.r𝑆)((invr𝑆)‘𝑌)))
4514, 32, 443eqtr4d 2236 1 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋 / 𝑌) = (𝑋𝐸𝑌))
Colors of variables: wff set class
Syntax hints:  wi 4  w3a 980   = wceq 1364  wcel 2164  wss 3154  cfv 5255  (class class class)co 5919  Basecbs 12621  s cress 12622  .rcmulr 12699  Ringcrg 13495  Unitcui 13586  invrcinvr 13619  /rcdvr 13630  SubRingcsubrg 13716
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-nul 4156  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-1cn 7967  ax-1re 7968  ax-icn 7969  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-addcom 7974  ax-addass 7976  ax-i2m1 7979  ax-0lt1 7980  ax-0id 7982  ax-rnegex 7983  ax-pre-ltirr 7986  ax-pre-lttrn 7988  ax-pre-ltadd 7990
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-tpos 6300  df-pnf 8058  df-mnf 8059  df-ltxr 8061  df-inn 8985  df-2 9043  df-3 9044  df-ndx 12624  df-slot 12625  df-base 12627  df-sets 12628  df-iress 12629  df-plusg 12711  df-mulr 12712  df-0g 12872  df-mgm 12942  df-sgrp 12988  df-mnd 13001  df-grp 13078  df-minusg 13079  df-subg 13243  df-cmn 13359  df-abl 13360  df-mgp 13420  df-ur 13459  df-srg 13463  df-ring 13497  df-oppr 13567  df-dvdsr 13588  df-unit 13589  df-invr 13620  df-dvr 13631  df-subrg 13718
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator