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

Theorem genpelvl 6702
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 6699 . . . . . 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 5202 . . . . 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 6553 . . . . . . 7  |-  Q.  e.  _V
65rabex 3922 . . . . . 6  |-  { f  e.  Q.  |  E. g  e.  ( 1st `  A ) E. h  e.  ( 1st `  B
) f  =  ( g G h ) }  e.  _V
75rabex 3922 . . . . . 6  |-  { f  e.  Q.  |  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B
) f  =  ( g G h ) }  e.  _V
86, 7op1st 5793 . . . . 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, 8syl6eq 2129 . . . 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 2148 . . 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 2746 . . 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 161 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( C  e.  ( 1st `  ( A F B ) )  ->  C  e.  Q. ) )
13 prop 6665 . . . . . . 7  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
14 elprnql 6671 . . . . . . 7  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  g  e.  ( 1st `  A ) )  -> 
g  e.  Q. )
1513, 14sylan 277 . . . . . 6  |-  ( ( A  e.  P.  /\  g  e.  ( 1st `  A ) )  -> 
g  e.  Q. )
16 prop 6665 . . . . . . 7  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
17 elprnql 6671 . . . . . . 7  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  h  e.  ( 1st `  B ) )  ->  h  e.  Q. )
1816, 17sylan 277 . . . . . 6  |-  ( ( B  e.  P.  /\  h  e.  ( 1st `  B ) )  ->  h  e.  Q. )
192caovcl 5675 . . . . . 6  |-  ( ( g  e.  Q.  /\  h  e.  Q. )  ->  ( g G h )  e.  Q. )
2015, 18, 19syl2an 283 . . . . 5  |-  ( ( ( A  e.  P.  /\  g  e.  ( 1st `  A ) )  /\  ( B  e.  P.  /\  h  e.  ( 1st `  B ) ) )  ->  ( g G h )  e.  Q. )
2120an4s 552 . . . 4  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( g  e.  ( 1st `  A )  /\  h  e.  ( 1st `  B ) ) )  ->  (
g G h )  e.  Q. )
22 eleq1 2141 . . . 4  |-  ( C  =  ( g G h )  ->  ( C  e.  Q.  <->  ( g G h )  e. 
Q. ) )
2321, 22syl5ibrcom 155 . . 3  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( g  e.  ( 1st `  A )  /\  h  e.  ( 1st `  B ) ) )  ->  ( C  =  ( g G h )  ->  C  e.  Q. )
)
2423rexlimdvva 2484 . 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 2087 . . . . . 6  |-  ( f  =  C  ->  (
f  =  ( g G h )  <->  C  =  ( g G h ) ) )
26252rexbidv 2391 . . . . 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 2750 . . . 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 449 . . 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 113 . 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 653 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 102    <-> wb 103    /\ w3a 919    = wceq 1284    e. wcel 1433   E.wrex 2349   {crab 2352   <.cop 3401   ` cfv 4922  (class class class)co 5532    |-> cmpt2 5534   1stc1st 5785   2ndc2nd 5786   Q.cnq 6470   P.cnp 6481
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-coll 3893  ax-sep 3896  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-iinf 4329
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-ral 2353  df-rex 2354  df-reu 2355  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-iom 4332  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-1st 5787  df-2nd 5788  df-qs 6135  df-ni 6494  df-nqqs 6538  df-inp 6656
This theorem is referenced by:  genpprecll  6704  genpcdl  6709  genprndl  6711  genpdisj  6713  genpassl  6714  addnqprlemrl  6747  mulnqprlemrl  6763  distrlem1prl  6772  distrlem5prl  6776  1idprl  6780  ltexprlemfl  6799  recexprlem1ssl  6823  recexprlemss1l  6825  cauappcvgprlemladdfl  6845
  Copyright terms: Public domain W3C validator