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

Theorem subrgdv 14258
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 2231 . . . . . 6 (invr𝑅) = (invr𝑅)
3 subrgdv.3 . . . . . 6 𝑈 = (Unit‘𝑆)
4 eqid 2231 . . . . . 6 (invr𝑆) = (invr𝑆)
51, 2, 3, 4subrginv 14257 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑌𝑈) → ((invr𝑅)‘𝑌) = ((invr𝑆)‘𝑌))
653adant2 1042 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → ((invr𝑅)‘𝑌) = ((invr𝑆)‘𝑌))
76oveq2d 6034 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋(.r𝑅)((invr𝑅)‘𝑌)) = (𝑋(.r𝑅)((invr𝑆)‘𝑌)))
8 subrgrcl 14246 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
9 eqid 2231 . . . . . . 7 (.r𝑅) = (.r𝑅)
101, 9ressmulrg 13233 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r𝑅) = (.r𝑆))
118, 10mpdan 421 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (.r𝑆))
12113ad2ant1 1044 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (.r𝑅) = (.r𝑆))
1312oveqd 6035 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋(.r𝑅)((invr𝑆)‘𝑌)) = (𝑋(.r𝑆)((invr𝑆)‘𝑌)))
147, 13eqtrd 2264 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋(.r𝑅)((invr𝑅)‘𝑌)) = (𝑋(.r𝑆)((invr𝑆)‘𝑌)))
15 eqidd 2232 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (Base‘𝑅) = (Base‘𝑅))
16 eqidd 2232 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (.r𝑅) = (.r𝑅))
17 eqidd 2232 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (Unit‘𝑅) = (Unit‘𝑅))
18 eqidd 2232 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (invr𝑅) = (invr𝑅))
19 subrgdv.2 . . . 4 / = (/r𝑅)
2019a1i 9 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → / = (/r𝑅))
2183ad2ant1 1044 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑅 ∈ Ring)
22 eqid 2231 . . . . . 6 (Base‘𝑅) = (Base‘𝑅)
2322subrgss 14242 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
24233ad2ant1 1044 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝐴 ⊆ (Base‘𝑅))
25 simp2 1024 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑋𝐴)
2624, 25sseldd 3228 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑋 ∈ (Base‘𝑅))
27 eqid 2231 . . . . . 6 (Unit‘𝑅) = (Unit‘𝑅)
281, 27, 3subrguss 14256 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝑈 ⊆ (Unit‘𝑅))
29283ad2ant1 1044 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑈 ⊆ (Unit‘𝑅))
30 simp3 1025 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑌𝑈)
3129, 30sseldd 3228 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑌 ∈ (Unit‘𝑅))
3215, 16, 17, 18, 20, 21, 26, 31dvrvald 14154 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋 / 𝑌) = (𝑋(.r𝑅)((invr𝑅)‘𝑌)))
33 eqidd 2232 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (Base‘𝑆) = (Base‘𝑆))
34 eqidd 2232 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (.r𝑆) = (.r𝑆))
353a1i 9 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑈 = (Unit‘𝑆))
36 eqidd 2232 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (invr𝑆) = (invr𝑆))
37 subrgdv.4 . . . 4 𝐸 = (/r𝑆)
3837a1i 9 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝐸 = (/r𝑆))
391subrgring 14244 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
40393ad2ant1 1044 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑆 ∈ Ring)
411subrgbas 14250 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
42413ad2ant1 1044 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝐴 = (Base‘𝑆))
4325, 42eleqtrd 2310 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑋 ∈ (Base‘𝑆))
4433, 34, 35, 36, 38, 40, 43, 30dvrvald 14154 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋𝐸𝑌) = (𝑋(.r𝑆)((invr𝑆)‘𝑌)))
4514, 32, 443eqtr4d 2274 1 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋 / 𝑌) = (𝑋𝐸𝑌))
Colors of variables: wff set class
Syntax hints:  wi 4  w3a 1004   = wceq 1397  wcel 2202  wss 3200  cfv 5326  (class class class)co 6018  Basecbs 13087  s cress 13088  .rcmulr 13166  Ringcrg 14015  Unitcui 14106  invrcinvr 14140  /rcdvr 14151  SubRingcsubrg 14237
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-pre-ltirr 8144  ax-pre-lttrn 8146  ax-pre-ltadd 8148
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-tpos 6411  df-pnf 8216  df-mnf 8217  df-ltxr 8219  df-inn 9144  df-2 9202  df-3 9203  df-ndx 13090  df-slot 13091  df-base 13093  df-sets 13094  df-iress 13095  df-plusg 13178  df-mulr 13179  df-0g 13346  df-mgm 13444  df-sgrp 13490  df-mnd 13505  df-grp 13591  df-minusg 13592  df-subg 13762  df-cmn 13878  df-abl 13879  df-mgp 13940  df-ur 13979  df-srg 13983  df-ring 14017  df-oppr 14087  df-dvdsr 14108  df-unit 14109  df-invr 14141  df-dvr 14152  df-subrg 14239
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator