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

Theorem subrgdv 14519
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 2238 . . . . . 6  |-  ( invr `  R )  =  (
invr `  R )
3 subrgdv.3 . . . . . 6  |-  U  =  (Unit `  S )
4 eqid 2238 . . . . . 6  |-  ( invr `  S )  =  (
invr `  S )
51, 2, 3, 4subrginv 14518 . . . . 5  |-  ( ( A  e.  (SubRing `  R
)  /\  Y  e.  U )  ->  (
( invr `  R ) `  Y )  =  ( ( invr `  S
) `  Y )
)
653adant2 1047 . . . 4  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( ( invr `  R ) `  Y )  =  ( ( invr `  S
) `  Y )
)
76oveq2d 6091 . . 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 14507 . . . . . 6  |-  ( A  e.  (SubRing `  R
)  ->  R  e.  Ring )
9 eqid 2238 . . . . . . 7  |-  ( .r
`  R )  =  ( .r `  R
)
101, 9ressmulrg 13476 . . . . . 6  |-  ( ( A  e.  (SubRing `  R
)  /\  R  e.  Ring )  ->  ( .r `  R )  =  ( .r `  S ) )
118, 10mpdan 425 . . . . 5  |-  ( A  e.  (SubRing `  R
)  ->  ( .r `  R )  =  ( .r `  S ) )
12113ad2ant1 1049 . . . 4  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( .r `  R )  =  ( .r `  S ) )
1312oveqd 6092 . . 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 2271 . 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 2239 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( Base `  R )  =  (
Base `  R )
)
16 eqidd 2239 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( .r `  R )  =  ( .r `  R ) )
17 eqidd 2239 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  (Unit `  R
)  =  (Unit `  R ) )
18 eqidd 2239 . . 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 1049 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  R  e.  Ring )
22 eqid 2238 . . . . . 6  |-  ( Base `  R )  =  (
Base `  R )
2322subrgss 14503 . . . . 5  |-  ( A  e.  (SubRing `  R
)  ->  A  C_  ( Base `  R ) )
24233ad2ant1 1049 . . . 4  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  A  C_  ( Base `  R ) )
25 simp2 1029 . . . 4  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  X  e.  A )
2624, 25sseldd 3249 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  X  e.  ( Base `  R )
)
27 eqid 2238 . . . . . 6  |-  (Unit `  R )  =  (Unit `  R )
281, 27, 3subrguss 14517 . . . . 5  |-  ( A  e.  (SubRing `  R
)  ->  U  C_  (Unit `  R ) )
29283ad2ant1 1049 . . . 4  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  U  C_  (Unit `  R ) )
30 simp3 1030 . . . 4  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  Y  e.  U )
3129, 30sseldd 3249 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  Y  e.  (Unit `  R ) )
3215, 16, 17, 18, 20, 21, 26, 31dvrvald 14414 . 2  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( X  ./  Y )  =  ( X ( .r `  R ) ( (
invr `  R ) `  Y ) ) )
33 eqidd 2239 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( Base `  S )  =  (
Base `  S )
)
34 eqidd 2239 . . 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 2239 . . 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 14505 . . . 4  |-  ( A  e.  (SubRing `  R
)  ->  S  e.  Ring )
40393ad2ant1 1049 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  S  e.  Ring )
411subrgbas 14511 . . . . 5  |-  ( A  e.  (SubRing `  R
)  ->  A  =  ( Base `  S )
)
42413ad2ant1 1049 . . . 4  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  A  =  ( Base `  S )
)
4325, 42eleqtrd 2317 . . 3  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  X  e.  ( Base `  S )
)
4433, 34, 35, 36, 38, 40, 43, 30dvrvald 14414 . 2  |-  ( ( A  e.  (SubRing `  R
)  /\  X  e.  A  /\  Y  e.  U
)  ->  ( X E Y )  =  ( X ( .r `  S ) ( (
invr `  S ) `  Y ) ) )
4514, 32, 443eqtr4d 2281 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 1009    = wceq 1402    e. wcel 2209    C_ wss 3220   ` cfv 5372  (class class class)co 6075   Basecbs 13330   ↾s cress 13331   .rcmulr 13409   Ringcrg 14274  Unitcui 14366   invrcinvr 14400  /rcdvr 14411  SubRingcsubrg 14498
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-pre-ltirr 8281  ax-pre-lttrn 8283  ax-pre-ltadd 8285
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-tpos 6506  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-inn 9284  df-2 9342  df-3 9343  df-ndx 13333  df-slot 13334  df-base 13336  df-sets 13337  df-iress 13338  df-plusg 13421  df-mulr 13422  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-grp 13785  df-minusg 13786  df-subg 13950  df-cmn 14066  df-abl 14067  df-mgp 14195  df-ur 14238  df-srg 14242  df-ring 14276  df-oppr 14346  df-dvdsr 14368  df-unit 14369  df-invr 14401  df-dvr 14412  df-subrg 14500
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator