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

Theorem genpelvu 7700
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 7696 . . . . . 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 5631 . . . . 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 7550 . . . . . . 7  |-  Q.  e.  _V
65rabex 4228 . . . . . 6  |-  { f  e.  Q.  |  E. g  e.  ( 1st `  A ) E. h  e.  ( 1st `  B
) f  =  ( g G h ) }  e.  _V
75rabex 4228 . . . . . 6  |-  { f  e.  Q.  |  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B
) f  =  ( g G h ) }  e.  _V
86, 7op2nd 6293 . . . . 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 2278 . . . 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 2299 . . 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 2956 . . 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 7662 . . . . . . 7  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
14 elprnqu 7669 . . . . . . 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 7662 . . . . . . 7  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
17 elprnqu 7669 . . . . . . 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 6160 . . . . . 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 590 . . . 4  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( g  e.  ( 2nd `  A )  /\  h  e.  ( 2nd `  B ) ) )  ->  (
g G h )  e.  Q. )
22 eleq1 2292 . . . 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 2656 . 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 2236 . . . . . 6  |-  ( f  =  C  ->  (
f  =  ( g G h )  <->  C  =  ( g G h ) ) )
26252rexbidv 2555 . . . . 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 2960 . . . 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 710 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 1002    = wceq 1395    e. wcel 2200   E.wrex 2509   {crab 2512   <.cop 3669   ` cfv 5318  (class class class)co 6001    e. cmpo 6003   1stc1st 6284   2ndc2nd 6285   Q.cnq 7467   P.cnp 7478
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 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680
This theorem depends on definitions:  df-bi 117  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 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-ov 6004  df-oprab 6005  df-mpo 6006  df-1st 6286  df-2nd 6287  df-qs 6686  df-ni 7491  df-nqqs 7535  df-inp 7653
This theorem is referenced by:  genppreclu  7702  genpcuu  7707  genprndu  7709  genpdisj  7710  genpassu  7712  addnqprlemru  7745  mulnqprlemru  7761  distrlem1pru  7770  distrlem5pru  7774  1idpru  7778  ltexprlemfu  7798  recexprlem1ssu  7821  recexprlemss1u  7823  cauappcvgprlemladdfu  7841  caucvgprlemladdfu  7864
  Copyright terms: Public domain W3C validator