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

Theorem elabgf 2887
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 2396 . . . 4  |-  F/_ x { x  |  ph }
31, 2nfel 2402 . . 3  |-  F/ x  A  e.  { x  |  ph }
4 elabgf.2 . . 3  |-  F/ x ps
53, 4nfbi 1738 . 2  |-  F/ x
( A  e.  {
x  |  ph }  <->  ps )
6 eleq1 2318 . . 3  |-  ( x  =  A  ->  (
x  e.  { x  |  ph }  <->  A  e.  { x  |  ph }
) )
7 elabgf.3 . . 3  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
86, 7bibi12d 314 . 2  |-  ( x  =  A  ->  (
( x  e.  {
x  |  ph }  <->  ph )  <->  ( A  e. 
{ x  |  ph } 
<->  ps ) ) )
9 abid 2246 . 2  |-  ( x  e.  { x  | 
ph }  <->  ph )
101, 5, 8, 9vtoclgf 2817 1  |-  ( A  e.  B  ->  ( A  e.  { x  |  ph }  <->  ps )
)
Colors of variables: wff set class
Syntax hints:    -> wi 6    <-> wb 178   F/wnf 1539    = wceq 1619    e. wcel 1621   {cab 2244   F/_wnfc 2381
This theorem is referenced by:  elabf  2888  elabg  2890  elab3gf  2894  elrabf  2897
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1927  ax-ext 2239
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1884  df-clab 2245  df-cleq 2251  df-clel 2254  df-nfc 2383  df-v 2765
  Copyright terms: Public domain W3C validator