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

Theorem sucexg 3049
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 1817 . 2 |- (A e. B -> A e. V)
2 sucexb 3048 . 2 |- (A e. V <-> suc A e. V)
31, 2sylib 198 1 |- (A e. B -> suc A e. V)
Colors of variables: wff set class
Syntax hints:   -> wi 3   e. wcel 958  Vcvv 1811  suc csuc 2950
This theorem is referenced by:  sucex 3050  suceloni 3062
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779  ax-un 2866
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-uni 2504  df-suc 2954
Copyright terms: Public domain