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

Theorem genpelvu 7793
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 7789 . . . . . 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 5652 . . . . 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 7643 . . . . . . 7  |-  Q.  e.  _V
65rabex 4239 . . . . . 6  |-  { f  e.  Q.  |  E. g  e.  ( 1st `  A ) E. h  e.  ( 1st `  B
) f  =  ( g G h ) }  e.  _V
75rabex 4239 . . . . . 6  |-  { f  e.  Q.  |  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B
) f  =  ( g G h ) }  e.  _V
86, 7op2nd 6319 . . . . 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 2280 . . . 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 2301 . . 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 2960 . . 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 7755 . . . . . . 7  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
14 elprnqu 7762 . . . . . . 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 7755 . . . . . . 7  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
17 elprnqu 7762 . . . . . . 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 6187 . . . . . 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 592 . . . 4  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( g  e.  ( 2nd `  A )  /\  h  e.  ( 2nd `  B ) ) )  ->  (
g G h )  e.  Q. )
22 eleq1 2294 . . . 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 2659 . 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 2238 . . . . . 6  |-  ( f  =  C  ->  (
f  =  ( g G h )  <->  C  =  ( g G h ) ) )
26252rexbidv 2558 . . . . 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 2964 . . . 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 713 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 1005    = wceq 1398    e. wcel 2202   E.wrex 2512   {crab 2515   <.cop 3676   ` cfv 5333  (class class class)co 6028    e. cmpo 6030   1stc1st 6310   2ndc2nd 6311   Q.cnq 7560   P.cnp 7571
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-qs 6751  df-ni 7584  df-nqqs 7628  df-inp 7746
This theorem is referenced by:  genppreclu  7795  genpcuu  7800  genprndu  7802  genpdisj  7803  genpassu  7805  addnqprlemru  7838  mulnqprlemru  7854  distrlem1pru  7863  distrlem5pru  7867  1idpru  7871  ltexprlemfu  7891  recexprlem1ssu  7914  recexprlemss1u  7916  cauappcvgprlemladdfu  7934  caucvgprlemladdfu  7957
  Copyright terms: Public domain W3C validator