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

Theorem dvrass 14301
Description: An associative law for division. (divassap 8966 analog.) (Contributed by Mario Carneiro, 4-Dec-2014.)
Hypotheses
Ref Expression
dvrass.b  |-  B  =  ( Base `  R
)
dvrass.o  |-  U  =  (Unit `  R )
dvrass.d  |-  ./  =  (/r
`  R )
dvrass.t  |-  .x.  =  ( .r `  R )
Assertion
Ref Expression
dvrass  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  ( ( X  .x.  Y )  ./  Z )  =  ( X  .x.  ( Y 
./  Z ) ) )

Proof of Theorem dvrass
StepHypRef Expression
1 simpl 109 . . 3  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  R  e.  Ring )
2 simpr1 1030 . . 3  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  X  e.  B )
3 simpr2 1031 . . 3  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  Y  e.  B )
4 simpr3 1032 . . . 4  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  Z  e.  U )
5 dvrass.o . . . . 5  |-  U  =  (Unit `  R )
6 eqid 2234 . . . . 5  |-  ( invr `  R )  =  (
invr `  R )
7 dvrass.b . . . . 5  |-  B  =  ( Base `  R
)
85, 6, 7ringinvcl 14287 . . . 4  |-  ( ( R  e.  Ring  /\  Z  e.  U )  ->  (
( invr `  R ) `  Z )  e.  B
)
94, 8syldan 282 . . 3  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  ( ( invr `  R ) `  Z )  e.  B
)
10 dvrass.t . . . 4  |-  .x.  =  ( .r `  R )
117, 10ringass 14177 . . 3  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  ( ( invr `  R
) `  Z )  e.  B ) )  -> 
( ( X  .x.  Y )  .x.  (
( invr `  R ) `  Z ) )  =  ( X  .x.  ( Y  .x.  ( ( invr `  R ) `  Z
) ) ) )
121, 2, 3, 9, 11syl13anc 1276 . 2  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  ( ( X  .x.  Y )  .x.  ( ( invr `  R
) `  Z )
)  =  ( X 
.x.  ( Y  .x.  ( ( invr `  R
) `  Z )
) ) )
137a1i 9 . . 3  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  B  =  ( Base `  R )
)
1410a1i 9 . . 3  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  .x.  =  ( .r `  R ) )
155a1i 9 . . 3  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  U  =  (Unit `  R ) )
166a1i 9 . . 3  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  ( invr `  R )  =  (
invr `  R )
)
17 dvrass.d . . . 4  |-  ./  =  (/r
`  R )
1817a1i 9 . . 3  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  ./  =  (/r `  R ) )
197, 10ringcl 14174 . . . 4  |-  ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  ->  ( X  .x.  Y )  e.  B )
20193adant3r3 1241 . . 3  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  ( X  .x.  Y )  e.  B
)
2113, 14, 15, 16, 18, 1, 20, 4dvrvald 14296 . 2  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  ( ( X  .x.  Y )  ./  Z )  =  ( ( X  .x.  Y
)  .x.  ( ( invr `  R ) `  Z ) ) )
2213, 14, 15, 16, 18, 1, 3, 4dvrvald 14296 . . 3  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  ( Y  ./  Z )  =  ( Y  .x.  ( (
invr `  R ) `  Z ) ) )
2322oveq2d 6068 . 2  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  ( X  .x.  ( Y  ./  Z
) )  =  ( X  .x.  ( Y 
.x.  ( ( invr `  R ) `  Z
) ) ) )
2412, 21, 233eqtr4d 2277 1  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  U )
)  ->  ( ( X  .x.  Y )  ./  Z )  =  ( X  .x.  ( Y 
./  Z ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2205   ` cfv 5354  (class class class)co 6052   Basecbs 13229   .rcmulr 13308   Ringcrg 14157  Unitcui 14248   invrcinvr 14282  /rcdvr 14293
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-addass 8231  ax-i2m1 8234  ax-0lt1 8235  ax-0id 8237  ax-rnegex 8238  ax-pre-ltirr 8241  ax-pre-lttrn 8243  ax-pre-ltadd 8245
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-tpos 6478  df-pnf 8312  df-mnf 8313  df-ltxr 8315  df-inn 9240  df-2 9298  df-3 9299  df-ndx 13232  df-slot 13233  df-base 13235  df-sets 13236  df-iress 13237  df-plusg 13320  df-mulr 13321  df-0g 13488  df-mgm 13586  df-sgrp 13632  df-mnd 13647  df-grp 13733  df-minusg 13734  df-cmn 14020  df-abl 14021  df-mgp 14082  df-ur 14121  df-srg 14125  df-ring 14159  df-oppr 14229  df-dvdsr 14250  df-unit 14251  df-invr 14283  df-dvr 14294
This theorem is referenced by:  dvrcan3  14303
  Copyright terms: Public domain W3C validator