Theorem elsuc2g 4404

Description: Variant of membership in a successor, requiring that B rather than A be a set. (Contributed by NM, 28-Oct-2003.)

Assertion

Ref	Expression
elsuc2g	|- ( B e. V -> ( A e. suc B <-> ( A e. B \/ A = B ) ) )

Proof of Theorem elsuc2g

Step	Hyp	Ref	Expression
1		df-suc 4370	. . 3 |- suc B = ( B u. { B } )
2	1	eleq2i 2244	. 2 |- ( A e. suc B <-> A e. ( B u. { B } ) )
3		elun 3276	. . 3 |- ( A e. ( B u. { B } ) <-> ( A e. B \/ A e. { B } ) )
4		elsn2g 3625	. . . 4 |- ( B e. V -> ( A e. { B } <-> A = B ) )
5	4	orbi2d 790	. . 3 |- ( B e. V -> ( ( A e. B \/ A e. { B } ) <-> ( A e. B \/ A = B ) ) )
6	3, 5	bitrid 192	. 2 |- ( B e. V -> ( A e. ( B u. { B } ) <-> ( A e. B \/ A = B ) ) )
7	2, 6	bitrid 192	1 |- ( B e. V -> ( A e. suc B <-> ( A e. B \/ A = B ) ) )

Syntax hints:   -> wi 4   <-> wb 105   \/ wo 708   = wceq 1353   e. wcel 2148   u. cun 3127   {csn 3592   suc csuc 4364

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2739  df-un 3133  df-sn 3598  df-suc 4370

This theorem is referenced by:  elsuc2  4406  nntri3or  6490  frec2uzltd  10397