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

Theorem genpelvl 7453
Description: Membership in lower cut of general operation (addition or multiplication) on positive reals. (Contributed by Jim Kingdon, 2-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
genpelvl  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( C  e.  ( 1st `  ( A F B ) )  <->  E. g  e.  ( 1st `  A ) E. h  e.  ( 1st `  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 genpelvl
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 7450 . . . . . 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 5490 . . . . 5  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( 1st `  ( A F B ) )  =  ( 1st `  <. { 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 7304 . . . . . . 7  |-  Q.  e.  _V
65rabex 4126 . . . . . 6  |-  { f  e.  Q.  |  E. g  e.  ( 1st `  A ) E. h  e.  ( 1st `  B
) f  =  ( g G h ) }  e.  _V
75rabex 4126 . . . . . 6  |-  { f  e.  Q.  |  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B
) f  =  ( g G h ) }  e.  _V
86, 7op1st 6114 . . . . 5  |-  ( 1st `  <. { 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.  ( 1st `  A ) E. h  e.  ( 1st `  B ) f  =  ( g G h ) }
94, 8eqtrdi 2215 . . . 4  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( 1st `  ( A F B ) )  =  { f  e. 
Q.  |  E. g  e.  ( 1st `  A
) E. h  e.  ( 1st `  B
) f  =  ( g G h ) } )
109eleq2d 2236 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( C  e.  ( 1st `  ( A F B ) )  <-> 
C  e.  { f  e.  Q.  |  E. g  e.  ( 1st `  A ) E. h  e.  ( 1st `  B
) f  =  ( g G h ) } ) )
11 elrabi 2879 . . 3  |-  ( C  e.  { f  e. 
Q.  |  E. g  e.  ( 1st `  A
) E. h  e.  ( 1st `  B
) f  =  ( g G h ) }  ->  C  e.  Q. )
1210, 11syl6bi 162 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( C  e.  ( 1st `  ( A F B ) )  ->  C  e.  Q. ) )
13 prop 7416 . . . . . . 7  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
14 elprnql 7422 . . . . . . 7  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  g  e.  ( 1st `  A ) )  -> 
g  e.  Q. )
1513, 14sylan 281 . . . . . 6  |-  ( ( A  e.  P.  /\  g  e.  ( 1st `  A ) )  -> 
g  e.  Q. )
16 prop 7416 . . . . . . 7  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
17 elprnql 7422 . . . . . . 7  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  h  e.  ( 1st `  B ) )  ->  h  e.  Q. )
1816, 17sylan 281 . . . . . 6  |-  ( ( B  e.  P.  /\  h  e.  ( 1st `  B ) )  ->  h  e.  Q. )
192caovcl 5996 . . . . . 6  |-  ( ( g  e.  Q.  /\  h  e.  Q. )  ->  ( g G h )  e.  Q. )
2015, 18, 19syl2an 287 . . . . 5  |-  ( ( ( A  e.  P.  /\  g  e.  ( 1st `  A ) )  /\  ( B  e.  P.  /\  h  e.  ( 1st `  B ) ) )  ->  ( g G h )  e.  Q. )
2120an4s 578 . . . 4  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( g  e.  ( 1st `  A )  /\  h  e.  ( 1st `  B ) ) )  ->  (
g G h )  e.  Q. )
22 eleq1 2229 . . . 4  |-  ( C  =  ( g G h )  ->  ( C  e.  Q.  <->  ( g G h )  e. 
Q. ) )
2321, 22syl5ibrcom 156 . . 3  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( g  e.  ( 1st `  A )  /\  h  e.  ( 1st `  B ) ) )  ->  ( C  =  ( g G h )  ->  C  e.  Q. )
)
2423rexlimdvva 2591 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( E. g  e.  ( 1st `  A
) E. h  e.  ( 1st `  B
) C  =  ( g G h )  ->  C  e.  Q. ) )
25 eqeq1 2172 . . . . . 6  |-  ( f  =  C  ->  (
f  =  ( g G h )  <->  C  =  ( g G h ) ) )
26252rexbidv 2491 . . . . 5  |-  ( f  =  C  ->  ( E. g  e.  ( 1st `  A ) E. h  e.  ( 1st `  B ) f  =  ( g G h )  <->  E. g  e.  ( 1st `  A ) E. h  e.  ( 1st `  B ) C  =  ( g G h ) ) )
2726elrab3 2883 . . . 4  |-  ( C  e.  Q.  ->  ( C  e.  { f  e.  Q.  |  E. g  e.  ( 1st `  A
) E. h  e.  ( 1st `  B
) f  =  ( g G h ) }  <->  E. g  e.  ( 1st `  A ) E. h  e.  ( 1st `  B ) C  =  ( g G h ) ) )
2810, 27sylan9bb 458 . . 3  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  C  e.  Q. )  ->  ( C  e.  ( 1st `  ( A F B ) )  <->  E. g  e.  ( 1st `  A ) E. h  e.  ( 1st `  B ) C  =  ( g G h ) ) )
2928ex 114 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( C  e.  Q.  ->  ( C  e.  ( 1st `  ( A F B ) )  <->  E. g  e.  ( 1st `  A ) E. h  e.  ( 1st `  B ) C  =  ( g G h ) ) ) )
3012, 24, 29pm5.21ndd 695 1  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( C  e.  ( 1st `  ( A F B ) )  <->  E. g  e.  ( 1st `  A ) E. h  e.  ( 1st `  B ) C  =  ( g G h ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 968    = wceq 1343    e. wcel 2136   E.wrex 2445   {crab 2448   <.cop 3579   ` cfv 5188  (class class class)co 5842    e. cmpo 5844   1stc1st 6106   2ndc2nd 6107   Q.cnq 7221   P.cnp 7232
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-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-qs 6507  df-ni 7245  df-nqqs 7289  df-inp 7407
This theorem is referenced by:  genpprecll  7455  genpcdl  7460  genprndl  7462  genpdisj  7464  genpassl  7465  addnqprlemrl  7498  mulnqprlemrl  7514  distrlem1prl  7523  distrlem5prl  7527  1idprl  7531  ltexprlemfl  7550  recexprlem1ssl  7574  recexprlemss1l  7576  cauappcvgprlemladdfl  7596
  Copyright terms: Public domain W3C validator