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

Theorem dvrfvald 14440
Description: Division operation in a ring. (Contributed by Mario Carneiro, 2-Jul-2014.) (Revised by Mario Carneiro, 2-Dec-2014.) (Proof shortened by AV, 2-Mar-2024.)
Hypotheses
Ref Expression
dvrfvald.b  |-  ( ph  ->  B  =  ( Base `  R ) )
dvrfvald.t  |-  ( ph  ->  .x.  =  ( .r
`  R ) )
dvrfvald.u  |-  ( ph  ->  U  =  (Unit `  R ) )
dvrfvald.i  |-  ( ph  ->  I  =  ( invr `  R ) )
dvrfvald.d  |-  ( ph  -> 
./  =  (/r `  R
) )
dvrfvald.r  |-  ( ph  ->  R  e. SRing )
Assertion
Ref Expression
dvrfvald  |-  ( ph  -> 
./  =  ( x  e.  B ,  y  e.  U  |->  ( x 
.x.  ( I `  y ) ) ) )
Distinct variable groups:    x, y, B   
x, I, y    x, R, y    x,  .x. , y    x, U, y    ph, x, y
Allowed substitution hints:    ./ ( x,  y)

Proof of Theorem dvrfvald
Dummy variable  r is distinct from all other variables.
StepHypRef Expression
1 df-dvr 14439 . . 3  |- /r  =  (
r  e.  _V  |->  ( x  e.  ( Base `  r ) ,  y  e.  (Unit `  r
)  |->  ( x ( .r `  r ) ( ( invr `  r
) `  y )
) ) )
2 fveq2 5695 . . . 4  |-  ( r  =  R  ->  ( Base `  r )  =  ( Base `  R
) )
3 fveq2 5695 . . . 4  |-  ( r  =  R  ->  (Unit `  r )  =  (Unit `  R ) )
4 fveq2 5695 . . . . 5  |-  ( r  =  R  ->  ( .r `  r )  =  ( .r `  R
) )
5 eqidd 2239 . . . . 5  |-  ( r  =  R  ->  x  =  x )
6 fveq2 5695 . . . . . 6  |-  ( r  =  R  ->  ( invr `  r )  =  ( invr `  R
) )
76fveq1d 5697 . . . . 5  |-  ( r  =  R  ->  (
( invr `  r ) `  y )  =  ( ( invr `  R
) `  y )
)
84, 5, 7oveq123d 6106 . . . 4  |-  ( r  =  R  ->  (
x ( .r `  r ) ( (
invr `  r ) `  y ) )  =  ( x ( .r
`  R ) ( ( invr `  R
) `  y )
) )
92, 3, 8mpoeq123dv 6150 . . 3  |-  ( r  =  R  ->  (
x  e.  ( Base `  r ) ,  y  e.  (Unit `  r
)  |->  ( x ( .r `  r ) ( ( invr `  r
) `  y )
) )  =  ( x  e.  ( Base `  R ) ,  y  e.  (Unit `  R
)  |->  ( x ( .r `  R ) ( ( invr `  R
) `  y )
) ) )
10 dvrfvald.r . . . 4  |-  ( ph  ->  R  e. SRing )
1110elexd 2835 . . 3  |-  ( ph  ->  R  e.  _V )
12 basfn 13411 . . . . 5  |-  Base  Fn  _V
13 funfvex 5712 . . . . . 6  |-  ( ( Fun  Base  /\  R  e. 
dom  Base )  ->  ( Base `  R )  e. 
_V )
1413funfni 5483 . . . . 5  |-  ( (
Base  Fn  _V  /\  R  e.  _V )  ->  ( Base `  R )  e. 
_V )
1512, 11, 14sylancr 418 . . . 4  |-  ( ph  ->  ( Base `  R
)  e.  _V )
16 eqidd 2239 . . . . . 6  |-  ( ph  ->  ( Base `  R
)  =  ( Base `  R ) )
17 eqidd 2239 . . . . . 6  |-  ( ph  ->  (Unit `  R )  =  (Unit `  R )
)
1816, 17, 10unitssd 14416 . . . . 5  |-  ( ph  ->  (Unit `  R )  C_  ( Base `  R
) )
1915, 18ssexd 4273 . . . 4  |-  ( ph  ->  (Unit `  R )  e.  _V )
20 mpoexga 6448 . . . 4  |-  ( ( ( Base `  R
)  e.  _V  /\  (Unit `  R )  e. 
_V )  ->  (
x  e.  ( Base `  R ) ,  y  e.  (Unit `  R
)  |->  ( x ( .r `  R ) ( ( invr `  R
) `  y )
) )  e.  _V )
2115, 19, 20syl2anc 415 . . 3  |-  ( ph  ->  ( x  e.  (
Base `  R ) ,  y  e.  (Unit `  R )  |->  ( x ( .r `  R
) ( ( invr `  R ) `  y
) ) )  e. 
_V )
221, 9, 11, 21fvmptd3 5799 . 2  |-  ( ph  ->  (/r `  R )  =  ( x  e.  (
Base `  R ) ,  y  e.  (Unit `  R )  |->  ( x ( .r `  R
) ( ( invr `  R ) `  y
) ) ) )
23 dvrfvald.d . 2  |-  ( ph  -> 
./  =  (/r `  R
) )
24 dvrfvald.b . . 3  |-  ( ph  ->  B  =  ( Base `  R ) )
25 dvrfvald.u . . 3  |-  ( ph  ->  U  =  (Unit `  R ) )
26 dvrfvald.t . . . 4  |-  ( ph  ->  .x.  =  ( .r
`  R ) )
27 eqidd 2239 . . . 4  |-  ( ph  ->  x  =  x )
28 dvrfvald.i . . . . 5  |-  ( ph  ->  I  =  ( invr `  R ) )
2928fveq1d 5697 . . . 4  |-  ( ph  ->  ( I `  y
)  =  ( (
invr `  R ) `  y ) )
3026, 27, 29oveq123d 6106 . . 3  |-  ( ph  ->  ( x  .x.  (
I `  y )
)  =  ( x ( .r `  R
) ( ( invr `  R ) `  y
) ) )
3124, 25, 30mpoeq123dv 6150 . 2  |-  ( ph  ->  ( x  e.  B ,  y  e.  U  |->  ( x  .x.  (
I `  y )
) )  =  ( x  e.  ( Base `  R ) ,  y  e.  (Unit `  R
)  |->  ( x ( .r `  R ) ( ( invr `  R
) `  y )
) ) )
3222, 23, 313eqtr4d 2281 1  |-  ( ph  -> 
./  =  ( x  e.  B ,  y  e.  U  |->  ( x 
.x.  ( I `  y ) ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209   _Vcvv 2821    Fn wfn 5372   ` cfv 5377  (class class class)co 6085    e. cmpo 6087   Basecbs 13352   .rcmulr 13432  SRingcsrg 14267  Unitcui 14393   invrcinvr 14427  /rcdvr 14438
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 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-ltadd 8295
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-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 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-3 9364  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-plusg 13444  df-mulr 13445  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-mgp 14218  df-srg 14268  df-dvdsr 14395  df-unit 14396  df-dvr 14439
This theorem is used by:  dvrvald  14441
  Copyright terms: Public domain W3C validator