HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem onuni 3053
Description: The union of an ordinal number is an ordinal number.
Assertion
Ref Expression
onuni |- (A e. On -> U.A e. On)

Proof of Theorem onuni
StepHypRef Expression
1 onss 3049 . 2 |- (A e. On -> A (_ On)
2 ssonuni 3051 . 2 |- (A e. On -> (A (_ On -> U.A e. On))
31, 2mpd 26 1 |- (A e. On -> U.A e. On)
Colors of variables: wff set class
Syntax hints:   -> wi 3   e. wcel 999   (_ wss 2098  U.cuni 2557  Oncon0 3005
This theorem is referenced by:  onuninsuci 3165  rankxpsuc 4777
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1003  ax-gen 1004  ax-8 1005  ax-10 1007  ax-11 1008  ax-12 1009  ax-13 1010  ax-14 1011  ax-17 1012  ax-4 1014  ax-5o 1016  ax-6o 1019  ax-9o 1164  ax-10o 1182  ax-16 1252  ax-11o 1260  ax-ext 1504  ax-sep 2758  ax-pow 2798  ax-pr 2835  ax-un 2922
This theorem depends on definitions:  df-bi 154  df-or 231  df-an 232  df-3or 788  df-3an 789  df-ex 1022  df-sb 1214  df-eu 1424  df-mo 1425  df-clab 1510  df-cleq 1515  df-clel 1518  df-ne 1634  df-ral 1696  df-rex 1697  df-v 1859  df-dif 2100  df-un 2101  df-in 2102  df-ss 2104  df-nul 2332  df-pw 2454  df-sn 2464  df-pr 2465  df-tp 2467  df-op 2468  df-uni 2558  df-br 2675  df-opab 2722  df-tr 2736  df-eprel 2888  df-po 2896  df-so 2906  df-fr 2974  df-we 2991  df-ord 3008  df-on 3009
Copyright terms: Public domain