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

Theorem divmulasscomap 8869
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 8868 . 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 8154 . . . . 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 6028 . 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 8851 . . . . 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 8196 . . 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 8863 . . . . . 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 6029 . . 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 4086  (class class class)co 6013   CCcc 8023   0cc0 8025    x. cmul 8030   # cap 8754    / cdiv 8845
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 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8116  ax-resscn 8117  ax-1cn 8118  ax-1re 8119  ax-icn 8120  ax-addcl 8121  ax-addrcl 8122  ax-mulcl 8123  ax-mulrcl 8124  ax-addcom 8125  ax-mulcom 8126  ax-addass 8127  ax-mulass 8128  ax-distr 8129  ax-i2m1 8130  ax-0lt1 8131  ax-1rid 8132  ax-0id 8133  ax-rnegex 8134  ax-precex 8135  ax-cnre 8136  ax-pre-ltirr 8137  ax-pre-ltwlin 8138  ax-pre-lttrn 8139  ax-pre-apti 8140  ax-pre-ltadd 8141  ax-pre-mulgt0 8142  ax-pre-mulext 8143
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 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-id 4388  df-po 4391  df-iso 4392  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8209  df-mnf 8210  df-xr 8211  df-ltxr 8212  df-le 8213  df-sub 8345  df-neg 8346  df-reap 8748  df-ap 8755  df-div 8846
This theorem is referenced by:  cncongr2  12669
  Copyright terms: Public domain W3C validator