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

Theorem clel2 1891
Description: An alternate definition of class membership when the class is a set.
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 1534 . . 3 |- (x = A -> (x e. B <-> A e. B))
31, 2ceqsalv 1827 . 2 |- (A.x(x = A -> x e. B) <-> A e. B)
43bicomi 172 1 |- (A e. B <-> A.x(x = A -> x e. B))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146  A.wal 954   = wceq 956   e. wcel 958  Vcvv 1811
This theorem is referenced by:  snss 2461
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 963  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-ext 1459
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-v 1812
Copyright terms: Public domain