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

Theorem mulpipq2 7634
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 6337 . . . 4  |-  ( A  e.  ( N.  X.  N. )  ->  ( 1st `  A )  e.  N. )
2 xp1st 6337 . . . 4  |-  ( B  e.  ( N.  X.  N. )  ->  ( 1st `  B )  e.  N. )
3 mulclpi 7591 . . . 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 6338 . . . 4  |-  ( A  e.  ( N.  X.  N. )  ->  ( 2nd `  A )  e.  N. )
6 xp2nd 6338 . . . 4  |-  ( B  e.  ( N.  X.  N. )  ->  ( 2nd `  B )  e.  N. )
7 mulclpi 7591 . . . 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 4326 . . 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 411 . 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 5648 . . . . 5  |-  ( x  =  A  ->  ( 1st `  x )  =  ( 1st `  A
) )
1211oveq1d 6043 . . . 4  |-  ( x  =  A  ->  (
( 1st `  x
)  .N  ( 1st `  y ) )  =  ( ( 1st `  A
)  .N  ( 1st `  y ) ) )
13 fveq2 5648 . . . . 5  |-  ( x  =  A  ->  ( 2nd `  x )  =  ( 2nd `  A
) )
1413oveq1d 6043 . . . 4  |-  ( x  =  A  ->  (
( 2nd `  x
)  .N  ( 2nd `  y ) )  =  ( ( 2nd `  A
)  .N  ( 2nd `  y ) ) )
1512, 14opeq12d 3875 . . 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 5648 . . . . 5  |-  ( y  =  B  ->  ( 1st `  y )  =  ( 1st `  B
) )
1716oveq2d 6044 . . . 4  |-  ( y  =  B  ->  (
( 1st `  A
)  .N  ( 1st `  y ) )  =  ( ( 1st `  A
)  .N  ( 1st `  B ) ) )
18 fveq2 5648 . . . . 5  |-  ( y  =  B  ->  ( 2nd `  y )  =  ( 2nd `  B
) )
1918oveq2d 6044 . . . 4  |-  ( y  =  B  ->  (
( 2nd `  A
)  .N  ( 2nd `  y ) )  =  ( ( 2nd `  A
)  .N  ( 2nd `  B ) ) )
2017, 19opeq12d 3875 . . 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 7608 . . 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 6166 . 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 1375 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 1398    e. wcel 2202   _Vcvv 2803   <.cop 3676    X. cxp 4729   ` cfv 5333  (class class class)co 6028   1stc1st 6310   2ndc2nd 6311   N.cnpi 7535    .N cmi 7537    .pQ cmpq 7540
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-irdg 6579  df-oadd 6629  df-omul 6630  df-ni 7567  df-mi 7569  df-mpq 7608
This theorem is referenced by:  mulpipq  7635
  Copyright terms: Public domain W3C validator