ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  elsuc2g Unicode version

Theorem elsuc2g 4545
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 4511 . . 3  |-  suc  B  =  ( B  u.  { B } )
21eleq2i 2305 . 2  |-  ( A  e.  suc  B  <->  A  e.  ( B  u.  { B } ) )
3 elun 3370 . . 3  |-  ( A  e.  ( B  u.  { B } )  <->  ( A  e.  B  \/  A  e.  { B } ) )
4 elsn2g 3738 . . . 4  |-  ( B  e.  V  ->  ( A  e.  { B } 
<->  A  =  B ) )
54orbi2d 802 . . 3  |-  ( B  e.  V  ->  (
( A  e.  B  \/  A  e.  { B } )  <->  ( A  e.  B  \/  A  =  B ) ) )
63, 5bitrid 192 . 2  |-  ( B  e.  V  ->  ( A  e.  ( B  u.  { B } )  <-> 
( A  e.  B  \/  A  =  B
) ) )
72, 6bitrid 192 1  |-  ( B  e.  V  ->  ( A  e.  suc  B  <->  ( A  e.  B  \/  A  =  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    \/ wo 720    = wceq 1402    e. wcel 2209    u. cun 3218   {csn 3705   suc csuc 4505
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-un 3224  df-sn 3711  df-suc 4511
This theorem is referenced by:  elsuc2  4547  nntri3or  6756  frec2uzltd  10818
  Copyright terms: Public domain W3C validator