Theorem recmulnqg 7764

Description: Relationship between reciprocal and multiplication on positive fractions. (Contributed by Jim Kingdon, 19-Sep-2019.)

Assertion

Ref	Expression
recmulnqg	|- ( ( A e. Q. /\ B e. Q. ) -> ( ( *Q ` A ) = B <-> ( A .Q B ) = 1Q ) )

Proof of Theorem recmulnqg

Dummy variables x y z w v are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq1 6095	. . . . 5 |- ( x = A -> ( x .Q y ) = ( A .Q y ) )
2	1	eqeq1d 2247	. . . 4 |- ( x = A -> ( ( x .Q y ) = 1Q <-> ( A .Q y ) = 1Q ) )
3	2	anbi2d 468	. . 3 |- ( x = A -> ( ( y e. Q. /\ ( x .Q y ) = 1Q ) <-> ( y e. Q. /\ ( A .Q y ) = 1Q ) ) )
4		eleq1 2301	. . . 4 |- ( y = B -> ( y e. Q. <-> B e. Q. ) )
5		oveq2 6096	. . . . 5 |- ( y = B -> ( A .Q y ) = ( A .Q B ) )
6	5	eqeq1d 2247	. . . 4 |- ( y = B -> ( ( A .Q y ) = 1Q <-> ( A .Q B ) = 1Q ) )
7	4, 6	anbi12d 477	. . 3 |- ( y = B -> ( ( y e. Q. /\ ( A .Q y ) = 1Q ) <-> ( B e. Q. /\ ( A .Q B ) = 1Q ) ) )
8		recexnq 7763	. . . 4 |- ( x e. Q. -> E. y ( y e. Q. /\ ( x .Q y ) = 1Q ) )
9		1nq 7739	. . . . 5 |- 1Q e. Q.
10		mulcomnqg 7756	. . . . 5 |- ( ( z e. Q. /\ w e. Q. ) -> ( z .Q w ) = ( w .Q z ) )
11		mulassnqg 7757	. . . . 5 |- ( ( z e. Q. /\ w e. Q. /\ v e. Q. ) -> ( ( z .Q w ) .Q v ) = ( z .Q ( w .Q v ) ) )
12		mulidnq 7762	. . . . 5 |- ( z e. Q. -> ( z .Q 1Q ) = z )
13	9, 10, 11, 12	caovimo 6286	. . . 4 |- ( x e. Q. -> E* y ( y e. Q. /\ ( x .Q y ) = 1Q ) )
14		eu5 2134	. . . 4 |- ( E! y ( y e. Q. /\ ( x .Q y ) = 1Q ) <-> ( E. y ( y e. Q. /\ ( x .Q y ) = 1Q ) /\ E* y ( y e. Q. /\ ( x .Q y ) = 1Q ) ) )
15	8, 13, 14	sylanbrc 421	. . 3 |- ( x e. Q. -> E! y ( y e. Q. /\ ( x .Q y ) = 1Q ) )
16		df-rq 7725	. . . 4 |- *Q = { <. x , y >. | ( x e. Q. /\ y e. Q. /\ ( x .Q y ) = 1Q ) }
17		3anass 1013	. . . . 5 |- ( ( x e. Q. /\ y e. Q. /\ ( x .Q y ) = 1Q ) <-> ( x e. Q. /\ ( y e. Q. /\ ( x .Q y ) = 1Q ) ) )
18	17	opabbii 4199	. . . 4 |- { <. x , y >. | ( x e. Q. /\ y e. Q. /\ ( x .Q y ) = 1Q ) } = { <. x , y >. | ( x e. Q. /\ ( y e. Q. /\ ( x .Q y ) = 1Q ) ) }
19	16, 18	eqtri 2259	. . 3 |- *Q = { <. x , y >. | ( x e. Q. /\ ( y e. Q. /\ ( x .Q y ) = 1Q ) ) }
20	3, 7, 15, 19	fvopab3g 5781	. 2 |- ( ( A e. Q. /\ B e. Q. ) -> ( ( *Q ` A ) = B <-> ( B e. Q. /\ ( A .Q B ) = 1Q ) ) )
21		ibar 301	. . 3 |- ( B e. Q. -> ( ( A .Q B ) = 1Q <-> ( B e. Q. /\ ( A .Q B ) = 1Q ) ) )
22	21	adantl 277	. 2 |- ( ( A e. Q. /\ B e. Q. ) -> ( ( A .Q B ) = 1Q <-> ( B e. Q. /\ ( A .Q B ) = 1Q ) ) )
23	20, 22	bitr4d 191	1 |- ( ( A e. Q. /\ B e. Q. ) -> ( ( *Q ` A ) = B <-> ( A .Q B ) = 1Q ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   E.wex 1545   E!weu 2086   E*wmo 2087   e. wcel 2209   {copab 4192   ` cfv 5380  (class class class)co 6088   Q.cnq 7653   1Qc1q 7654   .Q cmq 7656   *Qcrq 7657

This proof depends on 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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-1o 6691  df-oadd 6695  df-omul 6696  df-er 6811  df-ec 6813  df-qs 6817  df-ni 7677  df-mi 7679  df-mpq 7718  df-enq 7720  df-nqqs 7721  df-mqqs 7723  df-1nqqs 7724  df-rq 7725

This theorem is used by:  recclnq  7765  recidnq  7766  recrecnq  7767  recexprlem1ssl  8006  recexprlem1ssu  8007