MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mulcompq Structured version   Unicode version

Theorem mulcompq 9333
Description: Multiplication of positive fractions is commutative. (Contributed by NM, 31-Aug-1995.) (Revised by Mario Carneiro, 28-Apr-2013.) (New usage is discouraged.)
Assertion
Ref Expression
mulcompq  |-  ( A 
.pQ  B )  =  ( B  .pQ  A
)

Proof of Theorem mulcompq
StepHypRef Expression
1 mulcompi 9277 . . . 4  |-  ( ( 1st `  A )  .N  ( 1st `  B
) )  =  ( ( 1st `  B
)  .N  ( 1st `  A ) )
2 mulcompi 9277 . . . 4  |-  ( ( 2nd `  A )  .N  ( 2nd `  B
) )  =  ( ( 2nd `  B
)  .N  ( 2nd `  A ) )
31, 2opeq12i 4207 . . 3  |-  <. (
( 1st `  A
)  .N  ( 1st `  B ) ) ,  ( ( 2nd `  A
)  .N  ( 2nd `  B ) ) >.  =  <. ( ( 1st `  B )  .N  ( 1st `  A ) ) ,  ( ( 2nd `  B )  .N  ( 2nd `  A ) )
>.
4 mulpipq2 9320 . . 3  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  ( A  .pQ  B )  = 
<. ( ( 1st `  A
)  .N  ( 1st `  B ) ) ,  ( ( 2nd `  A
)  .N  ( 2nd `  B ) ) >.
)
5 mulpipq2 9320 . . . 4  |-  ( ( B  e.  ( N. 
X.  N. )  /\  A  e.  ( N.  X.  N. ) )  ->  ( B  .pQ  A )  = 
<. ( ( 1st `  B
)  .N  ( 1st `  A ) ) ,  ( ( 2nd `  B
)  .N  ( 2nd `  A ) ) >.
)
65ancoms 453 . . 3  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  ( B  .pQ  A )  = 
<. ( ( 1st `  B
)  .N  ( 1st `  A ) ) ,  ( ( 2nd `  B
)  .N  ( 2nd `  A ) ) >.
)
73, 4, 63eqtr4a 2510 . 2  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  ( A  .pQ  B )  =  ( B  .pQ  A
) )
8 mulpqf 9327 . . . 4  |-  .pQ  :
( ( N.  X.  N. )  X.  ( N.  X.  N. ) ) --> ( N.  X.  N. )
98fdmi 5726 . . 3  |-  dom  .pQ  =  ( ( N. 
X.  N. )  X.  ( N.  X.  N. ) )
109ndmovcom 6447 . 2  |-  ( -.  ( A  e.  ( N.  X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  ( A  .pQ  B )  =  ( B 
.pQ  A ) )
117, 10pm2.61i 164 1  |-  ( A 
.pQ  B )  =  ( B  .pQ  A
)
Colors of variables: wff setvar class
Syntax hints:    /\ wa 369    = wceq 1383    e. wcel 1804   <.cop 4020    X. cxp 4987   ` cfv 5578  (class class class)co 6281   1stc1st 6783   2ndc2nd 6784   N.cnpi 9225    .N cmi 9227    .pQ cmpq 9230
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1605  ax-4 1618  ax-5 1691  ax-6 1734  ax-7 1776  ax-8 1806  ax-9 1808  ax-10 1823  ax-11 1828  ax-12 1840  ax-13 1985  ax-ext 2421  ax-sep 4558  ax-nul 4566  ax-pow 4615  ax-pr 4676  ax-un 6577
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 975  df-3an 976  df-tru 1386  df-ex 1600  df-nf 1604  df-sb 1727  df-eu 2272  df-mo 2273  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2593  df-ne 2640  df-ral 2798  df-rex 2799  df-reu 2800  df-rab 2802  df-v 3097  df-sbc 3314  df-csb 3421  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-pss 3477  df-nul 3771  df-if 3927  df-pw 3999  df-sn 4015  df-pr 4017  df-tp 4019  df-op 4021  df-uni 4235  df-iun 4317  df-br 4438  df-opab 4496  df-mpt 4497  df-tr 4531  df-eprel 4781  df-id 4785  df-po 4790  df-so 4791  df-fr 4828  df-we 4830  df-ord 4871  df-on 4872  df-lim 4873  df-suc 4874  df-xp 4995  df-rel 4996  df-cnv 4997  df-co 4998  df-dm 4999  df-rn 5000  df-res 5001  df-ima 5002  df-iota 5541  df-fun 5580  df-fn 5581  df-f 5582  df-f1 5583  df-fo 5584  df-f1o 5585  df-fv 5586  df-ov 6284  df-oprab 6285  df-mpt2 6286  df-om 6686  df-1st 6785  df-2nd 6786  df-recs 7044  df-rdg 7078  df-oadd 7136  df-omul 7137  df-ni 9253  df-mi 9255  df-mpq 9290
This theorem is referenced by:  mulcomnq  9334  mulerpq  9338
  Copyright terms: Public domain W3C validator