MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elsuc2g Unicode version

Theorem elsuc2g 4460
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
StepHypRef Expression
1 df-suc 4398 . . 3  |-  suc  B  =  ( B  u.  { B } )
21eleq2i 2347 . 2  |-  ( A  e.  suc  B  <->  A  e.  ( B  u.  { B } ) )
3 elun 3316 . . 3  |-  ( A  e.  ( B  u.  { B } )  <->  ( A  e.  B  \/  A  e.  { B } ) )
4 elsnc2g 3668 . . . 4  |-  ( B  e.  V  ->  ( A  e.  { B } 
<->  A  =  B ) )
54orbi2d 682 . . 3  |-  ( B  e.  V  ->  (
( A  e.  B  \/  A  e.  { B } )  <->  ( A  e.  B  \/  A  =  B ) ) )
63, 5syl5bb 248 . 2  |-  ( B  e.  V  ->  ( A  e.  ( B  u.  { B } )  <-> 
( A  e.  B  \/  A  =  B
) ) )
72, 6syl5bb 248 1  |-  ( B  e.  V  ->  ( A  e.  suc  B  <->  ( A  e.  B  \/  A  =  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    \/ wo 357    = wceq 1623    e. wcel 1684    u. cun 3150   {csn 3640   suc csuc 4394
This theorem is referenced by:  elsuc2  4462  om2uzlti  11013
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-v 2790  df-un 3157  df-sn 3646  df-suc 4398
  Copyright terms: Public domain W3C validator