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

Theorem elabgf 2925
Description: Membership in a class abstraction, using implicit substitution. Compare Theorem 6.13 of [Quine] p. 44. This version has bound-variable hypotheses in place of distinct variable restrictions. (Contributed by NM, 21-Sep-2003.) (Revised by Mario Carneiro, 12-Oct-2016.)
Hypotheses
Ref Expression
elabgf.1  |-  F/_ x A
elabgf.2  |-  F/ x ps
elabgf.3  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
elabgf  |-  ( A  e.  B  ->  ( A  e.  { x  |  ph }  <->  ps )
)

Proof of Theorem elabgf
StepHypRef Expression
1 elabgf.1 . 2  |-  F/_ x A
2 nfab1 2434 . . . 4  |-  F/_ x { x  |  ph }
31, 2nfel 2440 . . 3  |-  F/ x  A  e.  { x  |  ph }
4 elabgf.2 . . 3  |-  F/ x ps
53, 4nfbi 1784 . 2  |-  F/ x
( A  e.  {
x  |  ph }  <->  ps )
6 eleq1 2356 . . 3  |-  ( x  =  A  ->  (
x  e.  { x  |  ph }  <->  A  e.  { x  |  ph }
) )
7 elabgf.3 . . 3  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
86, 7bibi12d 312 . 2  |-  ( x  =  A  ->  (
( x  e.  {
x  |  ph }  <->  ph )  <->  ( A  e. 
{ x  |  ph } 
<->  ps ) ) )
9 abid 2284 . 2  |-  ( x  e.  { x  | 
ph }  <->  ph )
101, 5, 8, 9vtoclgf 2855 1  |-  ( A  e.  B  ->  ( A  e.  { x  |  ph }  <->  ps )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176   F/wnf 1534    = wceq 1632    e. wcel 1696   {cab 2282   F/_wnfc 2419
This theorem is referenced by:  elabf  2926  elabg  2928  elab3gf  2932  elrabf  2935
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-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-v 2803
  Copyright terms: Public domain W3C validator