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

Theorem elabgf 3169
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 2546 . . . 4  |-  F/_ x { x  |  ph }
31, 2nfel 2557 . . 3  |-  F/ x  A  e.  { x  |  ph }
4 elabgf.2 . . 3  |-  F/ x ps
53, 4nfbi 1942 . 2  |-  F/ x
( A  e.  {
x  |  ph }  <->  ps )
6 eleq1 2454 . . 3  |-  ( x  =  A  ->  (
x  e.  { x  |  ph }  <->  A  e.  { x  |  ph }
) )
7 elabgf.3 . . 3  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
86, 7bibi12d 319 . 2  |-  ( x  =  A  ->  (
( x  e.  {
x  |  ph }  <->  ph )  <->  ( A  e. 
{ x  |  ph } 
<->  ps ) ) )
9 abid 2369 . 2  |-  ( x  e.  { x  | 
ph }  <->  ph )
101, 5, 8, 9vtoclgf 3090 1  |-  ( A  e.  B  ->  ( A  e.  { x  |  ph }  <->  ps )
)
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    = wceq 1399   F/wnf 1624    e. wcel 1826   {cab 2367   F/_wnfc 2530
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1626  ax-4 1639  ax-5 1712  ax-6 1755  ax-7 1798  ax-10 1845  ax-11 1850  ax-12 1862  ax-13 2006  ax-ext 2360
This theorem depends on definitions:  df-bi 185  df-an 369  df-tru 1402  df-ex 1621  df-nf 1625  df-sb 1748  df-clab 2368  df-cleq 2374  df-clel 2377  df-nfc 2532  df-v 3036
This theorem is referenced by:  elabf  3170  elabg  3172  elab3gf  3176  elrabf  3180
  Copyright terms: Public domain W3C validator