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

Theorem recmulnqg 7610
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.
StepHypRef Expression
1 oveq1 6024 . . . . 5  |-  ( x  =  A  ->  (
x  .Q  y )  =  ( A  .Q  y ) )
21eqeq1d 2240 . . . 4  |-  ( x  =  A  ->  (
( x  .Q  y
)  =  1Q  <->  ( A  .Q  y )  =  1Q ) )
32anbi2d 464 . . 3  |-  ( x  =  A  ->  (
( y  e.  Q.  /\  ( x  .Q  y
)  =  1Q )  <-> 
( y  e.  Q.  /\  ( A  .Q  y
)  =  1Q ) ) )
4 eleq1 2294 . . . 4  |-  ( y  =  B  ->  (
y  e.  Q.  <->  B  e.  Q. ) )
5 oveq2 6025 . . . . 5  |-  ( y  =  B  ->  ( A  .Q  y )  =  ( A  .Q  B
) )
65eqeq1d 2240 . . . 4  |-  ( y  =  B  ->  (
( A  .Q  y
)  =  1Q  <->  ( A  .Q  B )  =  1Q ) )
74, 6anbi12d 473 . . 3  |-  ( y  =  B  ->  (
( y  e.  Q.  /\  ( A  .Q  y
)  =  1Q )  <-> 
( B  e.  Q.  /\  ( A  .Q  B
)  =  1Q ) ) )
8 recexnq 7609 . . . 4  |-  ( x  e.  Q.  ->  E. y
( y  e.  Q.  /\  ( x  .Q  y
)  =  1Q ) )
9 1nq 7585 . . . . 5  |-  1Q  e.  Q.
10 mulcomnqg 7602 . . . . 5  |-  ( ( z  e.  Q.  /\  w  e.  Q. )  ->  ( z  .Q  w
)  =  ( w  .Q  z ) )
11 mulassnqg 7603 . . . . 5  |-  ( ( z  e.  Q.  /\  w  e.  Q.  /\  v  e.  Q. )  ->  (
( z  .Q  w
)  .Q  v )  =  ( z  .Q  ( w  .Q  v
) ) )
12 mulidnq 7608 . . . . 5  |-  ( z  e.  Q.  ->  (
z  .Q  1Q )  =  z )
139, 10, 11, 12caovimo 6215 . . . 4  |-  ( x  e.  Q.  ->  E* y ( y  e. 
Q.  /\  ( x  .Q  y )  =  1Q ) )
14 eu5 2127 . . . 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 ) ) )
158, 13, 14sylanbrc 417 . . 3  |-  ( x  e.  Q.  ->  E! y ( y  e. 
Q.  /\  ( x  .Q  y )  =  1Q ) )
16 df-rq 7571 . . . 4  |-  *Q  =  { <. x ,  y
>.  |  ( x  e.  Q.  /\  y  e. 
Q.  /\  ( x  .Q  y )  =  1Q ) }
17 3anass 1008 . . . . 5  |-  ( ( x  e.  Q.  /\  y  e.  Q.  /\  (
x  .Q  y )  =  1Q )  <->  ( x  e.  Q.  /\  ( y  e.  Q.  /\  (
x  .Q  y )  =  1Q ) ) )
1817opabbii 4156 . . . 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 ) ) }
1916, 18eqtri 2252 . . 3  |-  *Q  =  { <. x ,  y
>.  |  ( x  e.  Q.  /\  ( y  e.  Q.  /\  (
x  .Q  y )  =  1Q ) ) }
203, 7, 15, 19fvopab3g 5719 . 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 ) ) )
2221adantl 277 . 2  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( ( A  .Q  B )  =  1Q  <->  ( B  e.  Q.  /\  ( A  .Q  B
)  =  1Q ) ) )
2320, 22bitr4d 191 1  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( ( *Q `  A )  =  B  <-> 
( A  .Q  B
)  =  1Q ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1004    = wceq 1397   E.wex 1540   E!weu 2079   E*wmo 2080    e. wcel 2202   {copab 4149   ` cfv 5326  (class class class)co 6017   Q.cnq 7499   1Qc1q 7500    .Q cmq 7502   *Qcrq 7503
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-irdg 6535  df-1o 6581  df-oadd 6585  df-omul 6586  df-er 6701  df-ec 6703  df-qs 6707  df-ni 7523  df-mi 7525  df-mpq 7564  df-enq 7566  df-nqqs 7567  df-mqqs 7569  df-1nqqs 7570  df-rq 7571
This theorem is referenced by:  recclnq  7611  recidnq  7612  recrecnq  7613  recexprlem1ssl  7852  recexprlem1ssu  7853
  Copyright terms: Public domain W3C validator