HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem clel4 1376
Description: An alternate definition of class membership when the class is a set.
Hypothesis
Ref Expression
clel4.1 |- B e. V
Assertion
Ref Expression
clel4 |- (A e. B <-> A.x(x = B -> A e. x))
Distinct variable group(s):   x,A   x,B

Proof of Theorem clel4
StepHypRef Expression
1 clel4.1 . . 3 |- B e. V
2 eleq2 1150 . . 3 |- (x = B -> (A e. x <-> A e. B))
31, 2ceqsalv 1364 . 2 |- (A.x(x = B -> A e. x) <-> A e. B)
43bicomi 150 1 |- (A e. B <-> A.x(x = B -> A e. x))
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127  A.wal 672   = wceq 1091   e. wcel 1092  Vcvv 1348
This theorem is referenced by:  intpr 1990  dfiin2 2015
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-gen 677  ax-9 799  ax-12 802  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349
metamath.org