MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  genpelv Unicode version

Theorem genpelv 8640
Description: Membership in value of general operation (addition or multiplication) on positive reals. (Contributed by NM, 13-Mar-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
genp.1  |-  F  =  ( w  e.  P. ,  v  e.  P.  |->  { x  |  E. y  e.  w  E. z  e.  v  x  =  ( y G z ) } )
genp.2  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y G z )  e.  Q. )
Assertion
Ref Expression
genpelv  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( C  e.  ( A F B )  <->  E. g  e.  A  E. h  e.  B  C  =  ( g G h ) ) )
Distinct variable groups:    x, y,
z, g, h, A   
x, B, y, z, g, h    x, w, v, G, y, z, g, h    g, F    C, g, h
Allowed substitution hints:    A( w, v)    B( w, v)    C( x, y, z, w, v)    F( x, y, z, w, v, h)

Proof of Theorem genpelv
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 genp.1 . . . 4  |-  F  =  ( w  e.  P. ,  v  e.  P.  |->  { x  |  E. y  e.  w  E. z  e.  v  x  =  ( y G z ) } )
2 genp.2 . . . 4  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y G z )  e.  Q. )
31, 2genpv 8639 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A F B )  =  { f  |  E. g  e.  A  E. h  e.  B  f  =  ( g G h ) } )
43eleq2d 2363 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( C  e.  ( A F B )  <-> 
C  e.  { f  |  E. g  e.  A  E. h  e.  B  f  =  ( g G h ) } ) )
5 id 19 . . . . . 6  |-  ( C  =  ( g G h )  ->  C  =  ( g G h ) )
6 ovex 5899 . . . . . 6  |-  ( g G h )  e. 
_V
75, 6syl6eqel 2384 . . . . 5  |-  ( C  =  ( g G h )  ->  C  e.  _V )
87rexlimivw 2676 . . . 4  |-  ( E. h  e.  B  C  =  ( g G h )  ->  C  e.  _V )
98rexlimivw 2676 . . 3  |-  ( E. g  e.  A  E. h  e.  B  C  =  ( g G h )  ->  C  e.  _V )
10 eqeq1 2302 . . . 4  |-  ( f  =  C  ->  (
f  =  ( g G h )  <->  C  =  ( g G h ) ) )
11102rexbidv 2599 . . 3  |-  ( f  =  C  ->  ( E. g  e.  A  E. h  e.  B  f  =  ( g G h )  <->  E. g  e.  A  E. h  e.  B  C  =  ( g G h ) ) )
129, 11elab3 2934 . 2  |-  ( C  e.  { f  |  E. g  e.  A  E. h  e.  B  f  =  ( g G h ) }  <->  E. g  e.  A  E. h  e.  B  C  =  ( g G h ) )
134, 12syl6bb 252 1  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( C  e.  ( A F B )  <->  E. g  e.  A  E. h  e.  B  C  =  ( g G h ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1632    e. wcel 1696   {cab 2282   E.wrex 2557   _Vcvv 2801  (class class class)co 5874    e. cmpt2 5876   Q.cnq 8490   P.cnp 8497
This theorem is referenced by:  genpprecl  8641  genpss  8644  genpnnp  8645  genpcd  8646  genpnmax  8647  genpass  8649  distrlem1pr  8665  distrlem5pr  8667  1idpr  8669  ltexprlem6  8681  reclem3pr  8689  reclem4pr  8690
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528  ax-inf2 7358
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pss 3181  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-tp 3661  df-op 3662  df-uni 3844  df-br 4040  df-opab 4094  df-tr 4130  df-eprel 4321  df-id 4325  df-po 4330  df-so 4331  df-fr 4368  df-we 4370  df-ord 4411  df-on 4412  df-lim 4413  df-suc 4414  df-om 4673  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-iota 5235  df-fun 5273  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-ni 8512  df-nq 8552  df-np 8621
  Copyright terms: Public domain W3C validator