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

Theorem dvrvald 14550
Description: Division operation in a ring. (Contributed by Mario Carneiro, 2-Jul-2014.) (Revised by Mario Carneiro, 2-Dec-2014.)
Hypotheses
Ref Expression
dvrvald.b  |-  ( ph  ->  B  =  ( Base `  R ) )
dvrvald.t  |-  ( ph  ->  .x.  =  ( .r
`  R ) )
dvrvald.u  |-  ( ph  ->  U  =  (Unit `  R ) )
dvrvald.i  |-  ( ph  ->  I  =  ( invr `  R ) )
dvrvald.d  |-  ( ph  -> 
./  =  (/r `  R
) )
dvrvald.r  |-  ( ph  ->  R  e.  Ring )
dvrvald.x  |-  ( ph  ->  X  e.  B )
dvrvald.y  |-  ( ph  ->  Y  e.  U )
Assertion
Ref Expression
dvrvald  |-  ( ph  ->  ( X  ./  Y
)  =  ( X 
.x.  ( I `  Y ) ) )

Proof of Theorem dvrvald
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dvrvald.b . . 3  |-  ( ph  ->  B  =  ( Base `  R ) )
2 dvrvald.t . . 3  |-  ( ph  ->  .x.  =  ( .r
`  R ) )
3 dvrvald.u . . 3  |-  ( ph  ->  U  =  (Unit `  R ) )
4 dvrvald.i . . 3  |-  ( ph  ->  I  =  ( invr `  R ) )
5 dvrvald.d . . 3  |-  ( ph  -> 
./  =  (/r `  R
) )
6 dvrvald.r . . . 4  |-  ( ph  ->  R  e.  Ring )
7 ringsrg 14459 . . . 4  |-  ( R  e.  Ring  ->  R  e. SRing
)
86, 7syl 14 . . 3  |-  ( ph  ->  R  e. SRing )
91, 2, 3, 4, 5, 8dvrfvald 14549 . 2  |-  ( ph  -> 
./  =  ( x  e.  B ,  y  e.  U  |->  ( x 
.x.  ( I `  y ) ) ) )
10 simpl 109 . . . 4  |-  ( ( x  =  X  /\  y  =  Y )  ->  x  =  X )
11 fveq2 5698 . . . . 5  |-  ( y  =  Y  ->  (
I `  y )  =  ( I `  Y ) )
1211adantl 277 . . . 4  |-  ( ( x  =  X  /\  y  =  Y )  ->  ( I `  y
)  =  ( I `
 Y ) )
1310, 12oveq12d 6106 . . 3  |-  ( ( x  =  X  /\  y  =  Y )  ->  ( x  .x.  (
I `  y )
)  =  ( X 
.x.  ( I `  Y ) ) )
1413adantl 277 . 2  |-  ( (
ph  /\  ( x  =  X  /\  y  =  Y ) )  -> 
( x  .x.  (
I `  y )
)  =  ( X 
.x.  ( I `  Y ) ) )
15 dvrvald.x . 2  |-  ( ph  ->  X  e.  B )
16 dvrvald.y . 2  |-  ( ph  ->  Y  e.  U )
172oveqd 6105 . . 3  |-  ( ph  ->  ( X  .x.  (
I `  Y )
)  =  ( X ( .r `  R
) ( I `  Y ) ) )
1815, 1eleqtrd 2317 . . . 4  |-  ( ph  ->  X  e.  ( Base `  R ) )
19 eqidd 2239 . . . . 5  |-  ( ph  ->  ( Base `  R
)  =  ( Base `  R ) )
2016, 3eleqtrd 2317 . . . . . . 7  |-  ( ph  ->  Y  e.  (Unit `  R ) )
21 eqid 2238 . . . . . . . 8  |-  (Unit `  R )  =  (Unit `  R )
22 eqid 2238 . . . . . . . 8  |-  ( invr `  R )  =  (
invr `  R )
2321, 22unitinvcl 14539 . . . . . . 7  |-  ( ( R  e.  Ring  /\  Y  e.  (Unit `  R )
)  ->  ( ( invr `  R ) `  Y )  e.  (Unit `  R ) )
246, 20, 23syl2anc 415 . . . . . 6  |-  ( ph  ->  ( ( invr `  R
) `  Y )  e.  (Unit `  R )
)
254fveq1d 5700 . . . . . 6  |-  ( ph  ->  ( I `  Y
)  =  ( (
invr `  R ) `  Y ) )
2624, 25, 33eltr4d 2322 . . . . 5  |-  ( ph  ->  ( I `  Y
)  e.  U )
2719, 3, 8, 26unitcld 14524 . . . 4  |-  ( ph  ->  ( I `  Y
)  e.  ( Base `  R ) )
28 eqid 2238 . . . . 5  |-  ( Base `  R )  =  (
Base `  R )
29 eqid 2238 . . . . 5  |-  ( .r
`  R )  =  ( .r `  R
)
3028, 29ringcl 14424 . . . 4  |-  ( ( R  e.  Ring  /\  X  e.  ( Base `  R
)  /\  ( I `  Y )  e.  (
Base `  R )
)  ->  ( X
( .r `  R
) ( I `  Y ) )  e.  ( Base `  R
) )
316, 18, 27, 30syl3anc 1278 . . 3  |-  ( ph  ->  ( X ( .r
`  R ) ( I `  Y ) )  e.  ( Base `  R ) )
3217, 31eqeltrd 2315 . 2  |-  ( ph  ->  ( X  .x.  (
I `  Y )
)  e.  ( Base `  R ) )
339, 14, 15, 16, 32ovmpod 6219 1  |-  ( ph  ->  ( X  ./  Y
)  =  ( X 
.x.  ( I `  Y ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   ` cfv 5380  (class class class)co 6088   Basecbs 13410   .rcmulr 13491  SRingcsrg 14374   Ringcrg 14407  Unitcui 14502   invrcinvr 14536  /rcdvr 14547
This proof depends on 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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-pre-ltirr 8297  ax-pre-lttrn 8299  ax-pre-ltadd 8301
This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-tpos 6520  df-pnf 8368  df-mnf 8369  df-ltxr 8371  df-inn 9314  df-2 9372  df-3 9373  df-ndx 13413  df-slot 13414  df-base 13416  df-sets 13417  df-iress 13418  df-plusg 13503  df-mulr 13504  df-0g 13671  df-mgm 13735  df-sgrp 13776  df-mnd 13789  df-grp 13867  df-minusg 13868  df-cmn 14179  df-abl 14180  df-mgp 14325  df-ur 14370  df-srg 14375  df-ring 14409  df-oppr 14482  df-dvdsr 14504  df-unit 14505  df-invr 14537  df-dvr 14548
This theorem is used by:  dvrcl  14551  unitdvcl  14552  dvrid  14553  dvr1  14554  dvrass  14555  dvrcan1  14556  dvrdir  14559  rdivmuldivd  14560  ringinvdv  14561  subrgdv  14655
  Copyright terms: Public domain W3C validator