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

Theorem elsuc2g 3041
Description: Variant of membership in a successor, requiring that B rather than A be a set.
Assertion
Ref Expression
elsuc2g |- (B e. C -> (A e. suc B <-> (A e. B \/ A = B)))

Proof of Theorem elsuc2g
StepHypRef Expression
1 elsnc2g 2497 . . . 4 |- (B e. C -> (A e. {B} <-> A = B))
21orbi2d 617 . . 3 |- (B e. C -> ((A e. B \/ A e. {B}) <-> (A e. B \/ A = B)))
3 elun 2225 . . 3 |- (A e. (B u. {B}) <-> (A e. B \/ A e. {B}))
42, 3syl5bb 535 . 2 |- (B e. C -> (A e. (B u. {B}) <-> (A e. B \/ A = B)))
5 df-suc 2981 . . 3 |- suc B = (B u. {B})
65eleq2i 1581 . 2 |- (A e. suc B <-> A e. (B u. {B}))
74, 6syl5bb 535 1 |- (B e. C -> (A e. suc B <-> (A e. B \/ A = B)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 144   \/ wo 220   = wceq 992   e. wcel 994   u. cun 2097  {csn 2467  suc csuc 2977
This theorem is referenced by:  elsuc2 3043  om2uzlti 6661
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 998  ax-gen 999  ax-8 1000  ax-10 1002  ax-12 1004  ax-17 1007  ax-4 1009  ax-5o 1011  ax-6o 1014  ax-9o 1159  ax-10o 1177  ax-16 1247  ax-11o 1255  ax-ext 1500
This theorem depends on definitions:  df-bi 145  df-or 222  df-an 223  df-ex 1017  df-sb 1209  df-clab 1506  df-cleq 1511  df-clel 1514  df-v 1858  df-un 2102  df-sn 2470  df-pr 2471  df-suc 2981
Copyright terms: Public domain