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

Theorem elomssom 4709
Description: A natural number ordinal is, as a set, included in the set of natural number ordinals. (Contributed by NM, 21-Jun-1998.) Extract this result from the previous proof of elnn 4710. (Revised by BJ, 7-Aug-2024.)
Assertion
Ref Expression
elomssom  |-  ( A  e.  om  ->  A  C_ 
om )

Proof of Theorem elomssom
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sseq1 3251 . 2  |-  ( y  =  (/)  ->  ( y 
C_  om  <->  (/)  C_  om )
)
2 sseq1 3251 . 2  |-  ( y  =  x  ->  (
y  C_  om  <->  x  C_  om )
)
3 sseq1 3251 . 2  |-  ( y  =  suc  x  -> 
( y  C_  om  <->  suc  x  C_  om ) )
4 sseq1 3251 . 2  |-  ( y  =  A  ->  (
y  C_  om  <->  A  C_  om )
)
5 0ss 3535 . 2  |-  (/)  C_  om
6 unss 3383 . . . . 5  |-  ( ( x  C_  om  /\  {
x }  C_  om )  <->  ( x  u.  { x } )  C_  om )
7 vex 2806 . . . . . . 7  |-  x  e. 
_V
87snss 3813 . . . . . 6  |-  ( x  e.  om  <->  { x }  C_  om )
98anbi2i 457 . . . . 5  |-  ( ( x  C_  om  /\  x  e.  om )  <->  ( x  C_ 
om  /\  { x }  C_  om ) )
10 df-suc 4474 . . . . . 6  |-  suc  x  =  ( x  u. 
{ x } )
1110sseq1i 3254 . . . . 5  |-  ( suc  x  C_  om  <->  ( x  u.  { x } ) 
C_  om )
126, 9, 113bitr4i 212 . . . 4  |-  ( ( x  C_  om  /\  x  e.  om )  <->  suc  x  C_  om )
1312biimpi 120 . . 3  |-  ( ( x  C_  om  /\  x  e.  om )  ->  suc  x  C_  om )
1413expcom 116 . 2  |-  ( x  e.  om  ->  (
x  C_  om  ->  suc  x  C_  om )
)
151, 2, 3, 4, 5, 14finds 4704 1  |-  ( A  e.  om  ->  A  C_ 
om )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2202    u. cun 3199    C_ wss 3201   (/)c0 3496   {csn 3673   suc csuc 4468   omcom 4694
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-iinf 4692
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-uni 3899  df-int 3934  df-suc 4474  df-iom 4695
This theorem is referenced by:  elnn  4710  2ssom  6735  nninfwlpoimlemginf  7435  ennnfonelemg  13104
  Copyright terms: Public domain W3C validator