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

Theorem onelss 4317
 Description: An element of an ordinal number is a subset of the number. (Contributed by NM, 5-Jun-1994.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
onelss

Proof of Theorem onelss
StepHypRef Expression
1 eloni 4305 . 2
2 ordelss 4309 . . 3
32ex 114 . 2
41, 3syl 14 1
 Colors of variables: wff set class Syntax hints:   wi 4   wcel 1481   wss 3076   word 4292  con0 4293 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 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122 This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-in 3082  df-ss 3089  df-uni 3745  df-tr 4035  df-iord 4296  df-on 4298 This theorem is referenced by:  onelssi  4359  ssorduni  4411  onsucelsucr  4432  tfisi  4509  tfrlem9  6224  nntri2or2  6402  phpelm  6768  ennnfonelemk  11949
 Copyright terms: Public domain W3C validator