MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  onun2i Unicode version

Theorem onun2i 4998
Description: The union of two ordinal numbers is an ordinal number. (Contributed by NM, 13-Jun-1994.)
Hypotheses
Ref Expression
on.1
on.2
Assertion
Ref Expression
onun2i

Proof of Theorem onun2i
StepHypRef Expression
1 on.2 . . . 4
21onordi 4987 . . 3
3 on.1 . . . 4
43onordi 4987 . . 3
5 ordtri2or 4978 . . 3
62, 4, 5mp2an 672 . 2
73oneluni 4995 . . . 4
87, 3syl6eqel 2553 . . 3
9 ssequn1 3673 . . . 4
10 eleq1 2529 . . . . 5
111, 10mpbiri 233 . . . 4
129, 11sylbi 195 . . 3
138, 12jaoi 379 . 2
146, 13ax-mp 5 1
Colors of variables: wff setvar class
Syntax hints:  \/wo 368  =wceq 1395  e.wcel 1818  u.cun 3473  C_wss 3475  Ordword 4882   con0 4883
This theorem is referenced by:  rankunb  8289  rankelun  8311  rankelpr  8312  inar1  9174
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790  ax-9 1822  ax-10 1837  ax-11 1842  ax-12 1854  ax-13 1999  ax-ext 2435  ax-sep 4573  ax-nul 4581  ax-pr 4691
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1398  df-ex 1613  df-nf 1617  df-sb 1740  df-eu 2286  df-mo 2287  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3111  df-sbc 3328  df-dif 3478  df-un 3480  df-in 3482  df-ss 3489  df-pss 3491  df-nul 3785  df-if 3942  df-sn 4030  df-pr 4032  df-op 4036  df-uni 4250  df-br 4453  df-opab 4511  df-tr 4546  df-eprel 4796  df-po 4805  df-so 4806  df-fr 4843  df-we 4845  df-ord 4886  df-on 4887
  Copyright terms: Public domain W3C validator