ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  clel4 Unicode version

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

Proof of Theorem clel4
StepHypRef Expression
1 clel4.1 . . 3  |-  B  e. 
_V
2 eleq2 2253 . . 3  |-  ( x  =  B  ->  ( A  e.  x  <->  A  e.  B ) )
31, 2ceqsalv 2782 . 2  |-  ( A. x ( x  =  B  ->  A  e.  x )  <->  A  e.  B )
43bicomi 132 1  |-  ( A  e.  B  <->  A. x
( x  =  B  ->  A  e.  x
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105   A.wal 1362    = wceq 1364    e. wcel 2160   _Vcvv 2752
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1458  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-ext 2171
This theorem depends on definitions:  df-bi 117  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-v 2754
This theorem is referenced by:  intpr  3891
  Copyright terms: Public domain W3C validator