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

Theorem mulpipq2 7203
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 6071 . . . 4  |-  ( A  e.  ( N.  X.  N. )  ->  ( 1st `  A )  e.  N. )
2 xp1st 6071 . . . 4  |-  ( B  e.  ( N.  X.  N. )  ->  ( 1st `  B )  e.  N. )
3 mulclpi 7160 . . . 4  |-  ( ( ( 1st `  A
)  e.  N.  /\  ( 1st `  B )  e.  N. )  -> 
( ( 1st `  A
)  .N  ( 1st `  B ) )  e. 
N. )
41, 2, 3syl2an 287 . . 3  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  (
( 1st `  A
)  .N  ( 1st `  B ) )  e. 
N. )
5 xp2nd 6072 . . . 4  |-  ( A  e.  ( N.  X.  N. )  ->  ( 2nd `  A )  e.  N. )
6 xp2nd 6072 . . . 4  |-  ( B  e.  ( N.  X.  N. )  ->  ( 2nd `  B )  e.  N. )
7 mulclpi 7160 . . . 4  |-  ( ( ( 2nd `  A
)  e.  N.  /\  ( 2nd `  B )  e.  N. )  -> 
( ( 2nd `  A
)  .N  ( 2nd `  B ) )  e. 
N. )
85, 6, 7syl2an 287 . . 3  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  (
( 2nd `  A
)  .N  ( 2nd `  B ) )  e. 
N. )
9 opexg 4158 . . 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 409 . 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 5429 . . . . 5  |-  ( x  =  A  ->  ( 1st `  x )  =  ( 1st `  A
) )
1211oveq1d 5797 . . . 4  |-  ( x  =  A  ->  (
( 1st `  x
)  .N  ( 1st `  y ) )  =  ( ( 1st `  A
)  .N  ( 1st `  y ) ) )
13 fveq2 5429 . . . . 5  |-  ( x  =  A  ->  ( 2nd `  x )  =  ( 2nd `  A
) )
1413oveq1d 5797 . . . 4  |-  ( x  =  A  ->  (
( 2nd `  x
)  .N  ( 2nd `  y ) )  =  ( ( 2nd `  A
)  .N  ( 2nd `  y ) ) )
1512, 14opeq12d 3721 . . 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 5429 . . . . 5  |-  ( y  =  B  ->  ( 1st `  y )  =  ( 1st `  B
) )
1716oveq2d 5798 . . . 4  |-  ( y  =  B  ->  (
( 1st `  A
)  .N  ( 1st `  y ) )  =  ( ( 1st `  A
)  .N  ( 1st `  B ) ) )
18 fveq2 5429 . . . . 5  |-  ( y  =  B  ->  ( 2nd `  y )  =  ( 2nd `  B
) )
1918oveq2d 5798 . . . 4  |-  ( y  =  B  ->  (
( 2nd `  A
)  .N  ( 2nd `  y ) )  =  ( ( 2nd `  A
)  .N  ( 2nd `  B ) ) )
2017, 19opeq12d 3721 . . 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 7177 . . 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 5913 . 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 1317 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 103    = wceq 1332    e. wcel 1481   _Vcvv 2689   <.cop 3535    X. cxp 4545   ` cfv 5131  (class class class)co 5782   1stc1st 6044   2ndc2nd 6045   N.cnpi 7104    .N cmi 7106    .pQ cmpq 7109
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4051  ax-sep 4054  ax-nul 4062  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-iinf 4510
This theorem depends on definitions:  df-bi 116  df-dc 821  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-ral 2422  df-rex 2423  df-reu 2424  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-int 3780  df-iun 3823  df-br 3938  df-opab 3998  df-mpt 3999  df-tr 4035  df-id 4223  df-iord 4296  df-on 4298  df-suc 4301  df-iom 4513  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-ov 5785  df-oprab 5786  df-mpo 5787  df-1st 6046  df-2nd 6047  df-recs 6210  df-irdg 6275  df-oadd 6325  df-omul 6326  df-ni 7136  df-mi 7138  df-mpq 7177
This theorem is referenced by:  mulpipq  7204
  Copyright terms: Public domain W3C validator