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

Theorem mulpipq2 7728
Description: Multiplication of positive fractions in terms of positive integers. (Contributed by Mario Carneiro, 8-May-2013.)
Assertion
Ref Expression
mulpipq2  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  ( A  .pQ  B )  = 
<. ( ( 1st `  A
)  .N  ( 1st `  B ) ) ,  ( ( 2nd `  A
)  .N  ( 2nd `  B ) ) >.
)

Proof of Theorem mulpipq2
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 xp1st 6389 . . . 4  |-  ( A  e.  ( N.  X.  N. )  ->  ( 1st `  A )  e.  N. )
2 xp1st 6389 . . . 4  |-  ( B  e.  ( N.  X.  N. )  ->  ( 1st `  B )  e.  N. )
3 mulclpi 7685 . . . 4  |-  ( ( ( 1st `  A
)  e.  N.  /\  ( 1st `  B )  e.  N. )  -> 
( ( 1st `  A
)  .N  ( 1st `  B ) )  e. 
N. )
41, 2, 3syl2an 289 . . 3  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  (
( 1st `  A
)  .N  ( 1st `  B ) )  e. 
N. )
5 xp2nd 6390 . . . 4  |-  ( A  e.  ( N.  X.  N. )  ->  ( 2nd `  A )  e.  N. )
6 xp2nd 6390 . . . 4  |-  ( B  e.  ( N.  X.  N. )  ->  ( 2nd `  B )  e.  N. )
7 mulclpi 7685 . . . 4  |-  ( ( ( 2nd `  A
)  e.  N.  /\  ( 2nd `  B )  e.  N. )  -> 
( ( 2nd `  A
)  .N  ( 2nd `  B ) )  e. 
N. )
85, 6, 7syl2an 289 . . 3  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  (
( 2nd `  A
)  .N  ( 2nd `  B ) )  e. 
N. )
9 opexg 4363 . . 3  |-  ( ( ( ( 1st `  A
)  .N  ( 1st `  B ) )  e. 
N.  /\  ( ( 2nd `  A )  .N  ( 2nd `  B
) )  e.  N. )  ->  <. ( ( 1st `  A )  .N  ( 1st `  B ) ) ,  ( ( 2nd `  A )  .N  ( 2nd `  B ) )
>.  e.  _V )
104, 8, 9syl2anc 415 . 2  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  <. (
( 1st `  A
)  .N  ( 1st `  B ) ) ,  ( ( 2nd `  A
)  .N  ( 2nd `  B ) ) >.  e.  _V )
11 fveq2 5690 . . . . 5  |-  ( x  =  A  ->  ( 1st `  x )  =  ( 1st `  A
) )
1211oveq1d 6090 . . . 4  |-  ( x  =  A  ->  (
( 1st `  x
)  .N  ( 1st `  y ) )  =  ( ( 1st `  A
)  .N  ( 1st `  y ) ) )
13 fveq2 5690 . . . . 5  |-  ( x  =  A  ->  ( 2nd `  x )  =  ( 2nd `  A
) )
1413oveq1d 6090 . . . 4  |-  ( x  =  A  ->  (
( 2nd `  x
)  .N  ( 2nd `  y ) )  =  ( ( 2nd `  A
)  .N  ( 2nd `  y ) ) )
1512, 14opeq12d 3907 . . 3  |-  ( x  =  A  ->  <. (
( 1st `  x
)  .N  ( 1st `  y ) ) ,  ( ( 2nd `  x
)  .N  ( 2nd `  y ) ) >.  =  <. ( ( 1st `  A )  .N  ( 1st `  y ) ) ,  ( ( 2nd `  A )  .N  ( 2nd `  y ) )
>. )
16 fveq2 5690 . . . . 5  |-  ( y  =  B  ->  ( 1st `  y )  =  ( 1st `  B
) )
1716oveq2d 6091 . . . 4  |-  ( y  =  B  ->  (
( 1st `  A
)  .N  ( 1st `  y ) )  =  ( ( 1st `  A
)  .N  ( 1st `  B ) ) )
18 fveq2 5690 . . . . 5  |-  ( y  =  B  ->  ( 2nd `  y )  =  ( 2nd `  B
) )
1918oveq2d 6091 . . . 4  |-  ( y  =  B  ->  (
( 2nd `  A
)  .N  ( 2nd `  y ) )  =  ( ( 2nd `  A
)  .N  ( 2nd `  B ) ) )
2017, 19opeq12d 3907 . . 3  |-  ( y  =  B  ->  <. (
( 1st `  A
)  .N  ( 1st `  y ) ) ,  ( ( 2nd `  A
)  .N  ( 2nd `  y ) ) >.  =  <. ( ( 1st `  A )  .N  ( 1st `  B ) ) ,  ( ( 2nd `  A )  .N  ( 2nd `  B ) )
>. )
21 df-mpq 7702 . . 3  |-  .pQ  =  ( x  e.  ( N.  X.  N. ) ,  y  e.  ( N. 
X.  N. )  |->  <. (
( 1st `  x
)  .N  ( 1st `  y ) ) ,  ( ( 2nd `  x
)  .N  ( 2nd `  y ) ) >.
)
2215, 20, 21ovmpog 6213 . 2  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. )  /\  <. ( ( 1st `  A )  .N  ( 1st `  B ) ) ,  ( ( 2nd `  A )  .N  ( 2nd `  B ) )
>.  e.  _V )  -> 
( A  .pQ  B
)  =  <. (
( 1st `  A
)  .N  ( 1st `  B ) ) ,  ( ( 2nd `  A
)  .N  ( 2nd `  B ) ) >.
)
2310, 22mpd3an3 1379 1  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  ( A  .pQ  B )  = 
<. ( ( 1st `  A
)  .N  ( 1st `  B ) ) ,  ( ( 2nd `  A
)  .N  ( 2nd `  B ) ) >.
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821   <.cop 3708    X. cxp 4767   ` cfv 5372  (class class class)co 6075   1stc1st 6362   2ndc2nd 6363   N.cnpi 7629    .N cmi 7631    .pQ cmpq 7634
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-irdg 6631  df-oadd 6681  df-omul 6682  df-ni 7661  df-mi 7663  df-mpq 7702
This theorem is referenced by:  mulpipq  7729
  Copyright terms: Public domain W3C validator