Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ralabOLD Unicode version

Theorem ralabOLD 26354
Description: Universal quantification over a class abstraction. (Moved to ralab 2926 in main set.mm and may be deleted by mathbox owner, JM. --NM 20-Oct-2011.) (Contributed by Jeff Madsen, 10-Jun-2010.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypothesis
Ref Expression
ralab.1OLD  |-  ( y  =  x  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
ralabOLD  |-  ( A. x  e.  { y  |  ph } ch  <->  A. x
( ps  ->  ch ) )
Distinct variable groups:    x, y    ps, y
Allowed substitution hints:    ph( x, y)    ps( x)    ch( x, y)

Proof of Theorem ralabOLD
StepHypRef Expression
1 ralab.1OLD . 2  |-  ( y  =  x  ->  ( ph 
<->  ps ) )
21ralab 2926 1  |-  ( A. x  e.  { y  |  ph } ch  <->  A. x
( ps  ->  ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176   A.wal 1527   {cab 2269   A.wral 2543
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-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ral 2548  df-v 2790
  Copyright terms: Public domain W3C validator