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

Theorem genpprecl 8625
Description: Pre-closure law for general operation on positive reals. (Contributed by NM, 10-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
genpprecl  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( ( C  e.  A  /\  D  e.  B )  ->  ( C G D )  e.  ( A F B ) ) )
Distinct variable groups:    x, y,
z, A    x, B, y, z    x, w, v, G, y, z
Allowed substitution hints:    A( w, v)    B( w, v)    C( x, y, z, w, v)    D( x, y, z, w, v)    F( x, y, z, w, v)

Proof of Theorem genpprecl
Dummy variables  g  h are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2283 . . 3  |-  ( C G D )  =  ( C G D )
2 rspceov 5893 . . 3  |-  ( ( C  e.  A  /\  D  e.  B  /\  ( C G D )  =  ( C G D ) )  ->  E. g  e.  A  E. h  e.  B  ( C G D )  =  ( g G h ) )
31, 2mp3an3 1266 . 2  |-  ( ( C  e.  A  /\  D  e.  B )  ->  E. g  e.  A  E. h  e.  B  ( C G D )  =  ( g G h ) )
4 genp.1 . . 3  |-  F  =  ( w  e.  P. ,  v  e.  P.  |->  { x  |  E. y  e.  w  E. z  e.  v  x  =  ( y G z ) } )
5 genp.2 . . 3  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y G z )  e.  Q. )
64, 5genpelv 8624 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( ( C G D )  e.  ( A F B )  <->  E. g  e.  A  E. h  e.  B  ( C G D )  =  ( g G h ) ) )
73, 6syl5ibr 212 1  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( ( C  e.  A  /\  D  e.  B )  ->  ( C G D )  e.  ( A F B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    = wceq 1623    e. wcel 1684   {cab 2269   E.wrex 2544  (class class class)co 5858    e. cmpt2 5860   Q.cnq 8474   P.cnp 8481
This theorem is referenced by:  genpn0  8627  genpnmax  8631  addclprlem2  8641  mulclprlem  8643  distrlem1pr  8649  distrlem4pr  8650  ltaddpr  8658  ltexprlem7  8666
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512  ax-inf2 7342
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 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-sbc 2992  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pss 3168  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-tp 3648  df-op 3649  df-uni 3828  df-br 4024  df-opab 4078  df-tr 4114  df-eprel 4305  df-id 4309  df-po 4314  df-so 4315  df-fr 4352  df-we 4354  df-ord 4395  df-on 4396  df-lim 4397  df-suc 4398  df-om 4657  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-iota 5219  df-fun 5257  df-fv 5263  df-ov 5861  df-oprab 5862  df-mpt2 5863  df-ni 8496  df-nq 8536  df-np 8605
  Copyright terms: Public domain W3C validator