Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bj-nn0suc Unicode version

Theorem bj-nn0suc 16327
Description: Proof of (biconditional form of) nn0suc 4696 from the core axioms of CZF. See also bj-nn0sucALT 16341. As a characterization of the elements of  om, this could be labeled "elom". (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.)
Assertion
Ref Expression
bj-nn0suc  |-  ( A  e.  om  <->  ( A  =  (/)  \/  E. x  e.  om  A  =  suc  x ) )
Distinct variable group:    x, A

Proof of Theorem bj-nn0suc
StepHypRef Expression
1 bj-nn0suc0 16313 . . 3  |-  ( A  e.  om  ->  ( A  =  (/)  \/  E. x  e.  A  A  =  suc  x ) )
2 bj-omtrans 16319 . . . . 5  |-  ( A  e.  om  ->  A  C_ 
om )
3 ssrexv 3289 . . . . 5  |-  ( A 
C_  om  ->  ( E. x  e.  A  A  =  suc  x  ->  E. x  e.  om  A  =  suc  x ) )
42, 3syl 14 . . . 4  |-  ( A  e.  om  ->  ( E. x  e.  A  A  =  suc  x  ->  E. x  e.  om  A  =  suc  x ) )
54orim2d 793 . . 3  |-  ( A  e.  om  ->  (
( A  =  (/)  \/ 
E. x  e.  A  A  =  suc  x )  ->  ( A  =  (/)  \/  E. x  e. 
om  A  =  suc  x ) ) )
61, 5mpd 13 . 2  |-  ( A  e.  om  ->  ( A  =  (/)  \/  E. x  e.  om  A  =  suc  x ) )
7 peano1 4686 . . . 4  |-  (/)  e.  om
8 eleq1 2292 . . . 4  |-  ( A  =  (/)  ->  ( A  e.  om  <->  (/)  e.  om ) )
97, 8mpbiri 168 . . 3  |-  ( A  =  (/)  ->  A  e. 
om )
10 bj-peano2 16302 . . . . 5  |-  ( x  e.  om  ->  suc  x  e.  om )
11 eleq1a 2301 . . . . . 6  |-  ( suc  x  e.  om  ->  ( A  =  suc  x  ->  A  e.  om )
)
1211imp 124 . . . . 5  |-  ( ( suc  x  e.  om  /\  A  =  suc  x
)  ->  A  e.  om )
1310, 12sylan 283 . . . 4  |-  ( ( x  e.  om  /\  A  =  suc  x )  ->  A  e.  om )
1413rexlimiva 2643 . . 3  |-  ( E. x  e.  om  A  =  suc  x  ->  A  e.  om )
159, 14jaoi 721 . 2  |-  ( ( A  =  (/)  \/  E. x  e.  om  A  =  suc  x )  ->  A  e.  om )
166, 15impbii 126 1  |-  ( A  e.  om  <->  ( A  =  (/)  \/  E. x  e.  om  A  =  suc  x ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    \/ wo 713    = wceq 1395    e. wcel 2200   E.wrex 2509    C_ wss 3197   (/)c0 3491   suc csuc 4456   omcom 4682
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-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-nul 4210  ax-pr 4293  ax-un 4524  ax-bd0 16176  ax-bdim 16177  ax-bdan 16178  ax-bdor 16179  ax-bdn 16180  ax-bdal 16181  ax-bdex 16182  ax-bdeq 16183  ax-bdel 16184  ax-bdsb 16185  ax-bdsep 16247  ax-infvn 16304
This theorem depends on definitions:  df-bi 117  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-sn 3672  df-pr 3673  df-uni 3889  df-int 3924  df-suc 4462  df-iom 4683  df-bdc 16204  df-bj-ind 16290
This theorem is referenced by:  bj-findis  16342
  Copyright terms: Public domain W3C validator