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

Theorem genpelvu 7543
Description: Membership in upper cut of general operation (addition or multiplication) on positive reals. (Contributed by Jim Kingdon, 15-Oct-2019.)
Hypotheses
Ref Expression
genpelvl.1  |-  F  =  ( w  e.  P. ,  v  e.  P.  |->  <. { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 1st `  w )  /\  z  e.  ( 1st `  v
)  /\  x  =  ( y G z ) ) } ,  { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 2nd `  w )  /\  z  e.  ( 2nd `  v
)  /\  x  =  ( y G z ) ) } >. )
genpelvl.2  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y G z )  e.  Q. )
Assertion
Ref Expression
genpelvu  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( C  e.  ( 2nd `  ( A F B ) )  <->  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B ) C  =  ( g G h ) ) )
Distinct variable groups:    x, y, z, g, h, w, v, A    x, B, y, z, g, h, w, v    x, G, y, z, g, h, w, v    g, F    C, g, h
Allowed substitution hints:    C( x, y, z, w, v)    F( x, y, z, w, v, h)

Proof of Theorem genpelvu
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 genpelvl.1 . . . . . . 7  |-  F  =  ( w  e.  P. ,  v  e.  P.  |->  <. { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 1st `  w )  /\  z  e.  ( 1st `  v
)  /\  x  =  ( y G z ) ) } ,  { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 2nd `  w )  /\  z  e.  ( 2nd `  v
)  /\  x  =  ( y G z ) ) } >. )
2 genpelvl.2 . . . . . . 7  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y G z )  e.  Q. )
31, 2genipv 7539 . . . . . 6  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A F B )  =  <. { f  e.  Q.  |  E. g  e.  ( 1st `  A ) E. h  e.  ( 1st `  B
) f  =  ( g G h ) } ,  { f  e.  Q.  |  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B
) f  =  ( g G h ) } >. )
43fveq2d 5538 . . . . 5  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( 2nd `  ( A F B ) )  =  ( 2nd `  <. { f  e.  Q.  |  E. g  e.  ( 1st `  A ) E. h  e.  ( 1st `  B ) f  =  ( g G h ) } ,  {
f  e.  Q.  |  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B ) f  =  ( g G h ) } >. )
)
5 nqex 7393 . . . . . . 7  |-  Q.  e.  _V
65rabex 4162 . . . . . 6  |-  { f  e.  Q.  |  E. g  e.  ( 1st `  A ) E. h  e.  ( 1st `  B
) f  =  ( g G h ) }  e.  _V
75rabex 4162 . . . . . 6  |-  { f  e.  Q.  |  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B
) f  =  ( g G h ) }  e.  _V
86, 7op2nd 6173 . . . . 5  |-  ( 2nd `  <. { f  e. 
Q.  |  E. g  e.  ( 1st `  A
) E. h  e.  ( 1st `  B
) f  =  ( g G h ) } ,  { f  e.  Q.  |  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B
) f  =  ( g G h ) } >. )  =  {
f  e.  Q.  |  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B ) f  =  ( g G h ) }
94, 8eqtrdi 2238 . . . 4  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( 2nd `  ( A F B ) )  =  { f  e. 
Q.  |  E. g  e.  ( 2nd `  A
) E. h  e.  ( 2nd `  B
) f  =  ( g G h ) } )
109eleq2d 2259 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( C  e.  ( 2nd `  ( A F B ) )  <-> 
C  e.  { f  e.  Q.  |  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B
) f  =  ( g G h ) } ) )
11 elrabi 2905 . . 3  |-  ( C  e.  { f  e. 
Q.  |  E. g  e.  ( 2nd `  A
) E. h  e.  ( 2nd `  B
) f  =  ( g G h ) }  ->  C  e.  Q. )
1210, 11biimtrdi 163 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( C  e.  ( 2nd `  ( A F B ) )  ->  C  e.  Q. ) )
13 prop 7505 . . . . . . 7  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
14 elprnqu 7512 . . . . . . 7  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  g  e.  ( 2nd `  A ) )  -> 
g  e.  Q. )
1513, 14sylan 283 . . . . . 6  |-  ( ( A  e.  P.  /\  g  e.  ( 2nd `  A ) )  -> 
g  e.  Q. )
16 prop 7505 . . . . . . 7  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
17 elprnqu 7512 . . . . . . 7  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  h  e.  ( 2nd `  B ) )  ->  h  e.  Q. )
1816, 17sylan 283 . . . . . 6  |-  ( ( B  e.  P.  /\  h  e.  ( 2nd `  B ) )  ->  h  e.  Q. )
192caovcl 6052 . . . . . 6  |-  ( ( g  e.  Q.  /\  h  e.  Q. )  ->  ( g G h )  e.  Q. )
2015, 18, 19syl2an 289 . . . . 5  |-  ( ( ( A  e.  P.  /\  g  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  h  e.  ( 2nd `  B ) ) )  ->  ( g G h )  e.  Q. )
2120an4s 588 . . . 4  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( g  e.  ( 2nd `  A )  /\  h  e.  ( 2nd `  B ) ) )  ->  (
g G h )  e.  Q. )
22 eleq1 2252 . . . 4  |-  ( C  =  ( g G h )  ->  ( C  e.  Q.  <->  ( g G h )  e. 
Q. ) )
2321, 22syl5ibrcom 157 . . 3  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( g  e.  ( 2nd `  A )  /\  h  e.  ( 2nd `  B ) ) )  ->  ( C  =  ( g G h )  ->  C  e.  Q. )
)
2423rexlimdvva 2615 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( E. g  e.  ( 2nd `  A
) E. h  e.  ( 2nd `  B
) C  =  ( g G h )  ->  C  e.  Q. ) )
25 eqeq1 2196 . . . . . 6  |-  ( f  =  C  ->  (
f  =  ( g G h )  <->  C  =  ( g G h ) ) )
26252rexbidv 2515 . . . . 5  |-  ( f  =  C  ->  ( E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B ) f  =  ( g G h )  <->  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B ) C  =  ( g G h ) ) )
2726elrab3 2909 . . . 4  |-  ( C  e.  Q.  ->  ( C  e.  { f  e.  Q.  |  E. g  e.  ( 2nd `  A
) E. h  e.  ( 2nd `  B
) f  =  ( g G h ) }  <->  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B ) C  =  ( g G h ) ) )
2810, 27sylan9bb 462 . . 3  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  C  e.  Q. )  ->  ( C  e.  ( 2nd `  ( A F B ) )  <->  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B ) C  =  ( g G h ) ) )
2928ex 115 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( C  e.  Q.  ->  ( C  e.  ( 2nd `  ( A F B ) )  <->  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B ) C  =  ( g G h ) ) ) )
3012, 24, 29pm5.21ndd 706 1  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( C  e.  ( 2nd `  ( A F B ) )  <->  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B ) C  =  ( g G h ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 980    = wceq 1364    e. wcel 2160   E.wrex 2469   {crab 2472   <.cop 3610   ` cfv 5235  (class class class)co 5897    e. cmpo 5899   1stc1st 6164   2ndc2nd 6165   Q.cnq 7310   P.cnp 7321
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-coll 4133  ax-sep 4136  ax-pow 4192  ax-pr 4227  ax-un 4451  ax-setind 4554  ax-iinf 4605
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-ral 2473  df-rex 2474  df-reu 2475  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-id 4311  df-iom 4608  df-xp 4650  df-rel 4651  df-cnv 4652  df-co 4653  df-dm 4654  df-rn 4655  df-res 4656  df-ima 4657  df-iota 5196  df-fun 5237  df-fn 5238  df-f 5239  df-f1 5240  df-fo 5241  df-f1o 5242  df-fv 5243  df-ov 5900  df-oprab 5901  df-mpo 5902  df-1st 6166  df-2nd 6167  df-qs 6566  df-ni 7334  df-nqqs 7378  df-inp 7496
This theorem is referenced by:  genppreclu  7545  genpcuu  7550  genprndu  7552  genpdisj  7553  genpassu  7555  addnqprlemru  7588  mulnqprlemru  7604  distrlem1pru  7613  distrlem5pru  7617  1idpru  7621  ltexprlemfu  7641  recexprlem1ssu  7664  recexprlemss1u  7666  cauappcvgprlemladdfu  7684  caucvgprlemladdfu  7707
  Copyright terms: Public domain W3C validator