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

Theorem el 1860
Description: Every set is a member of some other set.
Assertion
Ref Expression
el |- E.y x e. y
Distinct variable group(s):   x,y

Proof of Theorem el
StepHypRef Expression
1 visset 1350 . . 3 |- x e. V
21snid 1830 . 2 |- x e. {x}
3 snex 1859 . . 3 |- {x} e. V
4 eleq2 1150 . . 3 |- (y = {x} -> (x e. y <-> x e. {x}))
53, 4cla4ev 1401 . 2 |- (x e. {x} -> E.y x e. y)
62, 5ax-mp 6 1 |- E.y x e. y
Colors of variables: wff set class
Syntax hints:  E.wex 678   e. wel 803   e. wcel 1092  {csn 1808
This theorem is referenced by:  axpownd 3747  zfcndinf 3764
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-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812
metamath.org