Theorem mulpipq 7582

Description: Multiplication of positive fractions in terms of positive integers. (Contributed by NM, 28-Aug-1995.) (Revised by Mario Carneiro, 8-May-2013.)

Assertion

Ref	Expression
mulpipq	|- ( ( ( A e. N. /\ B e. N. ) /\ ( C e. N. /\ D e. N. ) ) -> ( <. A , B >. .pQ <. C , D >. ) = <. ( A .N C ) , ( B .N D ) >. )

Proof of Theorem mulpipq

Step	Hyp	Ref	Expression
1		opelxpi 4755	. . 3 |- ( ( A e. N. /\ B e. N. ) -> <. A , B >. e. ( N. X. N. ) )
2		opelxpi 4755	. . 3 |- ( ( C e. N. /\ D e. N. ) -> <. C , D >. e. ( N. X. N. ) )
3		mulpipq2 7581	. . 3 |- ( ( <. A , B >. e. ( N. X. N. ) /\ <. C , D >. e. ( N. X. N. ) ) -> ( <. A , B >. .pQ <. C , D >. ) = <. ( ( 1st ` <. A , B >. ) .N ( 1st ` <. C , D >. ) ) , ( ( 2nd ` <. A , B >. ) .N ( 2nd ` <. C , D >. ) ) >. )
4	1, 2, 3	syl2an 289	. 2 |- ( ( ( A e. N. /\ B e. N. ) /\ ( C e. N. /\ D e. N. ) ) -> ( <. A , B >. .pQ <. C , D >. ) = <. ( ( 1st ` <. A , B >. ) .N ( 1st ` <. C , D >. ) ) , ( ( 2nd ` <. A , B >. ) .N ( 2nd ` <. C , D >. ) ) >. )
5		op1stg 6308	. . . 4 |- ( ( A e. N. /\ B e. N. ) -> ( 1st ` <. A , B >. ) = A )
6		op1stg 6308	. . . 4 |- ( ( C e. N. /\ D e. N. ) -> ( 1st ` <. C , D >. ) = C )
7	5, 6	oveqan12d 6032	. . 3 |- ( ( ( A e. N. /\ B e. N. ) /\ ( C e. N. /\ D e. N. ) ) -> ( ( 1st ` <. A , B >. ) .N ( 1st ` <. C , D >. ) ) = ( A .N C ) )
8		op2ndg 6309	. . . 4 |- ( ( A e. N. /\ B e. N. ) -> ( 2nd ` <. A , B >. ) = B )
9		op2ndg 6309	. . . 4 |- ( ( C e. N. /\ D e. N. ) -> ( 2nd ` <. C , D >. ) = D )
10	8, 9	oveqan12d 6032	. . 3 |- ( ( ( A e. N. /\ B e. N. ) /\ ( C e. N. /\ D e. N. ) ) -> ( ( 2nd ` <. A , B >. ) .N ( 2nd ` <. C , D >. ) ) = ( B .N D ) )
11	7, 10	opeq12d 3868	. 2 |- ( ( ( A e. N. /\ B e. N. ) /\ ( C e. N. /\ D e. N. ) ) -> <. ( ( 1st ` <. A , B >. ) .N ( 1st ` <. C , D >. ) ) , ( ( 2nd ` <. A , B >. ) .N ( 2nd ` <. C , D >. ) ) >. = <. ( A .N C ) , ( B .N D ) >. )
12	4, 11	eqtrd 2262	1 |- ( ( ( A e. N. /\ B e. N. ) /\ ( C e. N. /\ D e. N. ) ) -> ( <. A , B >. .pQ <. C , D >. ) = <. ( A .N C ) , ( B .N D ) >. )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1395   e. wcel 2200   <.cop 3670   X. cxp 4721   ` cfv 5324  (class class class)co 6013   1stc1st 6296   2ndc2nd 6297   N.cnpi 7482   .N cmi 7484   .pQ cmpq 7487

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-irdg 6531  df-oadd 6581  df-omul 6582  df-ni 7514  df-mi 7516  df-mpq 7555

This theorem is referenced by: (None)