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

Theorem subrgdv 14050
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 2206 . . . . . 6 (invr𝑅) = (invr𝑅)
3 subrgdv.3 . . . . . 6 𝑈 = (Unit‘𝑆)
4 eqid 2206 . . . . . 6 (invr𝑆) = (invr𝑆)
51, 2, 3, 4subrginv 14049 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑌𝑈) → ((invr𝑅)‘𝑌) = ((invr𝑆)‘𝑌))
653adant2 1019 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → ((invr𝑅)‘𝑌) = ((invr𝑆)‘𝑌))
76oveq2d 5970 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋(.r𝑅)((invr𝑅)‘𝑌)) = (𝑋(.r𝑅)((invr𝑆)‘𝑌)))
8 subrgrcl 14038 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
9 eqid 2206 . . . . . . 7 (.r𝑅) = (.r𝑅)
101, 9ressmulrg 13027 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r𝑅) = (.r𝑆))
118, 10mpdan 421 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (.r𝑆))
12113ad2ant1 1021 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (.r𝑅) = (.r𝑆))
1312oveqd 5971 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋(.r𝑅)((invr𝑆)‘𝑌)) = (𝑋(.r𝑆)((invr𝑆)‘𝑌)))
147, 13eqtrd 2239 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋(.r𝑅)((invr𝑅)‘𝑌)) = (𝑋(.r𝑆)((invr𝑆)‘𝑌)))
15 eqidd 2207 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (Base‘𝑅) = (Base‘𝑅))
16 eqidd 2207 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (.r𝑅) = (.r𝑅))
17 eqidd 2207 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (Unit‘𝑅) = (Unit‘𝑅))
18 eqidd 2207 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (invr𝑅) = (invr𝑅))
19 subrgdv.2 . . . 4 / = (/r𝑅)
2019a1i 9 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → / = (/r𝑅))
2183ad2ant1 1021 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑅 ∈ Ring)
22 eqid 2206 . . . . . 6 (Base‘𝑅) = (Base‘𝑅)
2322subrgss 14034 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
24233ad2ant1 1021 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝐴 ⊆ (Base‘𝑅))
25 simp2 1001 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑋𝐴)
2624, 25sseldd 3196 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑋 ∈ (Base‘𝑅))
27 eqid 2206 . . . . . 6 (Unit‘𝑅) = (Unit‘𝑅)
281, 27, 3subrguss 14048 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝑈 ⊆ (Unit‘𝑅))
29283ad2ant1 1021 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑈 ⊆ (Unit‘𝑅))
30 simp3 1002 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑌𝑈)
3129, 30sseldd 3196 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑌 ∈ (Unit‘𝑅))
3215, 16, 17, 18, 20, 21, 26, 31dvrvald 13946 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋 / 𝑌) = (𝑋(.r𝑅)((invr𝑅)‘𝑌)))
33 eqidd 2207 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (Base‘𝑆) = (Base‘𝑆))
34 eqidd 2207 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (.r𝑆) = (.r𝑆))
353a1i 9 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑈 = (Unit‘𝑆))
36 eqidd 2207 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (invr𝑆) = (invr𝑆))
37 subrgdv.4 . . . 4 𝐸 = (/r𝑆)
3837a1i 9 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝐸 = (/r𝑆))
391subrgring 14036 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
40393ad2ant1 1021 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑆 ∈ Ring)
411subrgbas 14042 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
42413ad2ant1 1021 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝐴 = (Base‘𝑆))
4325, 42eleqtrd 2285 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → 𝑋 ∈ (Base‘𝑆))
4433, 34, 35, 36, 38, 40, 43, 30dvrvald 13946 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋𝐸𝑌) = (𝑋(.r𝑆)((invr𝑆)‘𝑌)))
4514, 32, 443eqtr4d 2249 1 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝐴𝑌𝑈) → (𝑋 / 𝑌) = (𝑋𝐸𝑌))
Colors of variables: wff set class
Syntax hints:  wi 4  w3a 981   = wceq 1373  wcel 2177  wss 3168  cfv 5277  (class class class)co 5954  Basecbs 12882  s cress 12883  .rcmulr 12960  Ringcrg 13808  Unitcui 13899  invrcinvr 13932  /rcdvr 13943  SubRingcsubrg 14029
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4164  ax-sep 4167  ax-nul 4175  ax-pow 4223  ax-pr 4258  ax-un 4485  ax-setind 4590  ax-cnex 8029  ax-resscn 8030  ax-1cn 8031  ax-1re 8032  ax-icn 8033  ax-addcl 8034  ax-addrcl 8035  ax-mulcl 8036  ax-addcom 8038  ax-addass 8040  ax-i2m1 8043  ax-0lt1 8044  ax-0id 8046  ax-rnegex 8047  ax-pre-ltirr 8050  ax-pre-lttrn 8052  ax-pre-ltadd 8054
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-reu 2492  df-rmo 2493  df-rab 2494  df-v 2775  df-sbc 3001  df-csb 3096  df-dif 3170  df-un 3172  df-in 3174  df-ss 3181  df-nul 3463  df-pw 3620  df-sn 3641  df-pr 3642  df-op 3644  df-uni 3854  df-int 3889  df-iun 3932  df-br 4049  df-opab 4111  df-mpt 4112  df-id 4345  df-xp 4686  df-rel 4687  df-cnv 4688  df-co 4689  df-dm 4690  df-rn 4691  df-res 4692  df-ima 4693  df-iota 5238  df-fun 5279  df-fn 5280  df-f 5281  df-f1 5282  df-fo 5283  df-f1o 5284  df-fv 5285  df-riota 5909  df-ov 5957  df-oprab 5958  df-mpo 5959  df-1st 6236  df-2nd 6237  df-tpos 6341  df-pnf 8122  df-mnf 8123  df-ltxr 8125  df-inn 9050  df-2 9108  df-3 9109  df-ndx 12885  df-slot 12886  df-base 12888  df-sets 12889  df-iress 12890  df-plusg 12972  df-mulr 12973  df-0g 13140  df-mgm 13238  df-sgrp 13284  df-mnd 13299  df-grp 13385  df-minusg 13386  df-subg 13556  df-cmn 13672  df-abl 13673  df-mgp 13733  df-ur 13772  df-srg 13776  df-ring 13810  df-oppr 13880  df-dvdsr 13901  df-unit 13902  df-invr 13933  df-dvr 13944  df-subrg 14031
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator