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

Theorem divmulasscomap 8859
Description: An associative/commutative law for division and multiplication. (Contributed by Jim Kingdon, 24-Jan-2022.)
Assertion
Ref Expression
divmulasscomap  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  ( ( A  x.  ( B  /  D ) )  x.  C )  =  ( B  x.  ( ( A  x.  C )  /  D ) ) )

Proof of Theorem divmulasscomap
StepHypRef Expression
1 divmulassap 8858 . 2  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  ( ( A  x.  ( B  /  D ) )  x.  C )  =  ( ( A  x.  B
)  x.  ( C  /  D ) ) )
2 mulcom 8144 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  B
)  =  ( B  x.  A ) )
323adant3 1041 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  x.  B )  =  ( B  x.  A ) )
43adantr 276 . . 3  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  ( A  x.  B )  =  ( B  x.  A ) )
54oveq1d 6025 . 2  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  ( ( A  x.  B )  x.  ( C  /  D
) )  =  ( ( B  x.  A
)  x.  ( C  /  D ) ) )
6 simpl2 1025 . . . 4  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  B  e.  CC )
7 simpl1 1024 . . . 4  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  A  e.  CC )
8 simp3 1023 . . . . . . 7  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  C  e.  CC )
98anim1i 340 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  ( C  e.  CC  /\  ( D  e.  CC  /\  D #  0 ) ) )
10 3anass 1006 . . . . . 6  |-  ( ( C  e.  CC  /\  D  e.  CC  /\  D #  0 )  <->  ( C  e.  CC  /\  ( D  e.  CC  /\  D #  0 ) ) )
119, 10sylibr 134 . . . . 5  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  ( C  e.  CC  /\  D  e.  CC  /\  D #  0 ) )
12 divclap 8841 . . . . 5  |-  ( ( C  e.  CC  /\  D  e.  CC  /\  D #  0 )  ->  ( C  /  D )  e.  CC )
1311, 12syl 14 . . . 4  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  ( C  /  D )  e.  CC )
146, 7, 13mulassd 8186 . . 3  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  ( ( B  x.  A )  x.  ( C  /  D
) )  =  ( B  x.  ( A  x.  ( C  /  D ) ) ) )
158adantr 276 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  C  e.  CC )
16 simpr 110 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  ( D  e.  CC  /\  D #  0 ) )
17 divassap 8853 . . . . . 6  |-  ( ( A  e.  CC  /\  C  e.  CC  /\  ( D  e.  CC  /\  D #  0 ) )  -> 
( ( A  x.  C )  /  D
)  =  ( A  x.  ( C  /  D ) ) )
187, 15, 16, 17syl3anc 1271 . . . . 5  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  ( ( A  x.  C )  /  D )  =  ( A  x.  ( C  /  D ) ) )
1918eqcomd 2235 . . . 4  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  ( A  x.  ( C  /  D
) )  =  ( ( A  x.  C
)  /  D ) )
2019oveq2d 6026 . . 3  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  ( B  x.  ( A  x.  ( C  /  D ) ) )  =  ( B  x.  ( ( A  x.  C )  /  D ) ) )
2114, 20eqtrd 2262 . 2  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  ( ( B  x.  A )  x.  ( C  /  D
) )  =  ( B  x.  ( ( A  x.  C )  /  D ) ) )
221, 5, 213eqtrd 2266 1  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( D  e.  CC  /\  D #  0 ) )  ->  ( ( A  x.  ( B  /  D ) )  x.  C )  =  ( B  x.  ( ( A  x.  C )  /  D ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1002    = wceq 1395    e. wcel 2200   class class class wbr 4083  (class class class)co 6010   CCcc 8013   0cc0 8015    x. cmul 8020   # cap 8744    / cdiv 8835
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-sep 4202  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-mulrcl 8114  ax-addcom 8115  ax-mulcom 8116  ax-addass 8117  ax-mulass 8118  ax-distr 8119  ax-i2m1 8120  ax-0lt1 8121  ax-1rid 8122  ax-0id 8123  ax-rnegex 8124  ax-precex 8125  ax-cnre 8126  ax-pre-ltirr 8127  ax-pre-ltwlin 8128  ax-pre-lttrn 8129  ax-pre-apti 8130  ax-pre-ltadd 8131  ax-pre-mulgt0 8132  ax-pre-mulext 8133
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-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-id 4385  df-po 4388  df-iso 4389  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-iota 5281  df-fun 5323  df-fv 5329  df-riota 5963  df-ov 6013  df-oprab 6014  df-mpo 6015  df-pnf 8199  df-mnf 8200  df-xr 8201  df-ltxr 8202  df-le 8203  df-sub 8335  df-neg 8336  df-reap 8738  df-ap 8745  df-div 8836
This theorem is referenced by:  cncongr2  12647
  Copyright terms: Public domain W3C validator