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

Theorem elrabf 2922
Description: Membership in a restricted class abstraction, using implicit substitution. This version has bound-variable hypotheses in place of distinct variable restrictions. (Contributed by NM, 21-Sep-2003.)
Hypotheses
Ref Expression
elrabf.1  |-  F/_ x A
elrabf.2  |-  F/_ x B
elrabf.3  |-  F/ x ps
elrabf.4  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
elrabf  |-  ( A  e.  { x  e.  B  |  ph }  <->  ( A  e.  B  /\  ps ) )

Proof of Theorem elrabf
StepHypRef Expression
1 elex 2796 . 2  |-  ( A  e.  { x  e.  B  |  ph }  ->  A  e.  _V )
2 elex 2796 . . 3  |-  ( A  e.  B  ->  A  e.  _V )
32adantr 451 . 2  |-  ( ( A  e.  B  /\  ps )  ->  A  e. 
_V )
4 df-rab 2552 . . . 4  |-  { x  e.  B  |  ph }  =  { x  |  ( x  e.  B  /\  ph ) }
54eleq2i 2347 . . 3  |-  ( A  e.  { x  e.  B  |  ph }  <->  A  e.  { x  |  ( x  e.  B  /\  ph ) } )
6 elrabf.1 . . . 4  |-  F/_ x A
7 elrabf.2 . . . . . 6  |-  F/_ x B
86, 7nfel 2427 . . . . 5  |-  F/ x  A  e.  B
9 elrabf.3 . . . . 5  |-  F/ x ps
108, 9nfan 1771 . . . 4  |-  F/ x
( A  e.  B  /\  ps )
11 eleq1 2343 . . . . 5  |-  ( x  =  A  ->  (
x  e.  B  <->  A  e.  B ) )
12 elrabf.4 . . . . 5  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
1311, 12anbi12d 691 . . . 4  |-  ( x  =  A  ->  (
( x  e.  B  /\  ph )  <->  ( A  e.  B  /\  ps )
) )
146, 10, 13elabgf 2912 . . 3  |-  ( A  e.  _V  ->  ( A  e.  { x  |  ( x  e.  B  /\  ph ) } 
<->  ( A  e.  B  /\  ps ) ) )
155, 14syl5bb 248 . 2  |-  ( A  e.  _V  ->  ( A  e.  { x  e.  B  |  ph }  <->  ( A  e.  B  /\  ps ) ) )
161, 3, 15pm5.21nii 342 1  |-  ( A  e.  { x  e.  B  |  ph }  <->  ( A  e.  B  /\  ps ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358   F/wnf 1531    = wceq 1623    e. wcel 1684   {cab 2269   F/_wnfc 2406   {crab 2547   _Vcvv 2788
This theorem is referenced by:  elrab  2923  rabxfrd  4555  onminsb  4590  nnawordex  6635  tskwe  7583  iundisj  18905  sltval2  23721  nobndlem5  23761  rfcnpre3  27116  rfcnpre4  27117  stoweidlem16  27177  stoweidlem26  27187  stoweidlem27  27188  stoweidlem31  27192  stoweidlem34  27195  stoweidlem51  27212  stoweidlem52  27213  stoweidlem59  27220  bnj1388  28436
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-rab 2552  df-v 2790
  Copyright terms: Public domain W3C validator