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

Theorem dfmpq2 7317
Description: Alternate definition of pre-multiplication on positive fractions. (Contributed by Jim Kingdon, 13-Sep-2019.)
Assertion
Ref Expression
dfmpq2  |-  .pQ  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  ( N.  X.  N. )  /\  y  e.  ( N.  X.  N. )
)  /\  E. w E. v E. u E. f ( ( x  =  <. w ,  v
>.  /\  y  =  <. u ,  f >. )  /\  z  =  <. ( w  .N  u ) ,  ( v  .N  f ) >. )
) }
Distinct variable group:    x, y, z, w, v, u, f

Proof of Theorem dfmpq2
StepHypRef Expression
1 df-mpo 5858 . 2  |-  ( x  e.  ( N.  X.  N. ) ,  y  e.  ( N.  X.  N. )  |->  <. ( ( 1st `  x )  .N  ( 1st `  y ) ) ,  ( ( 2nd `  x )  .N  ( 2nd `  y ) )
>. )  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  ( N.  X.  N. )  /\  y  e.  ( N.  X.  N. )
)  /\  z  =  <. ( ( 1st `  x
)  .N  ( 1st `  y ) ) ,  ( ( 2nd `  x
)  .N  ( 2nd `  y ) ) >.
) }
2 df-mpq 7307 . 2  |-  .pQ  =  ( x  e.  ( N.  X.  N. ) ,  y  e.  ( N. 
X.  N. )  |->  <. (
( 1st `  x
)  .N  ( 1st `  y ) ) ,  ( ( 2nd `  x
)  .N  ( 2nd `  y ) ) >.
)
3 1st2nd2 6154 . . . . . . . . . 10  |-  ( x  e.  ( N.  X.  N. )  ->  x  = 
<. ( 1st `  x
) ,  ( 2nd `  x ) >. )
43eqeq1d 2179 . . . . . . . . 9  |-  ( x  e.  ( N.  X.  N. )  ->  ( x  =  <. w ,  v
>. 
<-> 
<. ( 1st `  x
) ,  ( 2nd `  x ) >.  =  <. w ,  v >. )
)
5 1st2nd2 6154 . . . . . . . . . 10  |-  ( y  e.  ( N.  X.  N. )  ->  y  = 
<. ( 1st `  y
) ,  ( 2nd `  y ) >. )
65eqeq1d 2179 . . . . . . . . 9  |-  ( y  e.  ( N.  X.  N. )  ->  ( y  =  <. u ,  f
>. 
<-> 
<. ( 1st `  y
) ,  ( 2nd `  y ) >.  =  <. u ,  f >. )
)
74, 6bi2anan9 601 . . . . . . . 8  |-  ( ( x  e.  ( N. 
X.  N. )  /\  y  e.  ( N.  X.  N. ) )  ->  (
( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  <->  ( <. ( 1st `  x ) ,  ( 2nd `  x
) >.  =  <. w ,  v >.  /\  <. ( 1st `  y ) ,  ( 2nd `  y
) >.  =  <. u ,  f >. )
) )
87anbi1d 462 . . . . . . 7  |-  ( ( x  e.  ( N. 
X.  N. )  /\  y  e.  ( N.  X.  N. ) )  ->  (
( ( x  = 
<. w ,  v >.  /\  y  =  <. u ,  f >. )  /\  z  =  <. ( w  .N  u ) ,  ( v  .N  f ) >. )  <->  ( ( <. ( 1st `  x
) ,  ( 2nd `  x ) >.  =  <. w ,  v >.  /\  <. ( 1st `  y ) ,  ( 2nd `  y
) >.  =  <. u ,  f >. )  /\  z  =  <. ( w  .N  u ) ,  ( v  .N  f ) >. )
) )
98bicomd 140 . . . . . 6  |-  ( ( x  e.  ( N. 
X.  N. )  /\  y  e.  ( N.  X.  N. ) )  ->  (
( ( <. ( 1st `  x ) ,  ( 2nd `  x
) >.  =  <. w ,  v >.  /\  <. ( 1st `  y ) ,  ( 2nd `  y
) >.  =  <. u ,  f >. )  /\  z  =  <. ( w  .N  u ) ,  ( v  .N  f ) >. )  <->  ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  <. ( w  .N  u ) ,  ( v  .N  f )
>. ) ) )
1094exbidv 1863 . . . . 5  |-  ( ( x  e.  ( N. 
X.  N. )  /\  y  e.  ( N.  X.  N. ) )  ->  ( E. w E. v E. u E. f ( ( <. ( 1st `  x
) ,  ( 2nd `  x ) >.  =  <. w ,  v >.  /\  <. ( 1st `  y ) ,  ( 2nd `  y
) >.  =  <. u ,  f >. )  /\  z  =  <. ( w  .N  u ) ,  ( v  .N  f ) >. )  <->  E. w E. v E. u E. f ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  <. ( w  .N  u ) ,  ( v  .N  f )
>. ) ) )
11 xp1st 6144 . . . . . . 7  |-  ( x  e.  ( N.  X.  N. )  ->  ( 1st `  x )  e.  N. )
12 xp2nd 6145 . . . . . . 7  |-  ( x  e.  ( N.  X.  N. )  ->  ( 2nd `  x )  e.  N. )
1311, 12jca 304 . . . . . 6  |-  ( x  e.  ( N.  X.  N. )  ->  ( ( 1st `  x )  e.  N.  /\  ( 2nd `  x )  e. 
N. ) )
14 xp1st 6144 . . . . . . 7  |-  ( y  e.  ( N.  X.  N. )  ->  ( 1st `  y )  e.  N. )
15 xp2nd 6145 . . . . . . 7  |-  ( y  e.  ( N.  X.  N. )  ->  ( 2nd `  y )  e.  N. )
1614, 15jca 304 . . . . . 6  |-  ( y  e.  ( N.  X.  N. )  ->  ( ( 1st `  y )  e.  N.  /\  ( 2nd `  y )  e. 
N. ) )
17 simpll 524 . . . . . . . . . 10  |-  ( ( ( w  =  ( 1st `  x )  /\  v  =  ( 2nd `  x ) )  /\  ( u  =  ( 1st `  y
)  /\  f  =  ( 2nd `  y ) ) )  ->  w  =  ( 1st `  x
) )
18 simprl 526 . . . . . . . . . 10  |-  ( ( ( w  =  ( 1st `  x )  /\  v  =  ( 2nd `  x ) )  /\  ( u  =  ( 1st `  y
)  /\  f  =  ( 2nd `  y ) ) )  ->  u  =  ( 1st `  y
) )
1917, 18oveq12d 5871 . . . . . . . . 9  |-  ( ( ( w  =  ( 1st `  x )  /\  v  =  ( 2nd `  x ) )  /\  ( u  =  ( 1st `  y
)  /\  f  =  ( 2nd `  y ) ) )  ->  (
w  .N  u )  =  ( ( 1st `  x )  .N  ( 1st `  y ) ) )
20 simplr 525 . . . . . . . . . 10  |-  ( ( ( w  =  ( 1st `  x )  /\  v  =  ( 2nd `  x ) )  /\  ( u  =  ( 1st `  y
)  /\  f  =  ( 2nd `  y ) ) )  ->  v  =  ( 2nd `  x
) )
21 simprr 527 . . . . . . . . . 10  |-  ( ( ( w  =  ( 1st `  x )  /\  v  =  ( 2nd `  x ) )  /\  ( u  =  ( 1st `  y
)  /\  f  =  ( 2nd `  y ) ) )  ->  f  =  ( 2nd `  y
) )
2220, 21oveq12d 5871 . . . . . . . . 9  |-  ( ( ( w  =  ( 1st `  x )  /\  v  =  ( 2nd `  x ) )  /\  ( u  =  ( 1st `  y
)  /\  f  =  ( 2nd `  y ) ) )  ->  (
v  .N  f )  =  ( ( 2nd `  x )  .N  ( 2nd `  y ) ) )
2319, 22opeq12d 3773 . . . . . . . 8  |-  ( ( ( w  =  ( 1st `  x )  /\  v  =  ( 2nd `  x ) )  /\  ( u  =  ( 1st `  y
)  /\  f  =  ( 2nd `  y ) ) )  ->  <. (
w  .N  u ) ,  ( v  .N  f ) >.  =  <. ( ( 1st `  x
)  .N  ( 1st `  y ) ) ,  ( ( 2nd `  x
)  .N  ( 2nd `  y ) ) >.
)
2423eqeq2d 2182 . . . . . . 7  |-  ( ( ( w  =  ( 1st `  x )  /\  v  =  ( 2nd `  x ) )  /\  ( u  =  ( 1st `  y
)  /\  f  =  ( 2nd `  y ) ) )  ->  (
z  =  <. (
w  .N  u ) ,  ( v  .N  f ) >.  <->  z  =  <. ( ( 1st `  x
)  .N  ( 1st `  y ) ) ,  ( ( 2nd `  x
)  .N  ( 2nd `  y ) ) >.
) )
2524copsex4g 4232 . . . . . 6  |-  ( ( ( ( 1st `  x
)  e.  N.  /\  ( 2nd `  x )  e.  N. )  /\  ( ( 1st `  y
)  e.  N.  /\  ( 2nd `  y )  e.  N. ) )  ->  ( E. w E. v E. u E. f ( ( <.
( 1st `  x
) ,  ( 2nd `  x ) >.  =  <. w ,  v >.  /\  <. ( 1st `  y ) ,  ( 2nd `  y
) >.  =  <. u ,  f >. )  /\  z  =  <. ( w  .N  u ) ,  ( v  .N  f ) >. )  <->  z  =  <. ( ( 1st `  x )  .N  ( 1st `  y ) ) ,  ( ( 2nd `  x )  .N  ( 2nd `  y ) )
>. ) )
2613, 16, 25syl2an 287 . . . . 5  |-  ( ( x  e.  ( N. 
X.  N. )  /\  y  e.  ( N.  X.  N. ) )  ->  ( E. w E. v E. u E. f ( ( <. ( 1st `  x
) ,  ( 2nd `  x ) >.  =  <. w ,  v >.  /\  <. ( 1st `  y ) ,  ( 2nd `  y
) >.  =  <. u ,  f >. )  /\  z  =  <. ( w  .N  u ) ,  ( v  .N  f ) >. )  <->  z  =  <. ( ( 1st `  x )  .N  ( 1st `  y ) ) ,  ( ( 2nd `  x )  .N  ( 2nd `  y ) )
>. ) )
2710, 26bitr3d 189 . . . 4  |-  ( ( x  e.  ( N. 
X.  N. )  /\  y  e.  ( N.  X.  N. ) )  ->  ( E. w E. v E. u E. f ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  <. ( w  .N  u ) ,  ( v  .N  f )
>. )  <->  z  =  <. ( ( 1st `  x
)  .N  ( 1st `  y ) ) ,  ( ( 2nd `  x
)  .N  ( 2nd `  y ) ) >.
) )
2827pm5.32i 451 . . 3  |-  ( ( ( x  e.  ( N.  X.  N. )  /\  y  e.  ( N.  X.  N. ) )  /\  E. w E. v E. u E. f
( ( x  = 
<. w ,  v >.  /\  y  =  <. u ,  f >. )  /\  z  =  <. ( w  .N  u ) ,  ( v  .N  f ) >. )
)  <->  ( ( x  e.  ( N.  X.  N. )  /\  y  e.  ( N.  X.  N. ) )  /\  z  =  <. ( ( 1st `  x )  .N  ( 1st `  y ) ) ,  ( ( 2nd `  x )  .N  ( 2nd `  y ) )
>. ) )
2928oprabbii 5908 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ( ( x  e.  ( N.  X.  N. )  /\  y  e.  ( N.  X.  N. ) )  /\  E. w E. v E. u E. f
( ( x  = 
<. w ,  v >.  /\  y  =  <. u ,  f >. )  /\  z  =  <. ( w  .N  u ) ,  ( v  .N  f ) >. )
) }  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  ( N.  X.  N. )  /\  y  e.  ( N.  X.  N. )
)  /\  z  =  <. ( ( 1st `  x
)  .N  ( 1st `  y ) ) ,  ( ( 2nd `  x
)  .N  ( 2nd `  y ) ) >.
) }
301, 2, 293eqtr4i 2201 1  |-  .pQ  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  ( N.  X.  N. )  /\  y  e.  ( N.  X.  N. )
)  /\  E. w E. v E. u E. f ( ( x  =  <. w ,  v
>.  /\  y  =  <. u ,  f >. )  /\  z  =  <. ( w  .N  u ) ,  ( v  .N  f ) >. )
) }
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104    = wceq 1348   E.wex 1485    e. wcel 2141   <.cop 3586    X. cxp 4609   ` cfv 5198  (class class class)co 5853   {coprab 5854    e. cmpo 5855   1stc1st 6117   2ndc2nd 6118   N.cnpi 7234    .N cmi 7236    .pQ cmpq 7239
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-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-sbc 2956  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-mpt 4052  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-iota 5160  df-fun 5200  df-fv 5206  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-mpq 7307
This theorem is referenced by:  mulpipqqs  7335
  Copyright terms: Public domain W3C validator