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

Theorem onssi 4401
Description: An ordinal number is a subset of  On. (Contributed by NM, 11-Aug-1994.)
Hypothesis
Ref Expression
onssi.1  |-  A  e.  On
Assertion
Ref Expression
onssi  |-  A  C_  On

Proof of Theorem onssi
StepHypRef Expression
1 onssi.1 . 2  |-  A  e.  On
2 onss 4379 . 2  |-  ( A  e.  On  ->  A  C_  On )
31, 2ax-mp 5 1  |-  A  C_  On
Colors of variables: wff set class
Syntax hints:    e. wcel 1465    C_ wss 3041   Oncon0 4255
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099
This theorem depends on definitions:  df-bi 116  df-3an 949  df-tru 1319  df-nf 1422  df-sb 1721  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-ral 2398  df-rex 2399  df-v 2662  df-in 3047  df-ss 3054  df-uni 3707  df-tr 3997  df-iord 4258  df-on 4260
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator