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

Theorem clel2 2917
Description: An alternate definition of class membership when the class is a set. (Contributed by NM, 18-Aug-1993.)
Hypothesis
Ref Expression
clel2.1  |-  A  e. 
_V
Assertion
Ref Expression
clel2  |-  ( A  e.  B  <->  A. x
( x  =  A  ->  x  e.  B
) )
Distinct variable groups:    x, A    x, B

Proof of Theorem clel2
StepHypRef Expression
1 clel2.1 . . 3  |-  A  e. 
_V
2 eleq1 2356 . . 3  |-  ( x  =  A  ->  (
x  e.  B  <->  A  e.  B ) )
31, 2ceqsalv 2827 . 2  |-  ( A. x ( x  =  A  ->  x  e.  B )  <->  A  e.  B )
43bicomi 193 1  |-  ( A  e.  B  <->  A. x
( x  =  A  ->  x  e.  B
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176   A.wal 1530    = wceq 1632    e. wcel 1696   _Vcvv 2801
This theorem is referenced by:  snss  3761  mptelee  24595
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-11 1727  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-an 360  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-v 2803
  Copyright terms: Public domain W3C validator