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

Theorem mulpipq 9339
Description: Multiplication of positive fractions in terms of positive integers. (Contributed by NM, 28-Aug-1995.) (Revised by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)
Assertion
Ref Expression
mulpipq

Proof of Theorem mulpipq
StepHypRef Expression
1 opelxpi 5036 . . 3
2 opelxpi 5036 . . 3
3 mulpipq2 9338 . . 3
41, 2, 3syl2an 477 . 2
5 op1stg 6812 . . . 4
6 op1stg 6812 . . . 4
75, 6oveqan12d 6315 . . 3
8 op2ndg 6813 . . . 4
9 op2ndg 6813 . . . 4
108, 9oveqan12d 6315 . . 3
117, 10opeq12d 4225 . 2
124, 11eqtrd 2498 1
Colors of variables: wff setvar class
Syntax hints:  ->wi 4  /\wa 369  =wceq 1395  e.wcel 1818  <.cop 4035  X.cxp 5002  `cfv 5593  (class class class)co 6296   c1st 6798   c2nd 6799   cnpi 9243   cmi 9245   cmpq 9248
This theorem is referenced by:  mulassnq  9358  distrnq  9360  mulidnq  9362  recmulnq  9363
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790  ax-8 1820  ax-9 1822  ax-10 1837  ax-11 1842  ax-12 1854  ax-13 1999  ax-ext 2435  ax-sep 4573  ax-nul 4581  ax-pow 4630  ax-pr 4691  ax-un 6592
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1398  df-ex 1613  df-nf 1617  df-sb 1740  df-eu 2286  df-mo 2287  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3111  df-sbc 3328  df-dif 3478  df-un 3480  df-in 3482  df-ss 3489  df-nul 3785  df-if 3942  df-sn 4030  df-pr 4032  df-op 4036  df-uni 4250  df-br 4453  df-opab 4511  df-mpt 4512  df-id 4800  df-xp 5010  df-rel 5011  df-cnv 5012  df-co 5013  df-dm 5014  df-rn 5015  df-iota 5556  df-fun 5595  df-fv 5601  df-ov 6299  df-oprab 6300  df-mpt2 6301  df-1st 6800  df-2nd 6801  df-mpq 9308
  Copyright terms: Public domain W3C validator