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

Theorem subrgdv 13364
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 2177 . . . . . 6 (invr𝑅) = (invr𝑅)
3 subrgdv.3 . . . . . 6 𝑈 = (Unit‘𝑆)
4 eqid 2177 . . . . . 6 (invr𝑆) = (invr𝑆)
51, 2, 3, 4subrginv 13363 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑌𝑈) → ((invr𝑅)‘𝑌) = ((invr𝑆)‘𝑌))
653adant2 1016 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → ((invr𝑅)‘𝑌) = ((invr𝑆)‘𝑌))
76oveq2d 5893 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋(.r𝑅)((invr𝑅)‘𝑌)) = (𝑋(.r𝑅)((invr𝑆)‘𝑌)))
8 subrgrcl 13352 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
9 eqid 2177 . . . . . . 7 (.r𝑅) = (.r𝑅)
101, 9ressmulrg 12605 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r𝑅) = (.r𝑆))
118, 10mpdan 421 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (.r𝑆))
12113ad2ant1 1018 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (.r𝑅) = (.r𝑆))
1312oveqd 5894 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋(.r𝑅)((invr𝑆)‘𝑌)) = (𝑋(.r𝑆)((invr𝑆)‘𝑌)))
147, 13eqtrd 2210 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋(.r𝑅)((invr𝑅)‘𝑌)) = (𝑋(.r𝑆)((invr𝑆)‘𝑌)))
15 eqidd 2178 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (Base‘𝑅) = (Base‘𝑅))
16 eqidd 2178 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (.r𝑅) = (.r𝑅))
17 eqidd 2178 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (Unit‘𝑅) = (Unit‘𝑅))
18 eqidd 2178 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (invr𝑅) = (invr𝑅))
19 subrgdv.2 . . . 4 / = (/r𝑅)
2019a1i 9 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → / = (/r𝑅))
2183ad2ant1 1018 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑅 ∈ Ring)
22 eqid 2177 . . . . . 6 (Base‘𝑅) = (Base‘𝑅)
2322subrgss 13348 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
24233ad2ant1 1018 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝐴 ⊆ (Base‘𝑅))
25 simp2 998 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑋𝐴)
2624, 25sseldd 3158 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑋 ∈ (Base‘𝑅))
27 eqid 2177 . . . . . 6 (Unit‘𝑅) = (Unit‘𝑅)
281, 27, 3subrguss 13362 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝑈 ⊆ (Unit‘𝑅))
29283ad2ant1 1018 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑈 ⊆ (Unit‘𝑅))
30 simp3 999 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑌𝑈)
3129, 30sseldd 3158 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑌 ∈ (Unit‘𝑅))
3215, 16, 17, 18, 20, 21, 26, 31dvrvald 13308 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋 / 𝑌) = (𝑋(.r𝑅)((invr𝑅)‘𝑌)))
33 eqidd 2178 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (Base‘𝑆) = (Base‘𝑆))
34 eqidd 2178 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (.r𝑆) = (.r𝑆))
353a1i 9 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑈 = (Unit‘𝑆))
36 eqidd 2178 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (invr𝑆) = (invr𝑆))
37 subrgdv.4 . . . 4 𝐸 = (/r𝑆)
3837a1i 9 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝐸 = (/r𝑆))
391subrgring 13350 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
40393ad2ant1 1018 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑆 ∈ Ring)
411subrgbas 13356 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
42413ad2ant1 1018 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝐴 = (Base‘𝑆))
4325, 42eleqtrd 2256 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑋 ∈ (Base‘𝑆))
4433, 34, 35, 36, 38, 40, 43, 30dvrvald 13308 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋𝐸𝑌) = (𝑋(.r𝑆)((invr𝑆)‘𝑌)))
4514, 32, 443eqtr4d 2220 1 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋 / 𝑌) = (𝑋𝐸𝑌))
Colors of variables: wff set class
Syntax hints:  wi 4  w3a 978   = wceq 1353  wcel 2148  wss 3131  cfv 5218  (class class class)co 5877  Basecbs 12464  s cress 12465  .rcmulr 12539  Ringcrg 13184  Unitcui 13261  invrcinvr 13294  /rcdvr 13305  SubRingcsubrg 13343
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-addcom 7913  ax-addass 7915  ax-i2m1 7918  ax-0lt1 7919  ax-0id 7921  ax-rnegex 7922  ax-pre-ltirr 7925  ax-pre-lttrn 7927  ax-pre-ltadd 7929
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-1st 6143  df-2nd 6144  df-tpos 6248  df-pnf 7996  df-mnf 7997  df-ltxr 7999  df-inn 8922  df-2 8980  df-3 8981  df-ndx 12467  df-slot 12468  df-base 12470  df-sets 12471  df-iress 12472  df-plusg 12551  df-mulr 12552  df-0g 12712  df-mgm 12780  df-sgrp 12813  df-mnd 12823  df-grp 12885  df-minusg 12886  df-subg 13035  df-cmn 13095  df-abl 13096  df-mgp 13136  df-ur 13148  df-srg 13152  df-ring 13186  df-oppr 13245  df-dvdsr 13263  df-unit 13264  df-invr 13295  df-dvr 13306  df-subrg 13345
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator