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

Theorem sucexg 2302
Description: The successor of a set is a set (generalization).
Assertion
Ref Expression
sucexg |- (A e. B -> suc A e. V)

Proof of Theorem sucexg
StepHypRef Expression
1 elisset 1354 . 2 |- (A e. B -> A e. V)
2 sucexb 2301 . 2 |- (A e. V <-> suc A e. V)
31, 2sylib 173 1 |- (A e. B -> suc A e. V)
Colors of variables: wff set class
Syntax hints:   -> wi 2   e. wcel 1092  Vcvv 1348  suc csuc 2201
This theorem is referenced by:  sucex 2303  suceloni 2314
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-un 1076  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  df-uni 1920  df-suc 2205
metamath.org