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

Theorem subrgdv 14223
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  =  ( Rs  A )
subrgdv.2  |-  ./  =  (/r
`  R )
subrgdv.3  |-  U  =  (Unit `  S )
subrgdv.4  |-  E  =  (/r `  S )
Assertion
Ref Expression
subrgdv  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( X  ./  Y )  =  ( X E Y ) )

Proof of Theorem subrgdv
StepHypRef Expression
1 subrgdv.1 . . . . . 6  |-  S  =  ( Rs  A )
2 eqid 2229 . . . . . 6  |-  ( invr `  R )  =  (
invr `  R )
3 subrgdv.3 . . . . . 6  |-  U  =  (Unit `  S )
4 eqid 2229 . . . . . 6  |-  ( invr `  S )  =  (
invr `  S )
51, 2, 3, 4subrginv 14222 . . . . 5  |-  ( ( A  e.  (SubRing `  R
)  /\  Y  e.  U )  ->  (
( invr `  R ) `  Y )  =  ( ( invr `  S
) `  Y )
)
653adant2 1040 . . . 4  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( ( invr `  R ) `  Y )  =  ( ( invr `  S
) `  Y )
)
76oveq2d 6026 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( X
( .r `  R
) ( ( invr `  R ) `  Y
) )  =  ( X ( .r `  R ) ( (
invr `  S ) `  Y ) ) )
8 subrgrcl 14211 . . . . . 6  |-  ( A  e.  (SubRing `  R
)  ->  R  e.  Ring )
9 eqid 2229 . . . . . . 7  |-  ( .r
`  R )  =  ( .r `  R
)
101, 9ressmulrg 13199 . . . . . 6  |-  ( ( A  e.  (SubRing `  R
)  /\  R  e.  Ring )  ->  ( .r `  R )  =  ( .r `  S ) )
118, 10mpdan 421 . . . . 5  |-  ( A  e.  (SubRing `  R
)  ->  ( .r `  R )  =  ( .r `  S ) )
12113ad2ant1 1042 . . . 4  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( .r `  R )  =  ( .r `  S ) )
1312oveqd 6027 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( X
( .r `  R
) ( ( invr `  S ) `  Y
) )  =  ( X ( .r `  S ) ( (
invr `  S ) `  Y ) ) )
147, 13eqtrd 2262 . 2  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( X
( .r `  R
) ( ( invr `  R ) `  Y
) )  =  ( X ( .r `  S ) ( (
invr `  S ) `  Y ) ) )
15 eqidd 2230 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( Base `  R )  =  (
Base `  R )
)
16 eqidd 2230 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( .r `  R )  =  ( .r `  R ) )
17 eqidd 2230 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  (Unit `  R
)  =  (Unit `  R ) )
18 eqidd 2230 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( invr `  R )  =  (
invr `  R )
)
19 subrgdv.2 . . . 4  |-  ./  =  (/r
`  R )
2019a1i 9 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ./  =  (/r `  R ) )
2183ad2ant1 1042 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  R  e.  Ring )
22 eqid 2229 . . . . . 6  |-  ( Base `  R )  =  (
Base `  R )
2322subrgss 14207 . . . . 5  |-  ( A  e.  (SubRing `  R
)  ->  A  C_  ( Base `  R ) )
24233ad2ant1 1042 . . . 4  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  A  C_  ( Base `  R ) )
25 simp2 1022 . . . 4  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  X  e.  A )
2624, 25sseldd 3225 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  X  e.  ( Base `  R )
)
27 eqid 2229 . . . . . 6  |-  (Unit `  R )  =  (Unit `  R )
281, 27, 3subrguss 14221 . . . . 5  |-  ( A  e.  (SubRing `  R
)  ->  U  C_  (Unit `  R ) )
29283ad2ant1 1042 . . . 4  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  U  C_  (Unit `  R ) )
30 simp3 1023 . . . 4  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  Y  e.  U )
3129, 30sseldd 3225 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  Y  e.  (Unit `  R ) )
3215, 16, 17, 18, 20, 21, 26, 31dvrvald 14119 . 2  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( X  ./  Y )  =  ( X ( .r `  R ) ( (
invr `  R ) `  Y ) ) )
33 eqidd 2230 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( Base `  S )  =  (
Base `  S )
)
34 eqidd 2230 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( .r `  S )  =  ( .r `  S ) )
353a1i 9 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  U  =  (Unit `  S ) )
36 eqidd 2230 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( invr `  S )  =  (
invr `  S )
)
37 subrgdv.4 . . . 4  |-  E  =  (/r `  S )
3837a1i 9 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  E  =  (/r
`  S ) )
391subrgring 14209 . . . 4  |-  ( A  e.  (SubRing `  R
)  ->  S  e.  Ring )
40393ad2ant1 1042 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  S  e.  Ring )
411subrgbas 14215 . . . . 5  |-  ( A  e.  (SubRing `  R
)  ->  A  =  ( Base `  S )
)
42413ad2ant1 1042 . . . 4  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  A  =  ( Base `  S )
)
4325, 42eleqtrd 2308 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  X  e.  ( Base `  S )
)
4433, 34, 35, 36, 38, 40, 43, 30dvrvald 14119 . 2  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( X E Y )  =  ( X ( .r `  S ) ( (
invr `  S ) `  Y ) ) )
4514, 32, 443eqtr4d 2272 1  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( X  ./  Y )  =  ( X E Y ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 1002    = wceq 1395    e. wcel 2200    C_ wss 3197   ` cfv 5321  (class class class)co 6010   Basecbs 13053   ↾s cress 13054   .rcmulr 13132   Ringcrg 13980  Unitcui 14071   invrcinvr 14105  /rcdvr 14116  SubRingcsubrg 14202
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4259  ax-pr 4294  ax-un 4525  ax-setind 4630  ax-cnex 8106  ax-resscn 8107  ax-1cn 8108  ax-1re 8109  ax-icn 8110  ax-addcl 8111  ax-addrcl 8112  ax-mulcl 8113  ax-addcom 8115  ax-addass 8117  ax-i2m1 8120  ax-0lt1 8121  ax-0id 8123  ax-rnegex 8124  ax-pre-ltirr 8127  ax-pre-lttrn 8129  ax-pre-ltadd 8131
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4385  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-ima 4733  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-f1 5326  df-fo 5327  df-f1o 5328  df-fv 5329  df-riota 5963  df-ov 6013  df-oprab 6014  df-mpo 6015  df-1st 6295  df-2nd 6296  df-tpos 6402  df-pnf 8199  df-mnf 8200  df-ltxr 8202  df-inn 9127  df-2 9185  df-3 9186  df-ndx 13056  df-slot 13057  df-base 13059  df-sets 13060  df-iress 13061  df-plusg 13144  df-mulr 13145  df-0g 13312  df-mgm 13410  df-sgrp 13456  df-mnd 13471  df-grp 13557  df-minusg 13558  df-subg 13728  df-cmn 13844  df-abl 13845  df-mgp 13905  df-ur 13944  df-srg 13948  df-ring 13982  df-oppr 14052  df-dvdsr 14073  df-unit 14074  df-invr 14106  df-dvr 14117  df-subrg 14204
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator